| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5875486 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091247 | 2022-07-21 | Paper |
| Optimal approximations made easy | 2022-04-07 | Paper |
| A tight analysis of geometric local search | 2022-03-21 | Paper |
| Sampling in Combinatorial and Geometric Set Systems | 2022-02-22 | Paper |
| On a problem of Danzer | 2021-08-04 | Paper |
| Tverberg theorems over discrete sets of points | 2021-07-09 | Paper |
| An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets | 2020-10-23 | Paper |
| Theorems of Carathéodory, Helly, and Tverberg without dimension | 2020-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115816 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111691 | 2020-05-27 | Paper |
| On a Problem of Danzer | 2020-04-06 | Paper |
| Bounding the Size of an Almost-Equidistant Set in Euclidean Space | 2020-03-11 | Paper |
| The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg | 2019-10-30 | Paper |
| Theorems of Carathéodory, Helly, and Tverberg without dimension | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5381136 | 2019-06-07 | Paper |
| Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning | 2019-05-21 | Paper |
| A simple proof of optimal epsilon nets | 2019-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580113 | 2018-08-13 | Paper |
| Practical and efficient algorithms for the geometric hitting set problem | 2018-04-04 | Paper |
| Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems | 2018-02-26 | Paper |
| New Lower Bounds for ϵ-nets | 2018-01-30 | Paper |
| PTAS for geometric hitting set problems via local search | 2017-10-20 | Paper |
| Hardware-assisted view-dependent map simplification | 2017-09-29 | Paper |
| Limits of local search: quality and efficiency | 2017-05-11 | Paper |
| \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets | 2017-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965518 | 2017-03-03 | Paper |
| Epsilon-approximations and epsilon-nets | 2017-02-13 | Paper |
| On the Zarankiewicz Problem for Intersection Hypergraphs | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2954994 | 2017-01-24 | Paper |
| A simple proof of the shallow packing lemma | 2016-05-12 | Paper |
| On the Zarankiewicz problem for intersection hypergraphs | 2016-04-20 | Paper |
| Tighter estimates for \(\epsilon\)-nets for disks | 2016-04-12 | Paper |
| An optimal generalization of the colorful Carathéodory theorem | 2016-01-21 | Paper |
| k-Centerpoints Conjectures for Pointsets in ℝd | 2015-12-30 | Paper |
| Geometric Hitting Sets for Disks: Theory and Practice | 2015-11-19 | Paper |
| Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces | 2015-11-18 | Paper |
| A theorem of bárány revisited and extended | 2014-08-07 | Paper |
| A proof of the Oja depth conjecture in the plane | 2014-05-19 | Paper |
| Improving the first selection lemma in R 3 | 2014-04-03 | Paper |
| Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane | 2011-09-16 | Paper |
| On a Conjecture on Wiener Indices in Combinatorial Chemistry | 2011-03-18 | Paper |
| Hitting simplices with points in \(\mathbb R^{3}\) | 2010-11-08 | Paper |
| Improved results on geometric hitting set problems | 2010-11-08 | Paper |
| Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension | 2010-07-28 | Paper |
| Centerpoints and Tverberg's technique | 2010-07-28 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| An optimal extension of the centerpoint theorem | 2009-07-27 | Paper |
| An optimal generalization of the centerpoint theorem, and its extensions | 2009-02-12 | Paper |
| Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension | 2009-02-12 | Paper |
| Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension | 2008-03-26 | Paper |
| Conflict-Free Colorings of Rectangles Ranges | 2008-03-19 | Paper |
| Independent set of intersection graphs of convex objects in 2D | 2006-05-16 | Paper |
| Near-linear time approximation algorithms for curve simplification | 2006-03-21 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Listen to Your Neighbors: How (Not) to Reach a Consensus | 2005-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828983 | 2004-11-29 | Paper |
| A conjecture on Wiener indices in combinatorial chemistry | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411343 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535045 | 2002-06-12 | Paper |
