| Publication | Date of Publication | Type |
|---|
| An optimal and practical algorithm for the planar 2-center problem | 2024-11-12 | Paper |
| Two-guarding a rectilinear polygon | 2024-01-29 | Paper |
| Improved stretch factor of Delaunay triangulations of points in convex position | 2022-11-17 | Paper |
| Improved exploration of unknown polygons | 2022-06-13 | Paper |
| On the upper bound on the average distance from the Fermat-Weber center of a convex body | 2021-09-17 | Paper |
| Polynomial-time algorithms for the touring rays and related problems | 2021-07-05 | Paper |
| The touring rays and related problems | 2021-04-14 | Paper |
| Improved stretch factor of Delaunay triangulations of points in convex position | 2020-05-13 | Paper |
| Computing simple paths from given points inside a polygon | 2018-12-10 | Paper |
| The capture time of a planar graph | 2018-12-06 | Paper |
| An improved algorithm for computing a shortest watchman route for lines | 2017-12-13 | Paper |
| Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem | 2017-10-23 | Paper |
| Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems | 2017-05-19 | Paper |
| On the Conjecture of the Smallest 3-Cop-Win Planar Graph | 2017-05-19 | Paper |
| On the Capture Time of Cops and Robbers Game on a Planar Graph | 2017-02-01 | Paper |
| An Improved On-line Strategy for Exploring Unknown Polygons | 2016-02-05 | Paper |
| A New Distributed Algorithm for Computing a Dominating Set on Grids | 2015-11-12 | Paper |
| A Characterization of Link-2 LR-visibility Polygons with Applications | 2015-09-14 | Paper |
| On-Line Strategies for Evacuating from a Convex Region in the Plane | 2015-09-11 | Paper |
| Optimal point movement for covering circular regions | 2015-07-10 | Paper |
| Finding Simple Paths on Given Points in a Polygonal Region | 2014-09-02 | Paper |
| Characterizing and recognizing LR-visibility polygons | 2014-05-05 | Paper |
| Minimization of the maximum distance between the two guards patrolling a polygonal region | 2014-04-15 | Paper |
| Optimum sweeps of simple polygons with two guards | 2014-04-14 | Paper |
| Approximation algorithms for cutting a convex polyhedron out of a sphere | 2013-12-19 | Paper |
| A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body | 2013-12-10 | Paper |
| Optimal point movement for covering circular regions | 2013-03-21 | Paper |
| Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region | 2012-07-16 | Paper |
| Simple Characterization of LR-visibility Polygons | 2011-11-11 | Paper |
| Searching for mobile intruders in circular corridors by two 1-searchers | 2011-10-27 | Paper |
| Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere | 2011-06-03 | Paper |
| New Algorithms for Barrier Coverage with Mobile Sensors | 2010-09-07 | Paper |
| Optimum Sweeps of Simple Polygons with Two Guards | 2010-09-07 | Paper |
| Sweeping simple polygons with the minimum number of chain guards | 2010-01-29 | Paper |
| A 2-approximation algorithm for the zookeeper's problem | 2010-01-29 | Paper |
| Searching a Circular Corridor with Two Flashlights | 2009-06-03 | Paper |
| Finding shortest safari routes in simple polygons | 2009-04-28 | Paper |
| An efficient algorithm for the three-guard problem | 2009-03-04 | Paper |
| A unified and efficient solution to the room search problem | 2008-03-26 | Paper |
| An Optimal Algorithm for the 1-Searchability of Polygonal Rooms | 2008-03-18 | Paper |
| Searching a Polygonal Region by Two Guards | 2007-11-13 | Paper |
| A linear-time 2-approximation algorithm for the watchman route problem for simple polygons | 2007-09-28 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472523 | 2004-08-04 | Paper |
| Approximation algorithms for the watchman route and zookeeper's problems. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551360 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551358 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547822 | 2002-08-21 | Paper |
| Fast computation of shortest watchman routes in simple polygons | 2002-07-25 | Paper |
| Shortest zookeeper's routes in simple polygons | 2002-07-25 | Paper |
| On optimal bridges between two convex regions | 2002-07-25 | Paper |
| Optimal computation of the Voronoi diagram of disjoint clusters | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504035 | 2001-03-25 | Paper |
| CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES" | 2001-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525743 | 2001-01-24 | Paper |
| EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS | 2000-11-07 | Paper |
| Routing multiterminal nets on a hexagonal grid | 1999-06-07 | Paper |
| Hexagonal three-layer channel routing | 1997-02-27 | Paper |
| The net adding problem | 1996-05-28 | Paper |
| Complexity of projected images of convex subdivisions | 1995-04-09 | Paper |
| AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES | 1994-05-03 | Paper |
| The intersection searching problem for c-oriented polygons | 1991-01-01 | Paper |
