| Publication | Date of Publication | Type |
|---|
| Escaping the curse of spatial partitioning: matchings with low crossing numbers and their applications | 2026-04-27 | Paper |
| An optimal sparsification lemma for low-crossing matchings and its applications to discrepancy and approximations | 2026-01-14 | Paper |
| Settling the APX-hardness status for geometric set cover | 2025-08-05 | Paper |
| scientific article; zbMATH DE number 7650099 (Why is no real title available?) | 2023-02-03 | Paper |
| Computing optimal \(\varepsilon\)-nets is as easy as finding an unhit set | 2022-07-21 | Paper |
Optimal approximations made easy
Information Processing Letters | 2022-04-07 | Paper |
A tight analysis of geometric local search
Discrete & Computational Geometry | 2022-03-21 | Paper |
Sampling in combinatorial and geometric set systems
Mathematical Surveys and Monographs | 2022-02-22 | Paper |
| On a problem of Danzer | 2021-08-04 | Paper |
Tverberg theorems over discrete sets of points
Polytopes and Discrete Geometry | 2021-07-09 | Paper |
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
Computational Geometry | 2020-10-23 | Paper |
Theorems of Carathéodory, Helly, and Tverberg without dimension
Discrete & Computational Geometry | 2020-09-01 | Paper |
| Optimality of geometric local search | 2020-08-18 | Paper |
| Combinatorics of local search: an optimal 4-local Hall's theorem for planar graphs | 2020-05-27 | Paper |
On a problem of Danzer
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Bounding the Size of an Almost-Equidistant Set in Euclidean Space
Combinatorics, Probability and Computing | 2020-03-11 | Paper |
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Bulletin of the American Mathematical Society | 2019-10-30 | Paper |
Theorems of Carathéodory, Helly, and Tverberg without dimension
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Tight lower bounds on the VC-dimension of geometric set systems | 2019-06-07 | Paper |
Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
Discrete & Computational Geometry | 2019-05-21 | Paper |
A simple proof of optimal epsilon nets
Combinatorica | 2019-02-01 | Paper |
| Shallow packings, semialgebraic set systems, Macbeath regions, and polynomial partitioning | 2018-08-13 | Paper |
Practical and efficient algorithms for the geometric hitting set problem
Discrete Applied Mathematics | 2018-04-04 | Paper |
Near-optimal lower bounds for -nets for half-spaces and low complexity set systems
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
| New Lower Bounds for ϵ-nets | 2018-01-30 | Paper |
PTAS for geometric hitting set problems via local search
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Hardware-assisted view-dependent map simplification
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Limits of local search: quality and efficiency
Discrete & Computational Geometry | 2017-05-11 | Paper |
\(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
Discrete & Computational Geometry | 2017-05-11 | Paper |
| Near-optimal generalisations of a theorem of Macbeath | 2017-03-03 | Paper |
| Epsilon-approximations and epsilon-nets | 2017-02-13 | Paper |
On the Zarankiewicz problem for intersection hypergraphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
| Improved local search for geometric hitting set | 2017-01-24 | Paper |
A simple proof of the shallow packing lemma
Discrete & Computational Geometry | 2016-05-12 | Paper |
On the Zarankiewicz problem for intersection hypergraphs
Journal of Combinatorial Theory. Series A | 2016-04-20 | Paper |
Tighter estimates for -nets for disks
Computational Geometry | 2016-04-12 | Paper |
An optimal generalization of the colorful Carathéodory theorem
Discrete Mathematics | 2016-01-21 | Paper |
\(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
International Journal of Computational Geometry & Applications | 2015-12-30 | Paper |
Geometric hitting sets for disks: theory and practice
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
SIAM Journal on Computing | 2015-11-18 | Paper |
A theorem of Bárány revisited and extended
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
A proof of the Oja depth conjecture in the plane
Computational Geometry | 2014-05-19 | Paper |
Improving the first selection lemma in \(\mathbb{R}^3\)
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Ray-shooting depth: computing statistical data depth of point sets in the plane
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On a conjecture on Wiener indices in combinatorial chemistry
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Hitting simplices with points in \(\mathbb R^{3}\)
Discrete & Computational Geometry | 2010-11-08 | Paper |
Improved results on geometric hitting set problems
Discrete & Computational Geometry | 2010-11-08 | Paper |
Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension
Computational Geometry | 2010-07-28 | Paper |
Centerpoints and Tverberg's technique
Computational Geometry | 2010-07-28 | Paper |
Streaming geometric optimization using graphics hardware
Lecture Notes in Computer Science | 2010-03-03 | Paper |
An optimal extension of the centerpoint theorem
Computational Geometry | 2009-07-27 | Paper |
An optimal generalization of the centerpoint theorem, and its extensions
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Weak -nets have basis of size O(1/ (1/)) in any dimension
Computational Geometry | 2008-03-26 | Paper |
Conflict-Free Colorings of Rectangles Ranges
STACS 2006 | 2008-03-19 | Paper |
Independent set of intersection graphs of convex objects in 2D
Computational Geometry | 2006-05-16 | Paper |
Near-linear time approximation algorithms for curve simplification
Algorithmica | 2006-03-21 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Listen to Your Neighbors: How (Not) to Reach a Consensus
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 2119711 (Why is no real title available?) | 2004-11-29 | Paper |
A conjecture on Wiener indices in combinatorial chemistry
Algorithmica | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 1947379 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1754618 (Why is no real title available?) | 2002-06-12 | Paper |
