| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6187787 | 2024-01-15 | Paper |
| Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. | 2023-11-02 | Paper |
| Time and space efficient collinearity indexing | 2023-01-09 | Paper |
| Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems | 2022-12-08 | Paper |
| Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model | 2022-11-16 | Paper |
| On Ray Shooting for Triangles in 3-Space and Related Problems | 2022-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088930 | 2022-07-18 | Paper |
| Counting and Cutting Rich Lenses in Arrangements of Circles | 2022-04-20 | Paper |
| On 3SUM-hard problems in the decision tree model | 2022-03-22 | Paper |
| Geometric optimization revisited | 2022-02-16 | Paper |
| Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications | 2021-05-27 | Paper |
| On pseudo-disk hypergraphs | 2021-01-07 | Paper |
| On rich lenses in planar arrangements of circles and related problems | 2020-12-07 | Paper |
| Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications | 2020-12-04 | Paper |
| Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location | 2020-06-16 | Paper |
| Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications | 2019-10-15 | Paper |
| On the Beck‐Fiala conjecture for random set systems | 2019-08-14 | Paper |
| A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension | 2019-06-20 | Paper |
| A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model | 2019-05-21 | Paper |
| A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM | 2018-08-13 | Paper |
| On the Beck-Fiala Conjecture for Random Set Systems | 2018-04-19 | Paper |
| Almost tight bound for a single cell in an arrangement of convex polyhedra in R 3 | 2017-10-20 | Paper |
| Near-linear approximation algorithms for geometric hitting sets | 2017-10-20 | Paper |
| Two Proofs for Shallow Packings | 2017-10-10 | Paper |
| Counting and representing intersections among triangles in three dimensions | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365154 | 2017-09-29 | Paper |
| Two proofs for shallow packings | 2016-12-20 | Paper |
| A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension | 2016-02-05 | Paper |
| On the union of fat tetrahedra in three dimensions | 2015-12-07 | Paper |
| Small-size relative ( p ,ε)-approximations for well-behaved range spaces | 2015-02-17 | Paper |
| Small-size ε-nets for axis-parallel rectangles and boxes | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934012 | 2014-12-08 | Paper |
| Improved Bounds for the Union of Locally Fat Objects in the Plane | 2014-07-30 | Paper |
| Convex hull of imprecise points in o(n log n) time after preprocessing | 2014-03-24 | Paper |
| Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing | 2013-03-07 | Paper |
| Near-linear approximation algorithms for geometric hitting sets | 2012-04-26 | Paper |
| A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space | 2012-03-27 | Paper |
| Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes | 2011-04-04 | Paper |
| On the union of cylinders in three dimensions | 2011-03-10 | Paper |
| On regular vertices of the union of planar convex objects | 2009-05-13 | Paper |
| On regular vertices on the union of planar objects | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601527 | 2009-02-10 | Paper |
| On the performance of the ICP algorithm | 2008-07-29 | Paper |
| A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\) | 2007-02-14 | Paper |
| Counting and representing intersections among triangles in three dimensions | 2005-11-01 | Paper |
| Output-Sensitive Construction of the Union of Triangles | 2005-09-16 | Paper |
