Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Cheilaris, Panagiotis"'
In the Hausdorff Voronoi diagram of a family of \emph{clusters of points} in the plane, the distance between a point $t$ and a cluster $P$ is measured as the maximum distance between $t$ and any point in $P$, and the diagram is defined in a nearest-n
Externí odkaz:
http://arxiv.org/abs/1312.3904
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 in P. This diagram has direct applications in VLSI design. We conside
Externí odkaz:
http://arxiv.org/abs/1306.5838
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 colors of all other vertices in S. The discrete interval hypergrap
Externí odkaz:
http://arxiv.org/abs/1204.6422
Given a geometric hypergraph (or a range-space) $H=(V,\cal E)$, a coloring of its vertices is said to be conflict-free if for every hyperedge $S \in \cal E$ there is at least one vertex in $S$ whose color is distinct from the colors of all other vert
Externí odkaz:
http://arxiv.org/abs/1005.5520
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 are ordered, and in every hyperedge of the hypergraph the maximum col
Externí odkaz:
http://arxiv.org/abs/1002.4210
Autor:
Cheilaris, Panagiotis, Toth, Geza
We investigate the relationship between two kinds of vertex colorings of graphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every path of the graph the maximum color appears only
Externí odkaz:
http://arxiv.org/abs/0912.3004
Autor:
Bohler, Cecilia, Cheilaris, Panagiotis, Klein, Rolf, Liu, Chih-Hung, Papadopoulou, Evanthia, Zavershynskyi, Maksym
Publikováno v:
In Computational Geometry: Theory and Applications September 2015 48(8):539-551
Publikováno v:
In Theoretical Computer Science 28 January 2013 470:23-35
Publikováno v:
In Theoretical Computer Science 27 July 2012 444:40-51
Autor:
Cheilaris, Panagiotis, Tóth, Géza
Publikováno v:
In Journal of Discrete Algorithms 2011 9(3):241-251