| Publication | Date of Publication | Type |
|---|
| Competitive searching in polygons—Beyond generalised streets | 2023-03-21 | Paper |
| Going home through an unknown street | 2022-12-16 | Paper |
| An O(log log n) algorithm to compute the kernel of a polygon | 2022-12-09 | Paper |
| Computing the L 1-diameter and center of a simple rectilinear polygon in parallel | 2022-12-09 | Paper |
| Walking streets faster | 2022-12-09 | Paper |
| Lower bounds in on-line geometric searching metric searching | 2022-12-09 | Paper |
| Position-independent near optimal searching and on-line recognition in star polygons | 2022-08-19 | Paper |
| Generalized streets revisited | 2017-12-05 | Paper |
| Enumerating extreme points in higher dimensions | 2017-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024768 | 2005-07-04 | Paper |
| LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS | 2005-06-10 | Paper |
| An Optimal Competitive Strategy for Walking in Streets | 2005-02-21 | Paper |
| On-line parallel heuristics, processor scheduling and robot searching under the competitive framework | 2004-10-27 | Paper |
| Online Parallel Heuristics and Robot Searching under the Competitive Framework | 2004-08-12 | Paper |
| Searching and on-line recognition of star-shaped polygons. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413802 | 2003-07-21 | Paper |
| Multiple-guard kernels of simple polygons | 2003-02-24 | Paper |
| Optimal robot localization in trees | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2748152 | 2002-05-21 | Paper |
| Lower bounds in on-line geometric searching | 2002-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150180 | 2002-01-01 | Paper |
| Exploring unknown environments with obstacles | 2002-01-01 | Paper |
| Parallel searching on \(m\) rays | 2001-09-27 | Paper |
| The ultimate strategy to search on \(m\) rays? | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942049 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252368 | 2000-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218409 | 1998-11-11 | Paper |
| Visibility in semi-convex spaces | 1998-08-24 | Paper |
| AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON | 1996-08-12 | Paper |
| An optimal algorithm for the rectilinear link center of a rectilinear polygon | 1996-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862345 | 1996-07-02 | Paper |
| Staircase visibility and computation of kernels | 1995-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4698691 | 1995-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281528 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035759 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035765 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037424 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973281 | 1992-06-26 | Paper |
