| Publication | Date of Publication | Type |
|---|
| Fast approximation algorithms for piercing boxes by points | 2024-11-28 | Paper |
| Computing instance-optimal kernels in two dimensions | 2024-10-16 | Paper |
| Revisiting random points: combinatorial complexity and algorithms | 2024-05-29 | Paper |
| Halving by a thousand cuts or punctures | 2024-05-14 | Paper |
| On the number of incidences when avoiding an induced biclique in geometric settings | 2024-05-14 | Paper |
| Approximation algorithms for maximum matchings in geometric intersection graphs | 2024-05-14 | Paper |
| Fast Algorithms for Geometric Consensuses | 2023-11-02 | Paper |
| Submodular clustering in low dimensions | 2023-11-02 | Paper |
| Reliable Spanners for Metric Spaces | 2023-10-23 | Paper |
| Improved Approximation Algorithms for Tverberg Partitions | 2023-09-20 | Paper |
| A note on stabbing convex bodies with points, lines, and flats | 2023-05-12 | Paper |
| Edge Estimation with Independent Set Oracles | 2023-04-26 | Paper |
| Few cuts meet many point sets | 2023-04-11 | Paper |
| Sometimes Reliable Spanners of Almost Linear Size. | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091042 | 2022-07-21 | Paper |
| Smallest k-enclosing rectangle revisited | 2022-07-18 | Paper |
| Journey to the Center of the Point Set | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088946 | 2022-07-18 | Paper |
| On Locality-Sensitive Orderings and Their Applications | 2022-07-18 | Paper |
| Optimal Algorithms for Geometric Centers and Depth | 2022-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077657 | 2022-05-18 | Paper |
| The maximum-level vertex in an arrangement of lines | 2022-03-21 | Paper |
| Journey to the Center of the Point Set | 2022-02-08 | Paper |
| Smallest \(k\)-enclosing rectangle revisited | 2021-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002756 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993304 | 2021-06-15 | Paper |
| Stabbing pairwise intersecting disks by five points | 2021-06-14 | Paper |
| Active-learning a convex body in low dimensions | 2021-06-11 | Paper |
| Grid peeling and the affine curve-shortening flow | 2021-04-01 | Paper |
| Fast LP-based Approximations for Geometric Packing and Covering Problems | 2021-02-02 | Paper |
| A spanner for the day after | 2021-01-29 | Paper |
| Approximate Greedy Clustering and Distance Selection for Graph Metrics | 2021-01-12 | Paper |
| On Locality-Sensitive Orderings and Their Applications | 2020-08-03 | Paper |
| Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location | 2020-06-16 | Paper |
| On separating points by lines | 2020-04-07 | Paper |
| Approximation Schemes for Independent Set and Sparse Subsets of Polygons | 2020-02-11 | Paper |
| Sparse Approximation via Generating Point Sets | 2019-11-25 | Paper |
| Grid peeling and the affine curve-shortening flow | 2019-09-12 | Paper |
| Euclidean Spanners in High Dimensions | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743403 | 2019-05-10 | Paper |
| Optimally cutting a surface into a disk | 2018-11-23 | Paper |
| The one-round Voronoi game | 2018-11-23 | Paper |
| Projective clustering in high dimensions using core-sets | 2018-11-23 | Paper |
| On the Expected Complexity of Voronoi Diagrams on Terrains | 2018-11-05 | Paper |
| Nearest-Neighbor Searching Under Uncertainty II | 2018-11-05 | Paper |
| Net and Prune | 2018-08-02 | Paper |
| Sparse Approximation via Generating Point Sets | 2018-07-16 | Paper |
| Approximating the k-Level in Three-Dimensional Plane Arrangements | 2018-07-16 | Paper |
| Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search | 2018-07-16 | Paper |
| Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons | 2018-04-23 | Paper |
| On the Complexity of Randomly Weighted Voronoi Diagrams | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607941 | 2018-03-15 | Paper |
| Robust proximity search for balls using sublinear space | 2018-02-28 | Paper |
| Approximating the k-Level in Three-Dimensional Plane Arrangements | 2018-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132852 | 2018-01-30 | Paper |
| Geometric Packing under Nonuniform Constraints | 2017-11-22 | Paper |
| Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs | 2017-11-22 | Paper |
| A time-optimal delaunay refinement algorithm in two dimensions | 2017-10-20 | Paper |
| Smaller coresets for k-median and k-means clustering | 2017-10-20 | Paper |
| Approximation algorithms for maximum independent set of pseudo-disks | 2017-10-20 | Paper |
| On the set multi-cover problem in geometric settings | 2017-10-20 | Paper |
| Fast construction of nets in low dimensional metrics, and their applications | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368700 | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368721 | 2017-10-10 | Paper |
| Convex hulls under uncertainty | 2017-10-10 | Paper |
| Shortest Path in a Polygon using Sublinear Space. | 2017-10-10 | Paper |
| Computing approximate shortest paths on convex polytopes | 2017-09-29 | Paper |
| Shape fitting with outliers | 2017-09-29 | Paper |
| On the least median square problem | 2017-09-29 | Paper |
| Efficient algorithms for shared camera control | 2017-09-29 | Paper |
| High-dimensional shape fitting in linear time | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365086 | 2017-09-29 | Paper |
| When crossings count — approximating the minimum spanning tree | 2017-09-29 | Paper |
| A practical approach for computing the diameter of a point set | 2017-09-29 | Paper |
| On conflict-free coloring of points and simple regions in the plane | 2017-09-29 | Paper |
| Hausdorff distance under translation for points and balls | 2017-09-29 | Paper |
| Approximating the maximum overlap of polygons under translation | 2017-05-11 | Paper |
| Robust Proximity Search for Balls Using Sublinear Space | 2017-04-25 | Paper |
| Shortest path in a polygon using sublinear space | 2017-03-30 | Paper |
| Minimum convex partitions and maximum empty polytopes | 2017-03-09 | Paper |
| WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED | 2017-03-09 | Paper |
| From proximity to utility: a Voronoi partition of Pareto optima | 2016-10-27 | Paper |
| Space exploration via proximity search | 2016-09-14 | Paper |
| How to walk your dog in the mountains with no magic leash | 2016-02-29 | Paper |
| On the Number of Edges of Fan-Crossing Free Graphs | 2016-02-19 | Paper |
| Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs | 2015-11-19 | Paper |
| Approximating Minimization Diagrams and Generalized Proximity Search | 2015-08-18 | Paper |
| The frechet distance revisited and extended | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501374 | 2015-08-03 | Paper |
| On the complexity of randomly weighted multiplicative Voronoi diagrams | 2015-06-18 | Paper |
| On the set multicover problem in geometric settings | 2014-12-05 | Paper |
| Hausdorff distance under translation for points and balls | 2014-11-18 | Paper |
| Down the rabbit hole: robust proximity search and density estimation in sublinear space | 2014-11-14 | Paper |
| Union of random Minkowski sums and network vulnerability analysis | 2014-11-14 | Paper |
| How fast is the \(k\)-means method? | 2014-10-13 | Paper |
| On approximating the depth and related problems | 2014-10-13 | Paper |
| Convex hulls under uncertainty | 2014-10-08 | Paper |
| Approximating the Maximum Overlap of Polygons under Translation | 2014-10-08 | Paper |
| On the expected complexity of Voronoi diagrams on terrains | 2014-08-07 | Paper |
| How to walk your dog in the mountains with no magic leash | 2014-08-07 | Paper |
| Net and prune | 2014-08-07 | Paper |
| Geometric packing under non-uniform constraints | 2014-08-07 | Paper |
| Approximating the Fréchet distance for realistic curves in near linear time | 2014-04-03 | Paper |
| New constructions of SSPDs and their applications | 2014-04-03 | Paper |
| The frechet distance revisited and extended | 2014-03-24 | Paper |
| Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts | 2014-02-04 | Paper |
| On the Number of Edges of Fan-Crossing Free Graphs | 2014-01-14 | Paper |
| Peeling the grid | 2013-09-26 | Paper |
| Embeddings of surfaces, curves, and moving points in Euclidean space | 2013-07-24 | Paper |
| Approximate nearest neighbor search for low-dimensional queries | 2013-07-04 | Paper |
| Approximate nearest neighbor: towards removing the curse of dimensionality | 2012-09-27 | Paper |
| Approximation algorithms for maximum independent set of pseudo-disks | 2012-09-19 | Paper |
| Minimum Convex Partitions and Maximum Empty Polytopes | 2012-08-14 | Paper |
| Approximating the Fréchet distance for realistic curves in near linear time | 2012-08-13 | Paper |
| New constructions of SSPDs and their applications | 2012-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093256 | 2011-10-12 | Paper |
| Computing the Fréchet Distance between Folded Polygons | 2011-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3010463 | 2011-07-04 | Paper |
| Relative \((p,\varepsilon )\)-approximations in geometry | 2011-03-31 | Paper |
| Approximating extent measures of points | 2011-02-01 | Paper |
| Robust shape fitting via peeling and grating coresets | 2010-08-16 | Paper |
| On coresets for k-means and k-median clustering | 2010-08-15 | Paper |
| Approximate clustering via core-sets | 2010-08-05 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Guarding galleries and terrains | 2010-01-29 | Paper |
| Covering many or few points with unit disks | 2009-09-02 | Paper |
| On Approximating the Depth and Related Problems | 2009-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619931 | 2009-04-14 | Paper |
| The Euclidean Orienteering Problem Revisited | 2009-03-16 | Paper |
| Embeddings of surfaces, curves, and moving points in euclidean space | 2009-02-12 | Paper |
| On approximate halfspace range counting and relative epsilon-approximations | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601565 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601545 | 2009-02-10 | Paper |
| Coresets for Discrete Integration and Clustering | 2008-04-17 | Paper |
| Robust shape fitting via peeling and grating coresets | 2008-04-16 | Paper |
| Fréchet Distance for Curves, Revisited | 2008-03-11 | Paper |
| Covering Many or Few Points with Unit Disks | 2008-02-21 | Paper |
| Finding a guard that sees most and a shop that sells most | 2007-06-21 | Paper |
| How to get close to the median shape | 2007-03-12 | Paper |
| Smaller coresets for \(k\)-median and \(k\)-means clustering | 2007-02-14 | Paper |
| On the least median square problem | 2006-12-06 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Fast Construction of Nets in Low-Dimensional Metrics and Their Applications | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290249 | 2006-04-28 | Paper |
| Near-linear time approximation algorithms for curve simplification | 2006-03-21 | Paper |
| On the Fermat-Weber center of a convex object | 2005-11-01 | Paper |
| Approximating \(k\)-hop minimum-spanning trees | 2005-08-25 | Paper |
| Conflict-free coloring of points and simple regions in the plane | 2005-08-17 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD | 2005-06-10 | Paper |
| Geographic quorum system approximations | 2005-04-29 | Paper |
| AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE | 2005-03-30 | Paper |
| Fast algorithms for computing the smallest \(k\)-enclosing circle | 2005-02-21 | Paper |
| How fast is the \(k\)-means method? | 2005-02-21 | Paper |
| Shape Fitting with Outliers | 2005-02-21 | Paper |
| High-dimensional shape fitting in linear time | 2005-02-11 | Paper |
| Clustering motion | 2004-12-13 | Paper |
| The one-round Voronoi game | 2004-03-11 | Paper |
| Optimally cutting a surface into a disk | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420763 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411343 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707799 | 2003-06-11 | Paper |
| New similarity measures between polylines with applications to morphing and polygon sweeping | 2003-03-17 | Paper |
| Reporting intersecting pairs of convex polytopes in two and three dimensions | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778548 | 2002-11-18 | Paper |
| Morphing between polylines | 2002-07-16 | Paper |
| Computing approximate shortest paths on convex polytopes | 2002-06-17 | Paper |
| Maintaining approximate extent measures of moving points | 2002-03-24 | Paper |
| Online point location in planar arrangements and its applications | 2002-01-30 | Paper |
| Online point location in planar arrangements and its applications | 2002-01-17 | Paper |
| Penetration depth of two convex polytopes in 3D | 2002-01-17 | Paper |
| Approximation algorithms for minimum-width annuli and shells | 2001-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721992 | 2001-07-11 | Paper |
| Efficiently approximating the minimum-volume bounding box of a point set in three dimensions | 2001-04-17 | Paper |
| Taking a walk in a planar arrangement | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952719 | 2001-01-29 | Paper |
| Constructing Planar Cuttings in Theory and Practice | 2000-10-18 | Paper |
| Multicolor combination lemma | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252276 | 2000-02-02 | Paper |
| Constructing Approximate Shortest Path Maps in Three Dimensions | 1999-10-28 | Paper |
| Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions | 1999-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252379 | 1999-06-17 | Paper |
| An output sensitive algorithm for discrete convex hulls | 1998-06-08 | Paper |
| Approximating shortest paths on a convex polytope in three dimensions | 1998-02-17 | Paper |
