| Unique-maximum and conflict-free coloring for hypergraphs and tree graphs P Cheilaris, B Keszegh, D Pálvölgyi SIAM Journal on Discrete Mathematics 27 (4), 1775-1787, 2013 | 56 | 2013 |
| Conflict-free coloring P Cheilaris City University of New York, 2009 | 46 | 2009 |
| Graph unique-maximum and conflict-free colorings P Cheilaris, G Tóth Journal of Discrete Algorithms 9 (3), 241-251, 2011 | 39 | 2011 |
| Online conflict-free colouring for hypergraphs A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky Combinatorics, Probability and Computing 19 (4), 493-516, 2010 | 38 | 2010 |
| Conflict-free coloring for intervals: from offline to online A Bar-Noy, P Cheilaris, S Smorodinsky Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006 | 36 | 2006 |
| Deterministic conflict-free coloring for intervals: from offline to online A Bar-Noy, P Cheilaris, S Smorodinsky ACM Transactions on Algorithms (TALG) 4 (4), 1-18, 2008 | 32 | 2008 |
| Strong conflict-free coloring for intervals P Cheilaris, L Gargano, AA Rescigno, S Smorodinsky Algorithmica 70 (4), 732-749, 2014 | 28 | 2014 |
| On the complexity of higher order abstract Voronoi diagrams C Bohler, P Cheilaris, R Klein, CH Liu, E Papadopoulou, M Zavershynskyi Computational Geometry 48 (8), 539-551, 2015 | 27 | 2015 |
| Online conflict-free colorings for hypergraphs A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007 | 20 | 2007 |
| On the complexity of higher order abstract Voronoi diagrams C Bohler, P Cheilaris, R Klein, CH Liu, E Papadopoulou, M Zavershynskyi Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 18 | 2013 |
| Neochromatica P Cheilaris, E Specker, S Zachos Commentationes Mathematicae Universitatis Carolinae 51 (3), 469-480, 2010 | 16 | 2010 |
| A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters P Cheilaris, E Khramtcova, S Langerman, E Papadopoulou Latin American Symposium on Theoretical Informatics, 96-107, 2014 | 11 | 2014 |
| A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters P Cheilaris, E Khramtcova, S Langerman, E Papadopoulou Algorithmica 76, 935-960, 2016 | 9 | 2016 |
| Paging mobile users in cellular networks: Optimality versus complexity and simplicity A Bar-Noy, P Cheilaris, Y Feng, MJ Golin Theoretical Computer Science 470, 23-35, 2013 | 9 | 2013 |
| Ordered coloring of grids and related graphs A Bar-Noy, P Cheilaris, M Lampis, V Mitsou, S Zachos Theoretical Computer Science 444, 40-51, 2012 | 9 | 2012 |
| Conflict-free coloring with respect to a subset of intervals P Cheilaris, S Smorodinsky arXiv preprint arXiv:1204.6422, 2012 | 8 | 2012 |
| The potential to improve the choice: list conflict-free coloring for geometric hypergraphs P Cheilaris, S Smorodinsky, M Sulovskż Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011 | 8 | 2011 |
| Weakening the online adversary just enough to get optimal conflict-free colorings for intervals A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007 | 7 | 2007 |
| Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis P Cheilaris, SK Dey, M Gabrani, E Papadopoulou Mathematical Software–ICMS 2014: 4th International Congress, Seoul, South …, 2014 | 6 | 2014 |
| Randomized online conflict-free coloring for hypergraphs A Bar-Noy, P Cheilaris, S Smorodinsky Journal of Combinatorics, Probability and Computing 19 (4), 493-516, 2006 | 6 | 2006 |
