Panagiotis Cheilaris, Shakhar Smorodinsky.
Conflict-free coloring with respect to a subset of intervals.
draft pdf
http://arxiv.org/abs/1204.6422
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis,
Valia Mitsou, Stathis Zachos.
Ordered coloring of grids and related graphs.
Theoretical Computer Science, 444, pages 40-51, 2012.
[Selected papers from the
16th International Colloquium on Structural Information and
Communication Complexity (SIROCCO 2009).]
revised preprint pdf
http://dx.doi.org/10.1016/j.tcs.2012.04.036
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi.
Unique-maximum and conflict-free colorings for hypergraphs
and tree graphs.
In Proceedings of the
38th International Conference on Current Trends in
Theory and Practice of Computer Science (SOFSEM),
LNCS 7147, pages 190-201, 2012.
http://dx.doi.org/10.1007/978-3-642-27660-6_16
extended preprint pdf
preprint pdf
http://arxiv.org/abs/1002.4210
Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský.
The potential to improve the choice:
list conflict-free coloring for geometric hypergraphs.
In Proceedings of the 27th annual
Symposium on Computational Geometry (SoCG),
pages 424-432, 2011.
http://doi.acm.org/10.1145/1998196.1998266
draft pdf
http://arxiv.org/abs/1005.5520v3
(makes http://arxiv.org/abs/1005.5520v2 obsolete)
Panagiotis Cheilaris, Géza Tóth.
Graph unique-maximum and conflict-free colorings.
Journal of Discrete Algorithms, 9(3), pages 241-251, 2011.
[Selected papers from the
7th International Conference on Algorithms and Complexity (CIAC 2010).]
revised preprint pdf
http://dx.doi.org/10.1016/j.jda.2011.03.005
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky,
Shakhar Smorodinsky.
Online conflict-free coloring for hypergraphs.
Combinatorics, Probability and Computing,
19, pages 493-516, 2010.
http://dx.doi.org/10.1017/S0963548309990587
preprint pdf
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin.
Finding mobile data under delay constraints with searching costs.
In Proceedings of the 29th Symposium on
Principles of Distributed Computing (PoDC), pages 297-304, 2010.
http://doi.acm.org/10.1145/1835698.1835774
pdf
extended draft version pdf
Panagiotis Cheilaris, Shakhar Smorodinsky.
Choosability in geometric hypergraphs.
draft pdf
http://arxiv.org/abs/1005.5520v2
(made obsolete by http://arxiv.org/abs/1005.5520v3)
Panagiotis Cheilaris, Géza Tóth.
Graph unique-maximum and conflict-free colorings.
In Proceedings of the 7th International Conference on
Algorithms and Complexity (CIAC), LNCS 6078, pages 143-154, 2010.
revised preprint pdf
extended preprint pdf
arXiv:0912.3004v1
http://dx.doi.org/10.1007/978-3-642-13073-1_14
(Invited to special issue of Journal of Discrete Algorithms.)
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng.
Paging multiple users in a cellular network:
Yellow page and conference call problems.
In Proceedings of 9th International Symposium on Experimental Algorithms (SEA),
LNCS 6049, pages 361-372, 2010.
extended draft version
http://dx.doi.org/10.1007/978-3-642-13193-6_31
Panagiotis Cheilaris, Ernst Specker, Stathis Zachos.
Neochromatica.
Commentationes Mathematicae Universitatis Carolinae,
51(3), 2010.
preprint pdf
http://www.karlin.mff.cuni.cz/cmuc/pdf/cmuc1003/cheila.pdf
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis,
Valia Mitsou, Stathis Zachos.
Ordered coloring grids and related graphs.
In Proceedings of the
16th International Colloquium on Structural Information
and Communication Complexity (SIROCCO),
LNCS 5869, pages 30-43, 2009.
extended revised version preprint pdf
extended version preprint pdf
http://dx.doi.org/10.1007/978-3-642-11476-2_4
(Invited to special issue of Theoretical Computer Science.)
Panagiotis Cheilaris.
Conflict-free coloring.
PhD Thesis, City University of New York, 2009.
pdf
Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky.
Deterministic conflict-free coloring for intervals:
From offline to online.
ACM Transactions on Algorithms,
4(4), pages 44:1-18, 2008.
preprint pdf
http://doi.acm.org/10.1145/1383369.1383375
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky,
Shakhar Smorodinsky.
Online conflict-free coloring for hypergraphs.
In Proceedings of the
34th International Colloquium on
Automata,
Languages and Programming (ICALP),
LNCS 4596,
pages 219-230, 2007.
extended version preprint pdf
(older version preprint pdf)
http://dx.doi.org/10.1007/978-3-540-73420-8_21
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky,
Shakhar Smorodinsky.
Brief announcement:
Weakening the online adversary just enough to get
optimal conflict-free colorings for intervals.
In Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
pages 194-195, 2007.
pdf
http://doi.acm.org/10.1145/1248377.1248409
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky,
Shakhar Smorodinsky.
Online conflict-free coloring for geometric hypergraphs.
In Proceedings of the 23rd European Workshop on
Computational Geometry (EWCG), pages 106-109, 2007.
pdf
Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky.
Conflict-free coloring for intervals: from offline to online.
In Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 128-137, 2006.
pdf
http://doi.acm.org/10.1145/1148109.1148133
Panagiotis Cheilaris, John Ramirez, Stathis Zachos.
Normalizing S-terms can be generated by a context-free
grammar.
In Proceedings of the 9th Panhellenic
Conference in Informatics, pages 714-728, 2003.
Panagiotis Cheilaris, Stavros Routzounis, Stathis Zachos.
Deciding normalization and computing normal forms for
S-terms.
In Proceedings of the 8th Panhellenic
Conference in Informatics Volume 1, pages 187-196, 2001.