| Publication | Date of Publication | Type |
|---|
Deterministic conflict-free coloring for intervals: from offline to online
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Stathis Zachos at 70!
Lecture Notes in Computer Science | 2017-07-21 | Paper |
A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters
Algorithmica | 2016-12-21 | Paper |
On the complexity of higher order abstract Voronoi diagrams
Computational Geometry | 2015-07-27 | Paper |
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Strong conflict-free coloring for intervals
Algorithmica | 2015-01-19 | Paper |
Implementing the \(L _{ \infty }\) segment Voronoi diagram in CGAL and applying in VLSI pattern analysis
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters
Lecture Notes in Computer Science | 2014-03-31 | Paper |
The potential to improve the choice, list conflict-free coloring for geometric hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
On the complexity of higher order abstract Voronoi diagrams
Automata, Languages, and Programming | 2013-08-06 | Paper |
Strong conflict-free coloring for intervals
Algorithms and Computation | 2013-03-21 | Paper |
Paging mobile users in cellular networks: optimality versus complexity and simplicity
Theoretical Computer Science | 2013-02-19 | Paper |
Ordered coloring of grids and related graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
| Conflict-free coloring with respect to a subset of intervals | 2012-04-28 | Paper |
Graph unique-maximum and conflict-free colorings
Journal of Discrete Algorithms | 2011-08-23 | Paper |
| Neochromatica. | 2011-03-23 | Paper |
| Neochromatica. | 2011-03-23 | Paper |
Online conflict-free colouring for hypergraphs
Combinatorics, Probability and Computing | 2010-10-14 | Paper |
Graph unique-maximum and conflict-free colorings
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Ordered coloring grids and related graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Online Conflict-Free Colorings for Hypergraphs
Automata, Languages and Programming | 2007-11-28 | Paper |
