default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPanagiotis Cheilaris
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c14]Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis
, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika:
Stathis Zachos at 70! CIAC 2017: 469-484- 2016
- [j9]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. Algorithmica 76(4): 935-960 (2016) - 2015
- [j8]Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
On the complexity of higher order abstract Voronoi diagrams. Comput. Geom. 48(8): 539-551 (2015) - 2014
- [j7]Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky:
Strong Conflict-Free Coloring for Intervals. Algorithmica 70(4): 732-749 (2014) - [c13]Panagiotis Cheilaris, Sandeep Kumar Dey, Maria Gabrani, Evanthia Papadopoulou:
Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis. ICMS 2014: 198-205 - [c12]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. LATIN 2014: 96-107 - 2013
- [j6]Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SIAM J. Discret. Math. 27(4): 1775-1787 (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) - [c11]Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
On the Complexity of Higher Order Abstract Voronoi Diagrams. ICALP (1) 2013: 208-219 - [i4]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. CoRR abs/1312.3904 (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. SCG 2011: 424-432 - 2010
- [j2]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colouring for Hypergraphs. Comb. Probab. Comput. 19(4): 493-516 (2010) - [c7]Panagiotis Cheilaris, Géza Tóth:
Graph Unique-Maximum and Conflict-Free Colorings. CIAC 2010: 143-154 - [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)
2000 – 2009
- 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 Trans. Algorithms 4(4): 44:1-44:18 (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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
