Conflict-free coloring for intervals: from offline to online. - Amotz Bar-Noy; Panagiotis Cheilaris; Shakhar Smorodinsky (SPAA, 2006)

Online Conflict-Free Colorings for Hypergraphs. - Amotz Bar-Noy; Panagiotis Cheilaris; Svetlana Olonetsky; Shakhar Smorodinsky (ICALP, 2007)

Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. - Amotz Bar-Noy; Panagiotis Cheilaris; Svetlana Olonetsky; Shakhar Smorodinsky (SPAA, 2007)

Deterministic conflict-free coloring for intervals: From offline to online. - Amotz Bar-Noy; Panagiotis Cheilaris; Shakhar Smorodinsky (ACM Trans. Algorithms, 2008)

Finding mobile data under delay constraints with searching costs. - Amotz Bar-Noy; Panagiotis Cheilaris; Yi Feng 002; Asaf Levin (PODC, 2010)

Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems. - Amotz Bar-Noy; Panagiotis Cheilaris; Yi Feng 002 (SEA, 2010)

Choosability in geometric hypergraphs - Panagiotis Cheilaris; Shakhar Smorodinsky (CoRR, 2010)

Online Conflict-Free Colouring for Hypergraphs. - Amotz Bar-Noy; Panagiotis Cheilaris; Svetlana Olonetsky; Shakhar Smorodinsky (Comb. Probab. Comput., 2010)

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. - Panagiotis Cheilaris; Shakhar Smorodinsky; Marek Sulovský (SCG, 2011)

Graph unique-maximum and conflict-free colorings. - Panagiotis Cheilaris; Géza Tóth 001 (J. Discrete Algorithms, 2011)

Conflict-free coloring with respect to a subset of intervals - Panagiotis Cheilaris; Shakhar Smorodinsky (CoRR, 2012)

Ordered coloring of grids and related graphs. - Amotz Bar-Noy; Panagiotis Cheilaris; Michael Lampis; Valia Mitsou; Stathis Zachos (Theor. Comput. Sci., 2012)

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)

Paging mobile users in cellular networks: Optimality versus complexity and simplicity. - Amotz Bar-Noy; Panagiotis Cheilaris; Yi Feng 002; Mordecai J. Golin (Theor. Comput. Sci., 2013)

Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis. - Panagiotis Cheilaris; Sandeep Kumar Dey; Maria Gabrani; Evanthia Papadopoulou (ICMS, 2014)

A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. - Panagiotis Cheilaris; Elena Khramtcova; Stefan Langerman; Evanthia Papadopoulou (LATIN, 2014)

Strong Conflict-Free Coloring for Intervals. - Panagiotis Cheilaris; Luisa Gargano; Adele A. Rescigno; Shakhar Smorodinsky (Algorithmica, 2014)

On the complexity of higher order abstract Voronoi diagrams. - Cecilia Bohler; Panagiotis Cheilaris; Rolf Klein; Chih-Hung Liu 001; Evanthia Papadopoulou; Maksym Zavershynskyi (Comput. Geom., 2015)

A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. - Panagiotis Cheilaris; Elena Khramtcova; Stefan Langerman; Evanthia Papadopoulou (Algorithmica, 2016)

Stathis Zachos at 70! - Eleni Bakali; Panagiotis Cheilaris; Dimitris Fotakis 001; Martin Fürer; Costas D. Koutras; Euripides Markou; Christos Nomikos; Aris Pagourtzis; Christos H. Papadimitriou; Nikolaos S. Papaspyrou; Katerina Potika (CIAC, 2017)