| Publication | Date of Publication | Type |
|---|
| The limit of \(L_p\) Voronoi diagrams as \(p\rightarrow 0\) is the bounding-box-area Voronoi diagram | 2024-10-25 | Paper |
| Voronoi diagrams in the moscow metric | 2024-02-28 | Paper |
| Fast skeleton construction | 2023-05-08 | Paper |
| Moving an angle around a region | 2022-12-09 | Paper |
| “The big sweep”: On the power of the wavefront approach to Voronoi diagrams | 2022-08-18 | Paper |
| A new model and algorithms in firefighting theory | 2022-08-04 | Paper |
| Partially Walking a Polygon | 2022-07-21 | Paper |
| The limit of $L_p$ Voronoi diagrams as $p \rightarrow 0$ is the bounding-box-area Voronoi diagram | 2022-07-15 | Paper |
| Algorithmische Geometrie | 2022-06-15 | Paper |
| Geometric firefighting in the half-plane | 2021-09-16 | Paper |
| A new model in firefighting theory | 2020-07-21 | Paper |
| The geometric dilation of three points | 2020-01-31 | Paper |
| Geometric firefighting in the half-plane | 2020-01-16 | Paper |
| Approximation algorithms for the geometric firefighter and budget fence problems | 2019-10-29 | Paper |
| Partially walking a polygon | 2019-10-25 | Paper |
| On a Fire Fighter’s Problem | 2019-06-24 | Paper |
| An efficient randomized algorithm for higher-order abstract Voronoi diagrams | 2019-05-17 | Paper |
| How many lions are needed to clear a grid? | 2018-08-20 | Paper |
| Forest-like abstract Voronoi diagrams in linear time | 2018-02-19 | Paper |
| Reversibility properties of the fire-fighting problem in graphs | 2018-02-12 | Paper |
| Abstract Voronoi Diagrams from Closed Bisecting Curves | 2018-01-31 | Paper |
| An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. | 2018-01-30 | Paper |
| A Fire Fighter's Problem. | 2017-10-10 | Paper |
| A local strategy for cleaning expanding cellular domains by simple robots | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501793 | 2015-08-14 | Paper |
| On the complexity of higher order abstract Voronoi diagrams | 2015-07-27 | Paper |
| ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS | 2015-07-01 | Paper |
| Most finite point sets in the plane have dilation \(>1\) | 2015-02-19 | Paper |
| Online algorithms for searching and exploration in the plane | 2014-10-24 | Paper |
| A traveller's problem | 2014-04-03 | Paper |
| Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems | 2014-03-31 | Paper |
| Ant-sweep | 2014-03-24 | Paper |
| A new upper bound for the VC-dimension of visibility regions | 2014-03-24 | Paper |
| Reprint of: Optimally solving a transportation problem using Voronoi diagrams | 2014-01-22 | Paper |
| Abstract Voronoi Diagrams with Disconnected Regions | 2014-01-14 | Paper |
| A new upper bound for the VC-dimension of visibility regions | 2014-01-08 | Paper |
| Voronoi Diagrams and Delaunay Triangulations | 2013-10-17 | Paper |
| On the Complexity of Higher Order Abstract Voronoi Diagrams | 2013-08-06 | Paper |
| Optimally solving a transportation problem using Voronoi diagrams | 2013-07-31 | Paper |
| COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE | 2012-11-23 | Paper |
| Optimally solving a transportation problem using Voronoi diagrams | 2012-09-25 | Paper |
| Tolerant Algorithms | 2011-09-16 | Paper |
| Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane | 2010-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4929404 | 2010-09-22 | Paper |
| COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD | 2010-05-28 | Paper |
| New Results on Visibility in Simple Polygons | 2009-10-20 | Paper |
| Abstract Voronoi diagrams revisited | 2009-08-14 | Paper |
| On the dilation spectrum of paths, cycles, and trees | 2009-08-14 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Competitive Online Approximation of the Optimal Search Ratio | 2009-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619930 | 2009-04-14 | Paper |
| Voronoi diagram for services neighboring a highway | 2009-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601548 | 2009-02-10 | Paper |
| A Meeting Scheduling Problem Respecting Time and Space | 2008-07-10 | Paper |
| Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D | 2008-04-16 | Paper |
| Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs | 2008-01-04 | Paper |
| Computing Geometric Minimum-Dilation Graphs Is NP-Hard | 2007-08-28 | Paper |
| EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION | 2007-07-13 | Paper |
| Geometric dilation of closed planar curves: New lower bounds | 2007-06-04 | Paper |
| On the geometric dilation of closed curves, graphs, and point sets | 2007-03-12 | Paper |
| Chords halving the area of a planar convex set | 2007-02-13 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| The geometric dilation of finite point sets | 2006-06-14 | Paper |
| Online searching with an autonomous robot | 2006-05-16 | Paper |
| A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation | 2006-04-28 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| MAXIMIZING A VORONOI REGION: THE CONVEX CASE | 2005-11-29 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Algorithmische Geometrie | 2005-07-20 | Paper |
| An Optimal Competitive Strategy for Walking in Streets | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736555 | 2004-08-09 | Paper |
| A fast algorithm for approximating the detour of a polygonal chain. | 2004-03-14 | Paper |
| The weighted farthest color Voronoi diagram on trees and graphs. | 2004-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427882 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413781 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413793 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796181 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796185 | 2003-03-02 | Paper |
| The Polygon Exploration Problem | 2002-04-23 | Paper |
| Generalized self-approaching curves | 2001-04-04 | Paper |
| On bisectors for different distance functions | 2001-04-04 | Paper |
| Solving nonconvex planar location problems by finite dominating sets | 2001-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525679 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499945 | 2000-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945505 | 2000-03-23 | Paper |
| Self-approaching curves | 1999-10-06 | Paper |
| How to find a point on a line within a fixed distance | 1999-05-24 | Paper |
| A combinatorial property of convex sets | 1997-09-23 | Paper |
| ``The big sweep: On the power of the wavefront approach to Voronoi diagrams | 1997-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335819 | 1997-05-04 | Paper |
| A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON | 1996-12-16 | Paper |
| Wrapping ellipses around a convex skeleton | 1995-09-10 | Paper |
| MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON | 1995-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327372 | 1995-04-05 | Paper |
| Randomized incremental construction of abstract Voronoi diagrams | 1994-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4286731 | 1994-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201933 | 1993-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694765 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035751 | 1993-05-18 | Paper |
| THE TWO GUARDS PROBLEM | 1993-04-01 | Paper |
| Concrete and abstract Voronoi diagrams | 1993-01-23 | Paper |
| Walking an unknown street with bounded detour | 1992-09-27 | Paper |
| A tight upper bound for the path length of AVL trees | 1990-01-01 | Paper |
| A dynamic fixed windowing problem | 1989-01-01 | Paper |
| On the path length of binary trees | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789085 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794819 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795194 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795223 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824965 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833670 | 1988-01-01 | Paper |
| The node visit cost of brother trees | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777461 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785961 | 1987-01-01 | Paper |
| Direct dominance of points | 1986-01-01 | Paper |
| Über Hilbertsche Körper. | 1982-01-01 | Paper |
