Panagiotis Cheilaris, Ph.D.

Affiliations: 
2009 Computer Science City University of New York, New York, NY, United States 
Area:
Computer Science
Google:
"Panagiotis Cheilaris"

Parents

Sign in to add mentor
Stathis Zachos grad student 2009 CUNY
 (Conflict-free coloring.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Bohler C, Cheilaris P, Klein R, et al. (2013) On the complexity of higher order abstract Voronoi diagrams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 208-219
Cheilaris P, Keszegh B, Pálvölgyi D. (2012) Unique-maximum and conflict-free coloring for hypergraphs and tree graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7147: 190-201
Bar-Noy A, Cheilaris P, Lampis M, et al. (2012) Ordered coloring of grids and related graphs Theoretical Computer Science. 444: 40-51
Cheilaris P, Gargano L, Rescigno AA, et al. (2012) Strong conflict-free coloring for intervals Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7676: 4-13
Cheilaris P, Smorodinsky S, Sulovský M. (2011) The potential to improve the choice: List conflict-free coloring for geometric hypergraphs Proceedings of the Annual Symposium On Computational Geometry. 424-432
Cheilaris P, Tóth G. (2011) Graph unique-maximum and conflict-free colorings Journal of Discrete Algorithms. 9: 241-251
Bar-Noy A, Cheilaris P, Lampis M, et al. (2010) Ordered coloring grids and related graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5869: 30-43
Bar-Noy A, Cheilaris P, Smorodinsky S. (2008) Deterministic conflict-free coloring for intervals: From offline to online Acm Transactions On Algorithms. 4
Bar-Noy A, Cheilaris P, Olonetsky S, et al. (2007) Online conflict-free colorings for hypergraphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4596: 219-230
Bar-Noy A, Cheilaris P, Smorodinsky S. (2006) Conflict-free coloring for intervals: From offline to online Annual Acm Symposium On Parallelism in Algorithms and Architectures. 2006: 128-137
See more...