| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147341 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147360 | 2024-01-15 | Paper |
| Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching | 2023-12-08 | Paper |
| On reverse shortest paths in geometric proximity graphs | 2023-11-23 | Paper |
| Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead | 2023-10-31 | Paper |
| Multi-robot motion planning for unit discs with revolving areas | 2023-07-31 | Paper |
| Connected component and simple polygon intersection searching | 2023-01-18 | Paper |
| Star unfolding of a polytope with applications | 2022-12-09 | Paper |
| Intersection queries in sets of disks | 2022-12-09 | Paper |
| Computing depth orders and related problems | 2022-12-09 | Paper |
| Selection in monotone matrices and computing k th nearest neighbors | 2022-12-09 | Paper |
| Maintaining the extent of a moving point set | 2022-08-19 | Paper |
| On range searching with semialgebraic sets | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091017 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088930 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088931 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088955 | 2022-07-18 | Paper |
| Geometric optimization revisited | 2022-02-16 | Paper |
| Union of Hypercubes and 3D Minkowski Sums with Random Sizes. | 2021-07-28 | Paper |
| Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications | 2021-05-27 | Paper |
| Union of hypercubes and 3D Minkowski sums with random sizes | 2021-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136297 | 2020-11-25 | Paper |
| A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching | 2020-11-11 | Paper |
| Computing Shortest Paths in the Plane with Removable Obstacles | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115770 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111687 | 2020-05-27 | Paper |
| Near-linear algorithms for geometric hitting sets and set covers | 2020-01-31 | Paper |
| Computing the Discrete Fréchet Distance in Subquadratic Time | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743402 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633835 | 2019-05-06 | Paper |
| An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles | 2019-03-28 | Paper |
| Computing the Gromov-Hausdorff Distance for Metric Trees | 2018-11-13 | Paper |
| Nearest-Neighbor Searching Under Uncertainty II | 2018-11-05 | Paper |
| Kinetic and dynamic data structures for closest pair and all nearest neighbors | 2018-11-05 | Paper |
| Algorithms for center and Tverberg points | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580079 | 2018-08-13 | Paper |
| Efficient Algorithms for k-Regret Minimizing Sets | 2018-08-13 | Paper |
| An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles | 2018-07-16 | Paper |
| Near-Linear Algorithms for Geometric Hitting Sets and Set Covers | 2018-04-23 | Paper |
| An Efficient Algorithm for Placing Electric Vehicle Charging Stations. | 2018-04-19 | Paper |
| Range-max queries on uncertain data | 2018-04-18 | Paper |
| Simplex Range Searching and Its Variants: A Review | 2018-02-26 | Paper |
| Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences | 2018-01-30 | Paper |
| Nearest-neighbor searching under uncertainty. I | 2017-10-25 | Paper |
| Guarding a terrain by two watchtowers | 2017-10-20 | Paper |
| Near-linear approximation algorithms for geometric hitting sets | 2017-10-20 | Paper |
| Maintaining Contour Trees of Dynamic Terrains | 2017-10-10 | Paper |
| Convex hulls under uncertainty | 2017-10-10 | Paper |
| Computing approximate shortest paths on convex polytopes | 2017-09-29 | Paper |
| On the number of congruent simplices in a point | 2017-09-29 | Paper |
| Box-trees and R-trees with near-optimal query time | 2017-09-29 | Paper |
| Cache-oblivious data structures for orthogonal range searching | 2017-09-29 | Paper |
| Hausdorff distance under translation for points and balls | 2017-09-29 | Paper |
| On lines avoiding unit balls in three dimensions | 2017-09-29 | Paper |
| Algorithms for center and Tverberg points | 2017-09-29 | Paper |
| A scalable simulator for forest dynamics | 2017-09-29 | Paper |
| A 2D kinetic triangulation with near-quadratic topological changes | 2017-09-29 | Paper |
| A near-linear constant-factor approximation for euclidean bipartite matching? | 2017-09-29 | Paper |
| Practical methods for shape fitting and kinetic data structures using core sets | 2017-09-29 | Paper |
| Extreme elevation on a 2-manifold | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365042 | 2017-09-29 | Paper |
| Linear approximation of simple objects | 2016-05-26 | Paper |
| Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions | 2016-02-03 | Paper |
| Computing the Gromov-Hausdorff Distance for Metric Trees | 2016-01-11 | Paper |
| Mergeable summaries | 2015-09-03 | Paper |
| Efficient algorithms for bichromatic separability | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501790 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501826 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501300 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501327 | 2015-08-03 | Paper |
| Lenses in arrangements of pseudo-circles and their applications | 2015-08-01 | Paper |
| Approximation algorithms for bipartite matching with metric and geometric costs | 2015-06-26 | Paper |
| Streaming algorithms for extent problems in high dimensions | 2015-05-21 | Paper |
| Union of random minkowski sums and network vulnerability analysis | 2015-02-17 | Paper |
| Hausdorff distance under translation for points and balls | 2014-11-18 | Paper |
| Union of random Minkowski sums and network vulnerability analysis | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921726 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921744 | 2014-10-13 | Paper |
| Convex hulls under uncertainty | 2014-10-08 | Paper |
| I/O-efficient batched union-find and its applications to terrain analysis | 2014-09-09 | Paper |
| Range searching on uncertain data | 2014-09-09 | Paper |
| Computing the Discrete Fréchet Distance in Subquadratic Time | 2014-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417724 | 2014-05-22 | Paper |
| A near-linear time ε-approximation algorithm for geometric bipartite matching | 2014-05-13 | Paper |
| On Range Searching with Semialgebraic Sets. II | 2014-04-11 | Paper |
| The 2-center problem in three dimensions | 2014-04-03 | Paper |
| An improved algorithm for computing the volume of the union of cubes | 2014-04-03 | Paper |
| Computing similarity between piecewise-linear functions | 2014-04-03 | Paper |
| Exploiting temporal coherence in forest dynamics simulation | 2014-03-24 | Paper |
| Computing Correlation between Piecewise-Linear Functions | 2014-02-04 | Paper |
| (Approximate) uncertain skylines | 2013-08-23 | Paper |
| Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space | 2013-07-24 | Paper |
| The 2-center problem in three dimensions | 2013-04-29 | Paper |
| Efficient external memory structures for range-aggregate queries | 2013-01-25 | Paper |
| An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries | 2012-05-30 | Paper |
| Near-linear approximation algorithms for geometric hitting sets | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002306 | 2011-05-20 | Paper |
| Out-of-order event processing in kinetic data structures | 2011-05-10 | Paper |
| On Approximate Geodesic-Distance Queries amid Deforming Point Clouds | 2011-03-02 | Paper |
| Approximating extent measures of points | 2011-02-01 | Paper |
| Guarding a terrain by two watchtowers | 2010-09-16 | Paper |
| Stability of ε-Kernels | 2010-09-06 | Paper |
| Robust shape fitting via peeling and grating coresets | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3564724 | 2010-05-26 | Paper |
| Lipschitz Unimodal and Isotonic Regression on Paths and Trees | 2010-04-27 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619930 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619931 | 2009-04-14 | Paper |
| Practical methods for shape fitting and kinetic data structures using coresets | 2009-03-24 | Paper |
| A space-optimal data-stream algorithm for coresets in the plane | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602879 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602886 | 2009-02-12 | Paper |
| Embeddings of surfaces, curves, and moving points in euclidean space | 2009-02-12 | Paper |
| Untangling triangulations through local explorations | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601536 | 2009-02-10 | Paper |
| An Efficient Algorithm for 2D Euclidean 2-Center with Outliers | 2008-11-25 | Paper |
| Stabbing Convex Polygons with a Segment or a Polygon | 2008-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514515 | 2008-07-21 | Paper |
| Computing a Center-Transversal Line | 2008-04-17 | Paper |
| Robust shape fitting via peeling and grating coresets | 2008-04-16 | Paper |
| Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D | 2008-04-16 | Paper |
| Out-of-Order Event Processing in Kinetic Data Structures | 2008-03-11 | Paper |
| On polyhedra induced by point sets in space | 2007-11-30 | Paper |
| Computing Maximally Separated Sets in the Plane | 2007-06-26 | Paper |
| Extreme elevation on a 2-manifold | 2006-12-06 | Paper |
| A two-dimensional kinetic triangulation with near-quadratic topological changes | 2006-12-06 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Independent set of intersection graphs of convex objects in 2D | 2006-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290249 | 2006-04-28 | Paper |
| Near-linear time approximation algorithms for curve simplification | 2006-03-21 | Paper |
| Approximation algorithms for a \(k\)-line center | 2006-03-21 | Paper |
| Lines avoiding unit balls in three dimensions | 2005-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692689 | 2005-09-28 | Paper |
| Pseudo-Line Arrangements: Duality, Algorithms, and Applications | 2005-09-16 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| A near-quadratic algorithm for fence design | 2005-04-28 | Paper |
| Computing the writhing number of a polygonal knot | 2004-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829015 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829016 | 2004-11-29 | Paper |
| A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center | 2003-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414531 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411343 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411344 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411345 | 2003-07-08 | Paper |
| Indexing moving points | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707799 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788601 | 2003-06-02 | Paper |
| Approximation algorithms for projective clustering | 2003-05-27 | Paper |
| The number of congruent simplices in a point set | 2003-03-17 | Paper |
| Reporting intersecting pairs of convex polytopes in two and three dimensions | 2003-03-10 | Paper |
| Curvature-Constrained Shortest Paths in a Convex Polygon | 2003-01-05 | Paper |
| Box-trees and R-trees with near-optimal query time | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778542 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778548 | 2002-11-18 | Paper |
| Exact and approximation algorithms for minimum-width cylindrical shells | 2002-07-22 | Paper |
| Maintaining the extent of a moving point set | 2002-07-22 | Paper |
| Exact and approximation algorithms for clustering | 2002-06-17 | Paper |
| Computing approximate shortest paths on convex polytopes | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535014 | 2002-06-12 | Paper |
| Improved algorithms for uniform partitions of points | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749774 | 2002-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768285 | 2002-03-24 | Paper |
| Polygon decomposition for efficient construction of Minkowski sums | 2002-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230329 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708236 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753919 | 2001-12-18 | Paper |
| Approximation algorithms for minimum-width annuli and shells | 2001-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721992 | 2001-07-11 | Paper |
| Efficient searching with linear constraints | 2001-04-02 | Paper |
| Approximating Shortest Paths on a Nonconvex Polyhedron | 2001-03-19 | Paper |
| Approximation Algorithms for Curvature-Constrained Shortest Paths | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511241 | 2001-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952660 | 2001-01-29 | Paper |
| Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions | 2000-12-19 | Paper |
| Lower bounds for kinetic planar subdivisions | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945502 | 2000-11-12 | Paper |
| Computational Geometry Column 34 | 2000-11-07 | Paper |
| Cylindrical static and kinetic binary space partitions | 2000-09-04 | Paper |
| Efficient algorithms for approximating polygonal chains | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952663 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952664 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945501 | 2000-03-23 | Paper |
| Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications | 2000-03-19 | Paper |
| Binary Space Partitions for Fat Rectangles | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250235 | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252363 | 2000-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250172 | 2000-01-03 | Paper |
| Motion planning for a convex polygon in a polygonal environment | 1999-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234081 | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250171 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252266 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252267 | 1999-06-17 | Paper |
| Line transversals of balls and smallest enclosing cylinders in three dimensions | 1999-05-27 | Paper |
| The discrete 2-center problem | 1999-04-19 | Paper |
| Label placement by maximum independent set in rectangles | 1999-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401021 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4225298 | 1999-01-18 | Paper |
| Surface Approximation and Geometric Partitions | 1998-09-20 | Paper |
| Computing Many Faces in Arrangements of Lines and Segments | 1998-05-10 | Paper |
| Constructing Levels in Arrangements and Higher Order Voronoi Diagrams | 1998-05-10 | Paper |
| Largest placement of one convex polygon inside another | 1998-03-11 | Paper |
| Approximating shortest paths on a convex polytope in three dimensions | 1998-02-17 | Paper |
| Star Unfolding of a Polytope with Applications | 1998-02-10 | Paper |
| Computing Envelopes in Four Dimensions with Applications | 1998-02-10 | Paper |
| Quasi-planar graphs have a linear number of edges | 1998-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4339095 | 1997-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335190 | 1997-04-23 | Paper |
| Ray Shooting Amidst Convex Polygons in 2D | 1996-12-08 | Paper |
| Efficient randomized algorithms for some geometric optimization problems | 1996-11-26 | Paper |
| Computing depth orders for fat objects and related problems | 1996-11-10 | Paper |
| Selection in Monotone Matrices and Computingkth Nearest Neighbors | 1996-09-15 | Paper |
| Connected component and simple polygon intersection searching | 1996-07-23 | Paper |
| The overlay of lower envelopes and its applications | 1996-06-27 | Paper |
| Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions | 1996-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875176 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875214 | 1996-04-28 | Paper |
| Dynamic half-space range reporting and its applications | 1995-12-13 | Paper |
| Applications of Parametric Searching in Geometric Optimization | 1995-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763389 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763391 | 1995-04-11 | Paper |
| IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING | 1995-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325546 | 1995-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140428 | 1994-11-29 | Paper |
| Can visibility graphs be represented compactly? | 1994-11-27 | Paper |
| On the number of views of polyhedral terrains | 1994-09-26 | Paper |
| On stabbing lines for convex polyhedra in 3D | 1994-09-25 | Paper |
| On range searching with semialgebraic sets | 1994-06-29 | Paper |
| Computing a Segment Center for a Planar Point Set | 1994-04-20 | Paper |
| Intersection Queries in Curved Objects | 1993-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138982 | 1993-10-20 | Paper |
| Counting Circular Arc Intersections | 1993-10-10 | Paper |
| Ray Shooting and Parametric Search | 1993-10-10 | Paper |
| CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON | 1993-08-22 | Paper |
| Selecting distances in the plane | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037411 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037434 | 1993-05-18 | Paper |
| Circle Shooting in a Simple Polygon | 1993-05-16 | Paper |
| Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number | 1993-01-16 | Paper |
| Relative neighborhood graphs in three dimensions | 1993-01-16 | Paper |
| Oriented aligned rectangle packing problem | 1993-01-04 | Paper |
| Applications of a new space-partitioning technique | 1992-12-14 | Paper |
| Intersection queries in sets of disks | 1992-12-14 | Paper |
| Off-line dynamic maintenance of the width of a planar point set | 1992-09-27 | Paper |
| Farthest neighbors, maximum spanning trees and related problems in higher dimensions | 1992-09-27 | Paper |
| Counting facets and incidences | 1992-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3997899 | 1992-09-17 | Paper |
| Computing external farthest neighbors for a simple polygon | 1992-06-25 | Paper |
| Euclidean minimum spanning trees and bichromatic closest pairs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359790 | 1991-01-01 | Paper |
| Partitioning arrangements of lines. I: An efficient deterministic algorithm | 1990-01-01 | Paper |
| Partitioning arrangements of lines. II: Applications | 1990-01-01 | Paper |
| Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection | 1990-01-01 | Paper |
| Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle | 1990-01-01 | Paper |
| Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences | 1989-01-01 | Paper |
