- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j5 |      | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Mordecai J. Golin: Paging mobile users in cellular networks: Optimality versus complexity and simplicity. Theor. Comput. Sci. 470: 23-35 (2013) |
| 2012 | ||
| j4 | | Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos: Ordered coloring of grids and related graphs. Theor. Comput. Sci. 444: 40-51 (2012) |
| c10 | | Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky: Strong Conflict-Free Coloring for Intervals. ISAAC 2012: 4-13 |
| c9 | | 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 |
| i3 | | Panagiotis Cheilaris, Shakhar Smorodinsky: Conflict-free coloring with respect to a subset of intervals. CoRR abs/1204.6422 (2012) |
| 2011 | ||
| j3 | | Panagiotis Cheilaris, Géza Tóth: Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms 9(3): 241-251 (2011) |
| c8 | | 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 |
| 2010 | ||
| j2 | | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Online Conflict-Free Colouring for Hypergraphs. Combinatorics, Probability & Computing 19(4): 493-516 (2010) |
| c7 | | |
| c6 | | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin: Finding mobile data under delay constraints with searching costs. PODC 2010: 297-304 |
| c5 | | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng: Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems. SEA 2010: 361-372 |
| i2 | | Panagiotis Cheilaris, Shakhar Smorodinsky: Choosability in geometric hypergraphs. CoRR abs/1005.5520 (2010) |
| 2009 | ||
| c4 | | Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos: Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43 |
| i1 | | Panagiotis Cheilaris, Géza Tóth: Graph unique-maximum and conflict-free colorings. CoRR abs/0912.3004 (2009) |
| 2008 | ||
| j1 | | 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 | ||
| c3 | | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Online Conflict-Free Colorings for Hypergraphs. ICALP 2007: 219-230 |
| c2 | | 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 | ||
| c1 | | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky: Conflict-free coloring for intervals: from offline to online. SPAA 2006: 128-137 |
Colors in the list of coauthors
Last update Wed May 22 18:24:00 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page