Panagiotis Cheilaris

According to our database, Panagiotis Cheilaris authored at least 20 papers between 2006 and 2017.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2017

Stathis Zachos at 70!

Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters.

Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou

Algorithmica, 2016

2015

On the complexity of higher order abstract Voronoi diagrams.

Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi

Comput. Geom., 2015

2014

Strong Conflict-Free Coloring for Intervals.

Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky

Algorithmica, 2014

A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters.

Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis.

Panagiotis Cheilaris, Sandeep Kumar Dey, Maria Gabrani, Evanthia Papadopoulou

Proceedings of the Mathematical Software - ICMS 2014, 2014

2013

Paging mobile users in cellular networks: Optimality versus complexity and simplicity.

Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Mordecai J. Golin

Theor. Comput. Sci., 2013

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.

Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi

SIAM J. Discret. Math., 2013

2012

Ordered coloring of grids and related graphs.

Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos

Theor. Comput. Sci., 2012

Conflict-free coloring with respect to a subset of intervals

Panagiotis Cheilaris, Shakhar Smorodinsky

CoRR, 2012

2011

Graph unique-maximum and conflict-free colorings.

Panagiotis Cheilaris, Géza Tóth

J. Discrete Algorithms, 2011

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs.

Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Online Conflict-Free Colouring for Hypergraphs.

Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky

Comb. Probab. Comput., 2010

Choosability in geometric hypergraphs

Panagiotis Cheilaris, Shakhar Smorodinsky

CoRR, 2010

Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems.

Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Finding mobile data under delay constraints with searching costs.

Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2008

Deterministic conflict-free coloring for intervals: From offline to online.

Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky

ACM Trans. Algorithms, 2008

2007

Weakening the online adversary just enough to get optimal conflict-free colorings for intervals.

Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Online Conflict-Free Colorings for Hypergraphs.

Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Conflict-free coloring for intervals: from offline to online.

Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006