Παρακολούθηση
Panagiotis Cheilaris
Panagiotis Cheilaris
Postdoctoral researcher at Università della Svizzera italiana
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα usi.ch
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
P Cheilaris, B Keszegh, D Pálvölgyi
SIAM Journal on Discrete Mathematics 27 (4), 1775-1787, 2013
402013
Graph unique-maximum and conflict-free colorings
P Cheilaris, G Tóth
Journal of Discrete Algorithms 9 (3), 241-251, 2011
332011
Online conflict-free colouring for hypergraphs
A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky
Combinatorics, Probability and Computing 19 (4), 493-516, 2010
332010
Conflict-free coloring for intervals: from offline to online
A Bar-Noy, P Cheilaris, S Smorodinsky
Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006
332006
Conflict-free coloring
P Cheilaris
City University of New York, 2009
322009
Deterministic conflict-free coloring for intervals: from offline to online
A Bar-Noy, P Cheilaris, S Smorodinsky
ACM Transactions on Algorithms (TALG) 4 (4), 1-18, 2008
322008
Strong conflict-free coloring for intervals
P Cheilaris, L Gargano, AA Rescigno, S Smorodinsky
Algorithmica 70 (4), 732-749, 2014
232014
On the complexity of higher order abstract Voronoi diagrams
C Bohler, P Cheilaris, R Klein, CH Liu, E Papadopoulou, M Zavershynskyi
Computational Geometry 48 (8), 539-551, 2015
192015
Online conflict-free colorings for hypergraphs
A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky
International Colloquium on Automata, Languages, and Programming, 219-230, 2007
182007
Neochromatica
P Cheilaris, E Specker, S Zachos
Commentationes Mathematicae Universitatis Carolinae 51 (3), 469-480, 2010
172010
On the complexity of higher order abstract Voronoi diagrams
C Bohler, P Cheilaris, R Klein, CH Liu, E Papadopoulou, M Zavershynskyi
International Colloquium on Automata, Languages, and Programming, 208-219, 2013
162013
A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters
P Cheilaris, E Khramtcova, S Langerman, E Papadopoulou
Latin American Symposium on Theoretical Informatics, 96-107, 2014
102014
A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters
P Cheilaris, E Khramtcova, S Langerman, E Papadopoulou
Algorithmica 76 (4), 935-960, 2016
92016
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
A Bar-Noy, P Cheilaris, Y Feng, MJ Golin
Theoretical Computer Science 470, 23-35, 2013
92013
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
P Cheilaris, S Smorodinsky, M Sulovský
Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011
72011
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals
A Bar-Noy, P Cheilaris, S Olonetsky, S Smorodinsky
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007
62007
Randomized online conflict-free coloring for hypergraphs
A Bar-Noy, P Cheilaris, S Smorodinsky
Journal of Combinatorics, Probability and Computing 19 (4), 493-516, 2006
62006
Topology and context-based pattern extraction using line-segment Voronoi diagram
SK Dey, P Cheilaris, N Casati, M Gabrani, E Papadopoulo
Design-Process-Technology Co-optimization for Manufacturability IX 9427, 42-56, 2015
52015
Implementing the L∞ segment Voronoi diagram in CGAL and applying in VLSI pattern analysis
P Cheilaris, SK Dey, M Gabrani, E Papadopoulou
International Congress on Mathematical Software, 198-205, 2014
52014
Conflict-free coloring with respect to a subset of intervals
P Cheilaris, S Smorodinsky
arXiv preprint arXiv:1204.6422, 2012
52012
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20