| Publication | Date of Publication | Type |
|---|
| Competitive searching in polygons—Beyond generalised streets | 2023-03-21 | Paper |
Going home through an unknown street
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Walking streets faster
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Lower bounds in on-line geometric searching metric searching
Fundamentals of Computation Theory | 2022-12-09 | Paper |
An O(log log n) algorithm to compute the kernel of a polygon
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Position-independent near optimal searching and on-line recognition in star polygons
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Generalized streets revisited
Algorithms — ESA '96 | 2017-12-05 | Paper |
Enumerating extreme points in higher dimensions
STACS 95 | 2017-12-04 | Paper |
| scientific article; zbMATH DE number 2185606 (Why is no real title available?) | 2005-07-04 | Paper |
LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
An Optimal Competitive Strategy for Walking in Streets
SIAM Journal on Computing | 2005-02-21 | Paper |
On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
Theoretical Computer Science | 2004-10-27 | Paper |
Online Parallel Heuristics and Robot Searching under the Competitive Framework
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
Searching and on-line recognition of star-shaped polygons.
Information and Computation | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1951564 (Why is no real title available?) | 2003-07-21 | Paper |
Multiple-guard kernels of simple polygons
Journal of Geometry | 2003-02-24 | Paper |
Optimal robot localization in trees
Information and Computation | 2003-01-14 | Paper |
Enumerating extreme points in higher dimensions
Nordic Journal of Computing | 2002-05-21 | Paper |
Lower bounds in on-line geometric searching
Computational Geometry | 2002-01-02 | Paper |
| scientific article; zbMATH DE number 1809601 (Why is no real title available?) | 2002-01-01 | Paper |
Exploring unknown environments with obstacles
Algorithmica | 2002-01-01 | Paper |
Parallel searching on m rays
Computational Geometry | 2001-09-27 | Paper |
The ultimate strategy to search on \(m\) rays?
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1418487 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1305480 (Why is no real title available?) | 2000-02-22 | Paper |
| scientific article; zbMATH DE number 1222821 (Why is no real title available?) | 1998-11-11 | Paper |
Visibility in semi-convex spaces
Journal of Geometry | 1998-08-24 | Paper |
AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
International Journal of Computational Geometry & Applications | 1996-08-12 | Paper |
An optimal algorithm for the rectilinear link center of a rectilinear polygon
Computational Geometry | 1996-07-14 | Paper |
| scientific article; zbMATH DE number 842885 (Why is no real title available?) | 1996-07-02 | Paper |
Staircase visibility and computation of kernels
Algorithmica | 1995-07-24 | Paper |
| scientific article; zbMATH DE number 753970 (Why is no real title available?) | 1995-05-11 | Paper |
| scientific article; zbMATH DE number 512835 (Why is no real title available?) | 1994-04-07 | Paper |
| scientific article; zbMATH DE number 176589 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176583 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177553 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 16594 (Why is no real title available?) | 1992-06-26 | Paper |
