5 citations · 10 across the 7 of their papers we have counts for
7 papers
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman +1
In the Hausdorff Voronoi diagram of a family of \emph{clusters of points} in the plane, the distance between a point and a cluster is measured as the maximum distance betwe…
Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters
Panagiotis Cheilaris, Elena Khramtcova, Evanthia Papadopoulou
In the Hausdorff Voronoi diagram of a set of clusters of points in the plane, the distance between a point t and a cluster P is the maximum Euclidean distance between t and a point…
Strong Conflict-Free Coloring of Intervals
Luisa Gargano, Adele A. Rescigno
We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the colo…
Conflict-free coloring with respect to a subset of intervals
Panagiotis Cheilaris, Shakhar Smorodinsky
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S \in E there is at least one vertex in S whose color is distinct from…
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský
Given a geometric hypergraph (or a range-space) , a coloring of its vertices is said to be conflict-free if for every hyperedge there is at least one v…
Unique-maximum and conflict-free colorings for hypergraphs and tree graphs
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi
We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors…