| Publication | Date of Publication | Type |
|---|
| Optimal Bound on the Combinatorial Complexity of Approximating Polytopes | 2023-10-31 | Paper |
| Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. | 2023-09-20 | Paper |
| Coresets for the Nearest-Neighbor Rule | 2023-02-07 | Paper |
| Online Algorithms for Warehouse Management. | 2023-02-03 | Paper |
| Point probe decision trees for geometric concept classes | 2023-01-18 | Paper |
| Voronoi Diagrams in the Hilbert Metric | 2021-12-06 | Paper |
| Guarantees on nearest-neighbor condensation heuristics | 2021-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009560 | 2021-08-04 | Paper |
| Optimal Bound on the Combinatorial Complexity of Approximating Polytopes | 2021-02-02 | Paper |
| Economical Delone Sets for Approximating Convex Bodies | 2020-08-25 | Paper |
| Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances | 2019-10-15 | Paper |
| New directions in approximate nearest-neighbor searching | 2019-10-10 | Paper |
| Modular circulation and applications to traffic management | 2019-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743375 | 2019-05-10 | Paper |
| Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions | 2019-03-20 | Paper |
| A local search approximation algorithm for k-means clustering | 2018-11-23 | Paper |
| A practical approximation algorithm for the LTS estimator | 2018-08-15 | 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 |
| 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 |
| https://portal.mardi4nfdi.de/entity/Q5368700 | 2017-10-10 | Paper |
| Approximate geometric MST range queries | 2017-10-10 | Paper |
| The analysis of a simple k -means clustering algorithm | 2017-09-29 | Paper |
| A computational framework for incremental motion | 2017-09-29 | Paper |
| On the least median square problem | 2017-09-29 | Paper |
| Modular circulation and applications to traffic management | 2017-09-22 | Paper |
| Space exploration via proximity search | 2016-09-14 | Paper |
| On the Complexity of an Unregulated Traffic Crossing | 2015-10-30 | Paper |
| A simple entropy-based algorithm for planar point location | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501825 | 2015-08-14 | Paper |
| A sensor-based framework for kinetic data compression | 2014-12-23 | Paper |
| On the importance of idempotence | 2014-11-25 | Paper |
| On the least trimmed squares estimator | 2014-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921710 | 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 |
| A dynamic data structure for approximate range searching | 2014-04-03 | Paper |
| A Self-adjusting Data Structure for Multidimensional Point Sets | 2012-09-25 | Paper |
| Tight lower bounds for halfspace range searching | 2012-05-22 | Paper |
| A Unified Approach to Approximate Proximity Searching | 2010-09-06 | Paper |
| Spatio-temporal Range Searching over Compressed Kinetic Sensor Data | 2010-09-06 | Paper |
| Space-efficient approximate Voronoi diagrams | 2010-08-05 | Paper |
| Approximation algorithm for the kinetic robust \(k\)-center problem | 2010-07-28 | Paper |
| Space-time tradeoffs for approximate nearest neighbor searching | 2010-07-14 | Paper |
| Approximate range searching: The absolute model | 2010-03-16 | Paper |
| Maintaining Nets and Net Trees under Incremental Motion | 2009-12-17 | Paper |
| A practical approximation algorithm for the LMS line estimator | 2009-05-29 | Paper |
| The effect of corners on the complexity of approximate range searching | 2009-04-27 | Paper |
| Embedding and similarity search for point sets under translation | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601516 | 2009-02-10 | Paper |
| Space-Time Tradeoffs for Proximity Searching in Doubling Spaces | 2008-11-25 | Paper |
| POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS | 2008-05-20 | Paper |
| Testing simple polygons. | 2008-04-25 | Paper |
| Optimal Expected-Case Planar Point Location | 2008-04-22 | Paper |
| Improved approximation bounds for planar point pattern matching | 2008-04-03 | Paper |
| A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM | 2007-03-21 | Paper |
| On the least median square problem | 2006-12-06 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Proximity problems on line segments spanned by points | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290304 | 2006-04-28 | Paper |
| Algorithms and Computation | 2005-12-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 |
| A local search approximation algorithm for \(k\)-means clustering | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460272 | 2004-05-18 | Paper |
| Approximating large convolutions in digital images | 2003-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801190 | 2003-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778562 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768304 | 2002-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779401 | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768303 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768359 | 2002-01-30 | Paper |
| Approximate range searching | 2001-09-13 | Paper |
| VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME | 2001-09-13 | Paper |
| Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses | 2001-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234097 | 2001-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721994 | 2001-07-11 | Paper |
| QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS | 2001-07-05 | Paper |
| Chromatic nearest neighbor searching: A query sensitive approach | 2001-06-21 | Paper |
| Dynamic algorithms for geometric spanners of small diameter: Randomized solutions | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4225244 | 1999-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252416 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401023 | 1998-08-02 | Paper |
| Efficient randomized algorithms for the repeated median line estimator | 1998-05-24 | Paper |
| Parallelizing an Algorithm for Visibility on Polyhedral Terrain | 1997-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128920 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4839619 | 1995-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302464 | 1994-09-13 | Paper |
| Pyramid computation of neighbor distance statistics in dot patterns | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140403 | 1993-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140429 | 1993-12-21 | Paper |
| A RANDOMIZED ALGORITHM FOR SLOPE SELECTION | 1993-01-16 | Paper |
| A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011321 | 1992-09-27 | Paper |
| Parallel computational geometry of rectangles | 1992-06-28 | Paper |
| An Output-Sensitive Algorithm for Computing Visibility Graphs | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358266 | 1991-01-01 | Paper |
| Packing and covering the plane with translates of a convex polygon | 1990-01-01 | Paper |
| The Number of Shortest Paths on the Surface of a Polyhedron | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3829588 | 1989-01-01 | Paper |
| The Decomposition of a Rectangle into Rectangles of Minimal Perimeter | 1988-01-01 | Paper |
| The decomposition of a square into rectangles of minimal perimeter | 1987-01-01 | Paper |
| Storing the subdivision of a polyhedral surface | 1987-01-01 | Paper |
| The Discrete Geodesic Problem | 1987-01-01 | Paper |
