| Publication | Date of Publication | Type |
|---|
| Conflict-free colouring of subsets | 2024-10-25 | Paper |
| A new lower bound on Hadwiger-Debrunner numbers in the plane | 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 |
| https://portal.mardi4nfdi.de/entity/Q6059949 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104351 | 2022-09-09 | Paper |
| The \(\varepsilon\)-\(t\)-net problem | 2022-08-25 | Paper |
| On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs | 2022-08-18 | Paper |
| On the VC-dimension of half-spaces with respect to convex sets | 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 | 2021-12-01 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2021-11-18 | Paper |
| Conflict-free coloring of string graphs | 2021-04-29 | Paper |
| A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane | 2021-02-02 | Paper |
| Conflict-free coloring of intersection graphs of geometric objects | 2020-10-23 | 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 | 2020-08-18 | Paper |
| From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem | 2020-06-16 | Paper |
| Balanced line separators of unit disk graphs | 2020-04-22 | Paper |
| Lenses in arrangements of pseudo-circles and their applications | 2018-11-23 | Paper |
| On the union complexity of families of axis-parallel rectangles with a low packing number | 2018-11-22 | Paper |
| Deterministic conflict-free coloring for intervals | 2018-11-05 | Paper |
| On piercing numbers of families satisfying the \((p,q)_{r}\) property | 2018-10-31 | Paper |
| On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers | 2018-07-16 | Paper |
| Improved bounds on the Hadwiger-Debrunner numbers | 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 | 2018-03-02 | Paper |
| Distinct distances between points and lines | 2018-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132895 | 2018-01-30 | Paper |
| An improved bound for k -sets in three dimensions | 2017-09-29 | Paper |
| On conflict-free coloring of points and simple regions in the plane | 2017-09-29 | Paper |
| On locally Delaunay geometric graphs | 2017-09-29 | Paper |
| Balanced line separators of unit disk graphs | 2017-09-22 | Paper |
| Hypergraphical Clustering Games of Mis-Coordination | 2017-06-13 | Paper |
| Weak ε-nets and interval chains | 2015-11-11 | Paper |
| Lenses in arrangements of pseudo-circles and their applications | 2015-08-01 | Paper |
| Conflict-Free Coloring and its Applications | 2015-06-24 | Paper |
| On vertex rankings of graphs and its relatives | 2015-04-29 | Paper |
| Strong conflict-free coloring for intervals | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921677 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921711 | 2014-10-13 | Paper |
| On totally positive matrices and geometric incidences | 2014-10-07 | Paper |
| Hitting sets online and unique-MAX coloring | 2014-09-12 | Paper |
| The potential to improve the choice | 2014-03-24 | Paper |
| Compatible Geometric Matchings | 2013-06-28 | Paper |
| Strong Conflict-Free Coloring for Intervals | 2013-03-21 | Paper |
| Conflict-free coloring with respect to a subset of intervals | 2012-04-28 | Paper |
| Colorful strips | 2012-01-24 | Paper |
| Polychromatic coloring for half-planes | 2011-11-11 | Paper |
| Hitting Sets Online and Vertex Ranking | 2011-09-16 | Paper |
| Online Conflict-Free Colouring for Hypergraphs | 2010-10-14 | Paper |
| On the chromatic number of some geometric hypergraphs | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579389 | 2010-08-06 | Paper |
| Conflict-Free Coloring Made Stronger | 2010-06-22 | Paper |
| Polychromatic Coloring for Half-Planes | 2010-06-22 | Paper |
| A note on the online first-fit algorithm for coloring \(k\)-inductive graphs | 2010-06-09 | Paper |
| Colorful Strips | 2010-04-27 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Compatible geometric matchings | 2009-07-27 | Paper |
| Small weak epsilon-nets | 2009-06-18 | Paper |
| Coloring geometric range spaces | 2009-05-13 | Paper |
| CONFLICT-FREE COLORINGS OF SHALLOW DISCS | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601520 | 2009-02-10 | Paper |
| On The Chromatic Number of Geometric Hypergraphs | 2008-08-13 | Paper |
| On Center Regions and Balls Containing Many Points | 2008-07-10 | Paper |
| Coloring Geometric Range Spaces | 2008-04-15 | Paper |
| Convexity in topological affine planes | 2007-12-19 | Paper |
| Online Conflict-Free Colorings for Hypergraphs | 2007-11-28 | Paper |
| Online Conflict‐Free Coloring for Intervals | 2007-10-22 | Paper |
| \(k\)-sets in four dimensions | 2006-03-21 | Paper |
| Geometric permutations induced by line transversals through a fixed point | 2005-11-01 | Paper |
| Conflict-free coloring of points and simple regions in the plane | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4819250 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046485 | 2004-08-12 | Paper |
| Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks | 2004-01-08 | Paper |
| On neighbors in geometric permutations. | 2003-07-29 | Paper |
| An improved bound for \(k\)-sets in three dimensions | 2002-07-10 | Paper |
| Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\) | 2000-10-17 | Paper |
| The $\epsilon$-$t$-Net Problem | N/A | Paper |
| Conflict-Free Colouring of Subsets | N/A | Paper |
