| Publication | Date of Publication | Type |
|---|
| Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks | 2026-05-29 | Paper |
On separating path and tree systems in graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-13 | Paper |
| Zarankiewicz's problem via \(\varepsilon\)-\(t\)-nets | 2025-11-24 | Paper |
Conflict-free colouring of subsets
Discrete & Computational Geometry | 2024-10-25 | Paper |
A new lower bound on Hadwiger-Debrunner numbers in the plane
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| On Separating Path and Tree Systems in Graphs | 2023-12-21 | Paper |
| Zarankiewicz's problem via $\epsilon$-t-nets | 2023-11-22 | Paper |
| scientific article; zbMATH DE number 7760134 (Why is no real title available?) | 2023-11-02 | Paper |
| No repeated slopes, triangles and polygons | 2022-09-09 | Paper |
The \(\varepsilon\)-\(t\)-net problem
Discrete & Computational Geometry | 2022-08-25 | Paper |
On multicolor Ramsey numbers and subset coloring of hypergraphs
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
On the VC-dimension of half-spaces with respect to convex sets
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
On the VC-dimension of half-spaces with respect to convex sets
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
| A solution to Ringel's circle problem | 2021-12-09 | Paper |
A new lower bound on Hadwiger-Debrunner numbers in the plane
Israel Journal of Mathematics | 2021-12-01 | Paper |
Approximating maximum diameter-bounded subgraph in unit disk graphs
Discrete & Computational Geometry | 2021-11-18 | Paper |
Conflict-free coloring of string graphs
Discrete & Computational Geometry | 2021-04-29 | Paper |
A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Conflict-free coloring of intersection graphs of geometric objects
Discrete & Computational Geometry | 2020-10-23 | Paper |
From a \((p,2)\)-theorem to a tight \((p,q)\)-theorem
(available as arXiv preprint) | 2020-08-18 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2020-08-18 | Paper |
From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem
Discrete & Computational Geometry | 2020-06-16 | Paper |
Balanced line separators of unit disk graphs
Computational Geometry | 2020-04-22 | Paper |
Lenses in arrangements of pseudo-circles and their applications
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
On the union complexity of families of axis-parallel rectangles with a low packing number
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
On the union complexity of families of axis-parallel rectangles with a low packing number
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
Deterministic conflict-free coloring for intervals: from offline to online
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On piercing numbers of families satisfying the \((p,q)_{r}\) property
Computational Geometry | 2018-10-31 | Paper |
On max-clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved bounds on the Hadwiger-Debrunner numbers
Israel Journal of Mathematics | 2018-07-03 | Paper |
| On interference among moving sensors and related problems | 2018-06-05 | Paper |
| Conflict-free coloring of intersection graphs of geometric objects | 2018-03-15 | Paper |
On interference among moving sensors and related problems
(available as arXiv preprint) | 2018-03-02 | Paper |
Distinct distances between points and lines
Computational Geometry | 2018-02-28 | Paper |
| Weak 1r-nets for moving points | 2018-01-30 | Paper |
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On locally Delaunay geometric graphs
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
An improved bound for <i>k</i> -sets in three dimensions
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Balanced line separators of unit disk graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
| Hypergraphical Clustering Games of Mis-Coordination | 2017-06-13 | Paper |
Weak ε-nets and interval chains
Journal of the ACM | 2015-11-11 | Paper |
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM | 2015-08-01 | Paper |
Conflict-free coloring and its applications
Bolyai Society Mathematical Studies | 2015-06-24 | Paper |
On vertex rankings of graphs and its relatives
Discrete Mathematics | 2015-04-29 | Paper |
Strong conflict-free coloring for intervals
Algorithmica | 2015-01-19 | Paper |
| Online conflict-free coloring for intervals | 2014-10-13 | Paper |
| On geometric permutations induced by lines transversal through a fixed point | 2014-10-13 | Paper |
On totally positive matrices and geometric incidences
Journal of Combinatorial Theory. Series A | 2014-10-07 | Paper |
Hitting sets online and unique-MAX coloring
Discrete Applied Mathematics | 2014-09-12 | 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 |
Compatible Geometric Matchings
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Strong conflict-free coloring for intervals
Algorithms and Computation | 2013-03-21 | Paper |
| Conflict-free coloring with respect to a subset of intervals | 2012-04-28 | Paper |
Colorful strips
Graphs and Combinatorics | 2012-01-24 | Paper |
Polychromatic coloring for half-planes
Journal of Combinatorial Theory. Series A | 2011-11-11 | Paper |
Hitting sets online and vertex ranking
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Online conflict-free colouring for hypergraphs
Combinatorics, Probability and Computing | 2010-10-14 | Paper |
On the chromatic number of some geometric hypergraphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764800 (Why is no real title available?) | 2010-08-06 | Paper |
Conflict-free coloring made stronger
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Polychromatic coloring for half-planes
Lecture Notes in Computer Science | 2010-06-22 | Paper |
A note on the online first-fit algorithm for coloring \(k\)-inductive graphs
Information Processing Letters | 2010-06-09 | Paper |
Colorful strips
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Extremal configurations and levels in pseudoline arrangements.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
Compatible geometric matchings
Computational Geometry | 2009-07-27 | Paper |
Small weak epsilon-nets
Computational Geometry | 2009-06-18 | Paper |
Coloring geometric range spaces
Discrete & Computational Geometry | 2009-05-13 | Paper |
CONFLICT-FREE COLORINGS OF SHALLOW DISCS
International Journal of Computational Geometry & Applications | 2009-02-24 | Paper |
| scientific article; zbMATH DE number 5506190 (Why is no real title available?) | 2009-02-10 | Paper |
On The Chromatic Number of Geometric Hypergraphs
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
On Center Regions and Balls Containing Many Points
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Coloring Geometric Range Spaces
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Convexity in topological affine planes
Discrete & Computational Geometry | 2007-12-19 | Paper |
Online Conflict-Free Colorings for Hypergraphs
Automata, Languages and Programming | 2007-11-28 | Paper |
Online Conflict‐Free Coloring for Intervals
SIAM Journal on Computing | 2007-10-22 | Paper |
k-sets in four dimensions
Discrete & Computational Geometry | 2006-03-21 | Paper |
Geometric permutations induced by line transversals through a fixed point
Discrete & Computational Geometry | 2005-11-01 | Paper |
Conflict-free coloring of points and simple regions in the plane
Discrete & Computational Geometry | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2103167 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2089216 (Why is no real title available?) | 2004-08-12 | Paper |
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
SIAM Journal on Computing | 2004-01-08 | Paper |
On neighbors in geometric permutations.
Discrete Mathematics | 2003-07-29 | Paper |
An improved bound for \(k\)-sets in three dimensions
Discrete & Computational Geometry | 2002-07-10 | Paper |
Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\)
Discrete & Computational Geometry | 2000-10-17 | Paper |
The \epsilon-t-Net Problem
(available as arXiv preprint) | N/A | Paper |
Conflict-Free Colouring of Subsets
(available as arXiv preprint) | N/A | Paper |
