Panagiotis Cheilaris

	2012
15		Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SOFSEM 2012: 190-201
14		Panagiotis Cheilaris, Shakhar Smorodinsky: Conflict-free coloring with respect to a subset of intervals CoRR abs/1204.6422: (2012)
	2011
13		Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský: The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. Symposium on Computational Geometry 2011: 424-432
12		Panagiotis Cheilaris, Géza Tóth: Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms 9(3): 241-251 (2011)
	2010
11		Panagiotis Cheilaris, Géza Tóth: Graph Unique-Maximum and Conflict-Free Colorings. CIAC 2010: 143-154
10		Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin: Finding mobile data under delay constraints with searching costs. PODC 2010: 297-304
9		Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng: Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems. SEA 2010: 361-372
8		Panagiotis Cheilaris, Shakhar Smorodinsky: Choosability in geometric hypergraphs CoRR abs/1005.5520: (2010)
7		Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Online Conflict-Free Colouring for Hypergraphs. Combinatorics, Probability & Computing 19(4): 493-516 (2010)
	2009
6		Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos: Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43
5		Panagiotis Cheilaris, Géza Tóth: Graph unique-maximum and conflict-free colorings CoRR abs/0912.3004: (2009)
	2008
4		Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky: Deterministic conflict-free coloring for intervals: From offline to online. ACM Transactions on Algorithms 4(4): (2008)
	2007
3		Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Online Conflict-Free Colorings for Hypergraphs. ICALP 2007: 219-230
2		Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. SPAA 2007: 194-195
	2006
1		Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky: Conflict-free coloring for intervals: from offline to online. SPAA 2006: 128-137

Coauthor Index

1	Amotz Bar-Noy	[1] [2] [3] [4] [6] [7] [9] [10]
2	Yi Feng	[9] [10]
3	Balázs Keszegh	[15]
4	Michael Lampis	[6]
5	Asaf Levin	[10]
6	Valia Mitsou	[6]
7	Svetlana Olonetsky	[2] [3] [7]
8	Dömötör Pálvölgyi	[15]
9	Shakhar Smorodinsky	[1] [2] [3] [4] [7] [8] [13] [14]
10	Marek Sulovský	[13]
11	Géza Tóth	[5] [11] [12]
12	Stathis Zachos	[6]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page