| Publication | Date of Publication | Type |
|---|
| Coordinated Path Planning through Local Search and Simulated Annealing | 2023-06-26 | Paper |
| Pattern matching in doubling spaces | 2022-03-25 | Paper |
| Matching sets of line segments | 2021-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136216 | 2020-11-25 | Paper |
| Tight bounds for beacon-based coverage in simple rectilinear polygons | 2019-10-18 | Paper |
| Faster algorithms for growing prioritized disks and rectangles | 2019-10-18 | Paper |
| Matching Sets of Line Segments | 2019-10-15 | Paper |
| Approximating a planar convex set using a sparse grid | 2019-09-20 | Paper |
| A Faster Algorithm for Computing Straight Skeletons | 2018-11-05 | Paper |
| Reachability in a Planar Subdivision with Direction Constraints | 2018-08-13 | Paper |
| Finding Largest Common Point Sets | 2018-01-31 | Paper |
| Maximizing the overlap of two planar convex sets under rigid motions | 2017-10-20 | Paper |
| Navigating Weighted Regions with Scattered Skinny Tetrahedra | 2017-10-20 | Paper |
| Triangulation Refinement and Approximate Shortest Paths in Weighted Regions | 2017-10-05 | Paper |
| Reachability by paths of bounded curvature in convex polygons | 2017-09-29 | Paper |
| Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons | 2016-05-03 | Paper |
| Navigating Weighted Regions with Scattered Skinny Tetrahedra | 2016-01-11 | Paper |
| Geometric optimization and sums of algebraic functions | 2015-08-14 | Paper |
| Computing the Gromov hyperbolicity of a discrete metric space | 2015-05-21 | Paper |
| A faster algorithm for computing motorcycle graphs | 2015-02-17 | Paper |
| A generalization of the convex Kakeya problem | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934663 | 2014-12-18 | Paper |
| A faster algorithm for computing motorcycle graphs | 2014-11-14 | Paper |
| A Faster Algorithm for Computing Straight Skeletons | 2014-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417676 | 2014-05-22 | Paper |
| Realistic roofs over a rectilinear polygon | 2013-09-03 | Paper |
| A deterministic algorithm for fitting a step function to a weighted point-set | 2013-03-20 | Paper |
| Covering and piercing disks with two centers | 2013-01-25 | Paper |
| COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT | 2012-11-23 | Paper |
| APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS | 2012-11-23 | Paper |
| A generalization of the convex Kakeya problem | 2012-06-29 | Paper |
| Reachability by paths of bounded curvature in a convex polygon | 2012-06-08 | Paper |
| Generating Realistic Roofs over a Rectilinear Polygon | 2011-12-16 | Paper |
| Covering and Piercing Disks with Two Centers | 2011-12-16 | Paper |
| Fitting a step function to a point set | 2011-07-01 | Paper |
| THE ALIGNED K-CENTER PROBLEM | 2011-05-11 | Paper |
| REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION | 2011-05-11 | Paper |
| Computing the Discrete Fréchet Distance with Imprecise Input | 2010-12-09 | Paper |
| Approximate Shortest Homotopic Paths in Weighted Regions | 2010-12-09 | Paper |
| Querying Approximate Shortest Paths in Anisotropic Regions | 2010-11-04 | Paper |
| Approximate Shortest Paths in Anisotropic Regions | 2009-06-22 | Paper |
| Querying approximate shortest paths in anisotropic regions | 2009-02-12 | Paper |
| Fitting a Step Function to a Point Set | 2008-11-25 | Paper |
| Space-Time Tradeoffs for Proximity Searching in Doubling Spaces | 2008-11-25 | Paper |
| Lower Bounds for Geometric Diameter Problems | 2008-09-18 | Paper |
| Sparse geometric graphs with small dilation | 2008-06-18 | Paper |
| A tight lower bound for computing the diameter of a 3D convex polytope | 2007-11-28 | Paper |
| Packing two disks into a polygonal environment. | 2007-04-25 | Paper |
| Maximizing the overlap of two planar convex sets under rigid motions | 2007-03-15 | Paper |
| Motorcycle graphs and straight skeletons | 2007-03-12 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets | 2006-04-28 | Paper |
| The Voronoi diagram of curved objects | 2005-11-10 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828928 | 2004-11-29 | Paper |
| Computing farthest neighbors on a convex polytope. | 2003-08-17 | Paper |
| Polynomial time algorithms for three-label point labeling. | 2003-08-17 | Paper |
| Reporting intersections among thick objects. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551357 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551356 | 2002-09-05 | Paper |
| An algorithm for finding a \(k\)-median in a directed tree | 2002-07-25 | Paper |
| An elementary algorithm for reporting intersections of red/blue curve segments | 2002-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329403 | 2001-01-01 | Paper |
