| Publication | Date of Publication | Type |
|---|
The limit of \(L_p\) Voronoi diagrams as \(p\rightarrow 0\) is the bounding-box-area Voronoi diagram
Discrete \& Computational Geometry | 2024-10-25 | Paper |
Voronoi diagrams in the moscow metric
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Fast skeleton construction
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Moving an angle around a region
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
A new model and algorithms in firefighting theory
Discrete Applied Mathematics | 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 |
Algorithmic geometry. Foundations, methods, applications
| 2022-06-15 | Paper |
Geometric firefighting in the half-plane
Computational Geometry | 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
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Approximation algorithms for the geometric firefighter and budget fence problems
Algorithms | 2019-10-29 | Paper |
Partially walking a polygon
Computational Geometry | 2019-10-25 | Paper |
On a fire fighter's problem
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
An efficient randomized algorithm for higher-order abstract Voronoi diagrams
Algorithmica | 2019-05-17 | Paper |
How many lions are needed to clear a grid?
Algorithms | 2018-08-20 | Paper |
Forest-like abstract Voronoi diagrams in linear time
Computational Geometry | 2018-02-19 | Paper |
Reversibility properties of the fire-fighting problem in graphs
Computational Geometry | 2018-02-12 | Paper |
Abstract Voronoi diagrams from closed bisecting curves
International Journal of Computational Geometry & Applications | 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
Theoretical Computer Science | 2015-10-30 | Paper |
scientific article; zbMATH DE number 6472590 (Why is no real title available?)
| 2015-08-14 | Paper |
On the complexity of higher order abstract Voronoi diagrams
Computational Geometry | 2015-07-27 | Paper |
Abstract Voronoi diagrams with disconnected regions
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Most finite point sets in the plane have dilation \(>1\)
Discrete \& Computational Geometry | 2015-02-19 | Paper |
Online algorithms for searching and exploration in the plane
Computer Science Review | 2014-10-24 | Paper |
A traveller's problem
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Approximation algorithms for the geometric firefighter and budget fence problems
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Ant-sweep, a decentral strategy for cooperative cleaning in expanding domains
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
A new upper bound for the VC-dimension of visibility regions
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Reprint of: Optimally solving a transportation problem using Voronoi diagrams
Computational Geometry | 2014-01-22 | Paper |
Abstract Voronoi diagrams with disconnected regions
Algorithms and Computation | 2014-01-14 | Paper |
A new upper bound for the VC-dimension of visibility regions
Computational Geometry | 2014-01-08 | Paper |
Voronoi diagrams and Delaunay triangulations
| 2013-10-17 | Paper |
On the complexity of higher order abstract Voronoi diagrams
Automata, Languages, and Programming | 2013-08-06 | Paper |
Optimally solving a transportation problem using Voronoi diagrams
Computational Geometry | 2013-07-31 | Paper |
Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Optimally solving a transportation problem using Voronoi diagrams
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Tolerant algorithms
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Spanning ratio and maximum detour of rectilinear paths in the \(L _{1}\) plane
Algorithms and Computation | 2010-12-09 | Paper |
The tourist in the shopping arcade
| 2010-09-22 | Paper |
Computing geometric minimum-dilation graphs is NP-hard
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
New Results on Visibility in Simple Polygons
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Abstract Voronoi diagrams revisited
Computational Geometry | 2009-08-14 | Paper |
On the dilation spectrum of paths, cycles, and trees
Computational Geometry | 2009-08-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Competitive Online Approximation of the Optimal Search Ratio
SIAM Journal on Computing | 2009-06-22 | Paper |
scientific article; zbMATH DE number 5542484 (Why is no real title available?)
| 2009-04-14 | Paper |
Voronoi diagram for services neighboring a highway
Information Processing Letters | 2009-03-23 | Paper |
scientific article; zbMATH DE number 5506217 (Why is no real title available?)
| 2009-02-10 | Paper |
A Meeting Scheduling Problem Respecting Time and Space
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
Discrete \& Computational Geometry | 2008-04-16 | Paper |
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
Graph Drawing | 2007-08-28 | Paper |
EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
International Journal of Computational Geometry & Applications | 2007-07-13 | Paper |
Geometric dilation of closed planar curves: New lower bounds
Computational Geometry | 2007-06-04 | Paper |
On the geometric dilation of closed curves, graphs, and point sets
Computational Geometry | 2007-03-12 | Paper |
Chords halving the area of a planar convex set
Mathematical Inequalities & Applications | 2007-02-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
The geometric dilation of finite point sets
Algorithmica | 2006-06-14 | Paper |
Online searching with an autonomous robot
Computational Geometry | 2006-05-16 | Paper |
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
Computational Geometry | 2006-04-28 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
MAXIMIZING A VORONOI REGION: THE CONVEX CASE
International Journal of Computational Geometry & Applications | 2005-11-29 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Algorithmische Geometrie
eXamen.press | 2005-07-20 | Paper |
An Optimal Competitive Strategy for Walking in Streets
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2085302 (Why is no real title available?)
| 2004-08-09 | Paper |
A fast algorithm for approximating the detour of a polygonal chain.
Computational Geometry | 2004-03-14 | Paper |
The weighted farthest color Voronoi diagram on trees and graphs.
Computational Geometry | 2004-01-23 | Paper |
scientific article; zbMATH DE number 1979535 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1951558 (Why is no real title available?)
| 2003-07-21 | Paper |
scientific article; zbMATH DE number 1951549 (Why is no real title available?)
| 2003-07-21 | Paper |
scientific article; zbMATH DE number 1875426 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1875422 (Why is no real title available?)
| 2003-03-02 | Paper |
The polygon exploration problem
SIAM Journal on Computing | 2002-04-23 | Paper |
On bisectors for different distance functions
Discrete Applied Mathematics | 2001-04-04 | Paper |
Generalized self-approaching curves
Discrete Applied Mathematics | 2001-04-04 | Paper |
Solving nonconvex planar location problems by finite dominating sets
Journal of Global Optimization | 2001-03-20 | Paper |
scientific article; zbMATH DE number 1555916 (Why is no real title available?)
| 2001-01-24 | Paper |
scientific article; zbMATH DE number 1501064 (Why is no real title available?)
| 2000-11-26 | Paper |
scientific article; zbMATH DE number 1424293 (Why is no real title available?)
| 2000-03-23 | Paper |
Self-approaching curves
Mathematical Proceedings of the Cambridge Philosophical Society | 1999-10-06 | Paper |
How to find a point on a line within a fixed distance
Discrete Applied Mathematics | 1999-05-24 | Paper |
A combinatorial property of convex sets
Discrete \& Computational Geometry | 1997-09-23 | Paper |
``The big sweep: On the power of the wavefront approach to Voronoi diagrams
Algorithmica | 1997-06-22 | Paper |
scientific article; zbMATH DE number 1006218 (Why is no real title available?)
| 1997-05-04 | Paper |
A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 1996-12-16 | Paper |
Wrapping ellipses around a convex skeleton
International Journal of Computer Mathematics | 1995-09-10 | Paper |
MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 1995-08-20 | Paper |
scientific article; zbMATH DE number 741007 (Why is no real title available?)
| 1995-04-05 | Paper |
Randomized incremental construction of abstract Voronoi diagrams
Computational Geometry | 1994-10-19 | Paper |
scientific article; zbMATH DE number 544912 (Why is no real title available?)
| 1994-04-06 | Paper |
scientific article; zbMATH DE number 403949 (Why is no real title available?)
| 1993-09-06 | Paper |
scientific article; zbMATH DE number 219277 (Why is no real title available?)
| 1993-06-29 | Paper |
scientific article; zbMATH DE number 176578 (Why is no real title available?)
| 1993-05-18 | Paper |
THE TWO GUARDS PROBLEM
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
Concrete and abstract Voronoi diagrams
Lecture Notes in Computer Science | 1993-01-23 | Paper |
Walking an unknown street with bounded detour
Computational Geometry | 1992-09-27 | Paper |
A tight upper bound for the path length of AVL trees
Theoretical Computer Science | 1990-01-01 | Paper |
On the path length of binary trees
Journal of the ACM | 1989-01-01 | Paper |
A dynamic fixed windowing problem
Algorithmica | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4053041 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4110186 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4060717 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4098181 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4060214 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4060691 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4039305 (Why is no real title available?)
| 1987-01-01 | Paper |
The node visit cost of brother trees
Information and Computation | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4049071 (Why is no real title available?)
| 1987-01-01 | Paper |
Direct dominance of points
International Journal of Computer Mathematics | 1986-01-01 | Paper |
Über Hilbertsche Körper.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1982-01-01 | Paper |
