| Publication | Date of Publication | Type |
|---|
| Optimal volume-sensitive bounds for polytope approximation | 2024-10-16 | Paper |
| Economical convex coverings and applications | 2024-08-06 | Paper |
| Economical convex coverings and applications | 2024-05-14 | Paper |
| Optimal Bound on the Combinatorial Complexity of Approximating Polytopes | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009560 | 2021-08-04 | Paper |
| Optimal Bound on the Combinatorial Complexity of Approximating Polytopes | 2021-02-02 | Paper |
| Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743375 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580082 | 2018-08-13 | Paper |
| A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees | 2018-07-16 | Paper |
| Optimal Approximate Polytope Membership | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643896 | 2018-05-29 | Paper |
| Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132844 | 2018-01-30 | Paper |
| Approximate Polytope Membership Queries | 2018-01-12 | Paper |
| On the combinatorial complexity of approximating polytopes | 2018-01-11 | Paper |
| Approximate geometric MST range queries | 2017-10-10 | Paper |
| A 2.5-factor approximation algorithm for the \(k\)-MST problem | 2016-06-09 | Paper |
| A simple entropy-based algorithm for planar point location | 2015-09-02 | Paper |
| On the importance of idempotence | 2014-11-25 | Paper |
| Space-time tradeoffs for approximate spherical range counting | 2014-10-13 | Paper |
| Optimal area-sensitive bounds for polytope approximation | 2014-08-07 | Paper |
| Approximate polytope membership queries | 2014-06-05 | Paper |
| Tight lower bounds for halfspace range searching | 2014-04-03 | Paper |
| Tight lower bounds for halfspace range searching | 2012-05-22 | Paper |
| A unified approach to approximate proximity searching | 2010-09-06 | Paper |
| Space-efficient approximate Voronoi diagrams | 2010-08-05 | Paper |
| Space-time tradeoffs for approximate nearest neighbor searching | 2010-07-14 | Paper |
| The effect of corners on the complexity of approximate range searching | 2009-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601516 | 2009-02-10 | Paper |
| Space-Time Tradeoffs for Proximity Searching in Doubling Spaces | 2008-11-25 | Paper |
| Optimal Expected-Case Planar Point Location | 2008-04-22 | Paper |
| APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING | 2005-06-10 | Paper |
| An optimal algorithm for approximate nearest neighbor searching fixed dimensions | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828927 | 2004-11-29 | Paper |
| Expected-Case Complexity of Approximate Nearest Neighbor Searching | 2003-06-19 | Paper |
| Binary space partitions for axis-parallel line segments: Size-height tradeoffs. | 2003-01-21 | Paper |
| A simple entropy-based algorithm for planar point location | 2002-06-18 | Paper |
| Entropy-preserving cuttings and space-efficient planar point location | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754182 | 2001-11-11 | Paper |
| Approximate range searching | 2001-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234097 | 2001-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721994 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952641 | 2000-05-10 | Paper |
| On the Expected Depth of Random Circuits | 2000-03-07 | Paper |
| Dynamic algorithms for geometric spanners of small diameter: Randomized solutions | 2000-03-07 | Paper |
| Efficient construction of a bounded-degree spanner with low weight | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128920 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140429 | 1993-12-21 | Paper |
