Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Panagiotis Cheilaris"'
Publikováno v:
Algorithmica
LATIN 2014: Theoretical Informatics ISBN: 9783642544224
LATIN
LATIN 2014: Theoretical Informatics ISBN: 9783642544224
LATIN
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcec58acb768ed728edec41cee31f81a
Autor:
Chih-Hung Liu, Cecilia Bohler, Evanthia Papadopoulou, Panagiotis Cheilaris, Maksym Zavershynskyi, Rolf Klein
Publikováno v:
Computational Geometry: Theory and Aplications
Abstract Voronoi diagrams (AVDs) are based on bisecting curves enjoying simple combinatorial properties, rather than on the geometric notions of sites and circles. They serve as a unifying concept. Once the bisector system of any concrete type of Vor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45950ef0f23990370a9a0ff0e406556b
https://doi.org/10.1016/j.comgeo.2015.04.008
https://doi.org/10.1016/j.comgeo.2015.04.008
Autor:
Martin Fürer, Panagiotis Cheilaris, Christos Nomikos, Euripides Markou, Nikolaos Papaspyrou, Eleni Bakali, Dimitris Fotakis, Katerina Potika, Costas D. Koutras, Christos H. Papadimitriou, Aris Pagourtzis
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
CIAC
This year we are celebrating the 70th birthday of Stathis! We take this chance to recall some of his remarkable contributions to Computer Science.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1afd97f73302facf4c5e8084a468de72
https://doi.org/10.1007/978-3-319-57586-5_39
https://doi.org/10.1007/978-3-319-57586-5_39
Publikováno v:
Theoretical Computer Science. 470:23-35
A mobile user is roaming in a zone composed of many cells in a cellular network system. When a call arrives, the system pages the user in these cells since the user never reports its location unless it leaves the zone. Each cell is associated with a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cfa2a1baceac794a6637f2446f6741d
Publikováno v:
SIAM Journal on Discrete Mathematics. 27:1775-1787
We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum (UM) colorings and conflict-free (CF) colorings. In a UM coloring, the colors are ordered, and in every hyperedge of the hypergraph the maximum color
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b76415200acbed7f0d1950b37f2f4716
https://doi.org/10.1137/120880471
https://doi.org/10.1137/120880471
Publikováno v:
Theoretical Computer Science. 444:40-51
We investigate a coloring problem, called ordered coloring, in grids and some other families of grid-like graphs. Ordered coloring (also known as vertex ranking) has applications, among other areas, in efficient solving of sparse linear systems of eq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6155465232b6a3c968783886f3484ef6
Publikováno v:
Combinatorics, Probability and Computing. 19:493-516
We provide a framework for online conflict-free colouring of any hypergraph. We introduce the notion of a degenerate hypergraph, which characterizes hypergraphs that arise in geometry. We use our framework to obtain an efficient randomized online alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e3e92ce51530d6e65586626b63b1210
https://doi.org/10.1017/s0963548309990587
https://doi.org/10.1017/s0963548309990587
Publikováno v:
ACM Transactions on Algorithms. 4:1-18
We investigate deterministic algorithms for a frequency assignment problem in cellular networks. The problem can be modeled as a special vertex coloring problem for hypergraphs: In every hyperedge there must exist a vertex with a color that occurs ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcbb721309b7b72852ce275230705dba
https://doi.org/10.1145/1383369.1383375
https://doi.org/10.1145/1383369.1383375
Autor:
Maria Gabrani, Panagiotis Cheilaris, Nathalie Casati, Evanthia Papadopoulo, Sandeep Kumar Dey
Publikováno v:
SPIE Proceedings.
Early identification of problematic patterns in real designs is of great value as the lithographic simulation tools face significant timing challenges. To reduce the processing time such a tool selects only a fraction of possible patterns,which have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc6338dc86355903563a1a3a594fa93b
https://doi.org/10.1117/12.2085547
https://doi.org/10.1117/12.2085547
Autor:
Rolf Klein, Maksym Zavershynskyi, Chih-Hung Liu, Cecilia Bohler, Evanthia Papadopoulou, Panagiotis Cheilaris
Publikováno v:
Automata, Languages, and Programming ISBN: 9783642392054
ICALP (1)
ICALP (1)
Voronoi diagrams [15,16] are based on bisecting curves enjoying simple combinatorial properties, rather than on the geometric notions of sites and circles. They serve as a unifying concept. Once the bisector system of any concrete type of Voronoi dia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57251ae912d0efbce06592e6c256dd63
https://doi.org/10.1007/978-3-642-39206-1_18
https://doi.org/10.1007/978-3-642-39206-1_18