| Publication | Date of Publication | Type |
|---|
| Improved bounds for point selections and halving hyperplanes in higher dimensions | 2024-11-28 | Paper |
Stronger bounds for weak epsilon-nets in higher dimensions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
An Improved Bound for Weak Epsilon-nets in the Plane
Journal of the ACM | 2023-04-27 | Paper |
Planar point sets determine many pairwise crossing segments
Advances in Mathematics | 2021-07-05 | Paper |
| Further consequences of the colorful Helly hypothesis | 2020-08-18 | Paper |
Further consequences of the colorful Helly hypothesis
Discrete & Computational Geometry | 2020-06-16 | Paper |
Further consequences of the colorful Helly hypothesis
Discrete & Computational Geometry | 2020-06-16 | Paper |
| scientific article; zbMATH DE number 7204982 (Why is no real title available?) | 2020-05-27 | Paper |
Planar point sets determine many pairwise crossing segments
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Line transversals of convex polyhedra in \(\mathbb{R}^3\) | 2019-05-06 | Paper |
An Improved Bound for Weak Epsilon-Nets in the Plane
(available as arXiv preprint) | 2018-08-08 | Paper |
Beyond the Richter-Thomassen Conjecture
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Beyond the Richter-Thomassen Conjecture
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A crossing lemma for Jordan curves
Advances in Mathematics | 2018-06-26 | Paper |
A crossing lemma for Jordan curves
Advances in Mathematics | 2018-06-26 | Paper |
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
On the Richter-Thomassen conjecture about pairwise intersecting closed curves
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
Journal of the ACM | 2016-03-24 | Paper |
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
Discrete & Computational Geometry | 2016-02-03 | Paper |
| scientific article; zbMATH DE number 6381708 (Why is no real title available?) | 2014-12-18 | Paper |
On topological changes in the Delaunay triangulation of moving points
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Lines avoiding balls in three dimensions revisited
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
A kinetic triangulation scheme for moving points in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Lines avoiding balls in three dimensions revisited
Discrete & Computational Geometry | 2012-08-13 | Paper |
Improved bounds for geometric permutations
SIAM Journal on Computing | 2012-08-10 | Paper |
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
SIAM Journal on Computing | 2011-04-04 | Paper |
A kinetic triangulation scheme for moving points in the plane
Computational Geometry | 2011-03-25 | Paper |
Linear data structures for fast ray-shooting amidst convex polyhedra
Algorithmica | 2009-08-27 | Paper |
Efficient Colored Orthogonal Range Counting
SIAM Journal on Computing | 2009-06-22 | Paper |
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
Algorithms – ESA 2007 | 2008-09-25 | Paper |
On topological changes in the Delaunay triangulation of moving points
Discrete & Computational Geometry | 0001-01-03 | Paper |
Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions
(available as arXiv preprint) | N/A | Paper |
