Sven Schuierer

Léon-Charles Tranchevent

Uwe Dengler

Yves Moreau

Bioinform., 2010

2004

On-line parallel heuristics, processor scheduling and robot searching under the competitive framework.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

An Optimal Competitive Strategy for Walking in Streets.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

2003

Searching and on-line recognition of star-shaped polygons.

[BibT_eX]

[DOI]

Inf. Comput., 2003

A Lower Bound for Randomized Searching on m Rays.

[BibT_eX]

[DOI]

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

Improved Exploration of Rectilinear Polygons.

[BibT_eX]

Mikael Hammar

Nord. J. Comput., 2002

Exploring Unknown Environments with Obstacles.

[BibT_eX]

[DOI]

Susanne Albers

Klaus Kursawe

Algorithmica, 2002

Online Parallel Heuristics and Robot Searching under the Competitive Framework.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

2001

The ultimate strategy to search on m rays?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Enumerating Extreme Points in Higher Dimensions.

[BibT_eX]

[DOI]

Thomas Ottmann

Subbiah Soundaralakshmi

Nord. J. Comput., 2001

Lower Bounds for Streets and Generalized Streets.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

Optimal Robot Localization in Trees.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Lower bounds in on-line geometric searching.

[BibT_eX]

[DOI]

Comput. Geom., 2001

Parallel searching on m rays.

[BibT_eX]

[DOI]

Mikael Hammar

Comput. Geom., 2001

1999

Searching Rectilinear Streets Completely.

[BibT_eX]

[DOI]

Christoph A. Bröcker

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

An Optimal Strategy for Searching in Unknown Streets.

[BibT_eX]

[DOI]

Ines Semrau

Proceedings of the STACS 99, 1999

1998

On-Line Searching in Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28, 1998

The exact cost of exploring streets with a cab.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

The Edge-flipping Distance of Triangulations.

[BibT_eX]

[DOI]

Sabine Hanke

Thomas Ottmann

J. Univers. Comput. Sci., 1996

An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1996

An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Walking Streets Faster.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Generalized Streets Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1996

Efficient Robot Self-Localization in Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Robots: Sensing, 1996

Optimal Robot Localization in Trees.

[BibT_eX]

[DOI]

Kathleen Romanik

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Staircase Visibility and Computation of Kernels.

[BibT_eX]

[DOI]

Derick Wood

Algorithmica, 1995

Going Home Through an Unknown Street.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Efficient Memory-Limited Graph Search.

[BibT_eX]

[DOI]

Jürgen Eckerle

Proceedings of the KI-95: Advances in Artificial Intelligence, 1995

Competitive Searching in Polygons - Beyond Generalised Streets.

[BibT_eX]

[DOI]

Amitava Datta

Christoph A. Hipke

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

An O(log log n) Time Algorithm to Compute the Kernel of a Polygon.

[BibT_eX]

Nord. J. Comput., 1994

Computing the L<sub>1</sub>-Diameter and Center of a Simple Rectilinear Polygon in Parallel.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

An O(log N) Algorithm to Compute the Kernel of a Polygon.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

1993

Rectilinear Path Queries in a Simple Rectilinear Polygon.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

Generalized Kernels of Polygons with Holes.

[BibT_eX]

Derick Wood

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Shortest <i>m</i>-Watchmen Routes for Histograms: The MinMax Case.

[BibT_eX]

Proceedings of the Computing and Information, 1992

Restricted Orientation Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

On generalized visibility.

[BibT_eX]

[DOI]

PhD thesis, 1991

An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1991

A Generalization of Staircase Visibility.

[BibT_eX]

[DOI]

Gregory J. E. Rawlins

Derick Wood

Proceedings of the Computational Geometry, 1991

Computing the Rectilinear Link Diameter of a Polygon.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, 1991

1989

Delauney Triangulations and the Radiosity Approach.

[BibT_eX]

[DOI]