| 2004 |
|---|
| 45 | EE | Christian Icking,
Rolf Klein,
Elmar Langetepe,
Sven Schuierer,
Ines Semrau:
An Optimal Competitive Strategy for Walking in Streets.
SIAM J. Comput. 33(2): 462-486 (2004) |
| 44 | EE | Alejandro López-Ortiz,
Sven Schuierer:
On-line parallel heuristics, processor scheduling and robot searching under the competitive framework.
Theor. Comput. Sci. 310(1-3): 527-537 (2004) |
| 2003 |
|---|
| 43 | EE | Sven Schuierer:
A Lower Bound for Randomized Searching on m Rays.
Computer Science in Perspective 2003: 264-277 |
| 42 | EE | Alejandro López-Ortiz,
Sven Schuierer:
Searching and on-line recognition of star-shaped polygons.
Inf. Comput. 185(1): 66-88 (2003) |
| 2002 |
|---|
| 41 | EE | Alejandro López-Ortiz,
Sven Schuierer:
Online Parallel Heuristics and Robot Searching under the Competitive Framework.
SWAT 2002: 260-269 |
| 40 | EE | Susanne Albers,
Klaus Kursawe,
Sven Schuierer:
Exploring Unknown Environments with Obstacles.
Algorithmica 32(1): 123-143 (2002) |
| 39 | | Mikael Hammar,
Bengt J. Nilsson,
Sven Schuierer:
Improved Exploration of Rectilinear Polygons.
Nord. J. Comput. 9(1): 32-53 (2002) |
| 2001 |
|---|
| 38 | | Sven Schuierer:
Lower bounds in on-line geometric searching.
Comput. Geom. 18(1): 37-53 (2001) |
| 37 | | Mikael Hammar,
Bengt J. Nilsson,
Sven Schuierer:
Parallel searching on m rays.
Comput. Geom. 18(3): 125-139 (2001) |
| 36 | EE | Rudolf Fleischer,
Kathleen Romanik,
Sven Schuierer,
Gerhard Trippen:
Optimal Robot Localization in Trees.
Inf. Comput. 171(2): 224-247 (2001) |
| 35 | | Alejandro López-Ortiz,
Sven Schuierer:
Lower Bounds for Streets and Generalized Streets.
Int. J. Comput. Geometry Appl. 11(4): 401-421 (2001) |
| 34 | EE | Thomas Ottmann,
Sven Schuierer,
Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions.
Nord. J. Comput. 8(2): 179-192 (2001) |
| 33 | EE | Alejandro López-Ortiz,
Sven Schuierer:
The ultimate strategy to search on m rays?
Theor. Comput. Sci. 261(2): 267-295 (2001) |
| 1999 |
|---|
| 32 | EE | Susanne Albers,
Klaus Kursawe,
Sven Schuierer:
Exploring Unknown Environments with Obstacles.
SODA 1999: 842-843 |
| 31 | EE | Sven Schuierer,
Ines Semrau:
An Optimal Strategy for Searching in Unknown Streets.
STACS 1999: 121-131 |
| 30 | EE | Mikael Hammar,
Bengt J. Nilsson,
Sven Schuierer:
Parallel Searching on m Rays.
STACS 1999: 132-142 |
| 29 | EE | Christoph A. Bröcker,
Sven Schuierer:
Searching Rectilinear Streets Completely.
WADS 1999: 98-109 |
| 1998 |
|---|
| 28 | EE | Alejandro López-Ortiz,
Sven Schuierer:
The exact cost of exploring streets with a cab.
CCCG 1998 |
| 27 | EE | Alejandro López-Ortiz,
Sven Schuierer:
The Ultimate Strategy to Search on m Rays?
COCOON 1998: 75-84 |
| 26 | | Sven Schuierer:
On-Line Searching in Simple Polygons.
Sensor Based Intelligent Robots 1998: 220-239 |
| 1997 |
|---|
| 25 | | Sven Schuierer:
Lower Bounds in On-Line Geometric Searching.
FCT 1997: 429-440 |
| 24 | EE | Alejandro López-Ortiz,
Sven Schuierer:
Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons.
Symposium on Computational Geometry 1997: 445-447 |
| 23 | | Alejandro López-Ortiz,
Sven Schuierer:
Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons.
WADS 1997: 284-296 |
| 1996 |
|---|
| 22 | | Alejandro López-Ortiz,
Sven Schuierer:
Generalized Streets Revisited.
ESA 1996: 546-558 |
| 21 | | Sven Schuierer:
Efficient Robot Self-Localization in Simple Polygons.
Intelligent Robots 1996: 129-146 |
| 20 | | Alejandro López-Ortiz,
Sven Schuierer:
Walking Streets Faster.
SWAT 1996: 345-356 |
| 19 | EE | Kathleen Romanik,
Sven Schuierer:
Optimal Robot Localization in Trees.
Symposium on Computational Geometry 1996: 264-273 |
| 18 | | Bengt J. Nilsson,
Sven Schuierer:
An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon.
Comput. Geom. 6: 169-194 (1996) |
| 17 | | Sven Schuierer:
An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon.
Int. J. Comput. Geometry Appl. 6(2): 205-226 (1996) |
| 16 | | Sabine Hanke,
Thomas Ottmann,
Sven Schuierer:
The Edge-flipping Distance of Triangulations.
J. UCS 2(8): 570-579 (1996) |
| 1995 |
|---|
| 15 | | Amitava Datta,
Christoph A. Hipke,
Sven Schuierer:
Competitive Searching in Polygons - Beyond Generalised Streets.
ISAAC 1995: 32-41 |
| 14 | | Jürgen Eckerle,
Sven Schuierer:
Efficient Memory-Limited Graph Search.
KI 1995: 101-112 |
| 13 | | Thomas Ottmann,
Sven Schuierer,
Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions.
STACS 1995: 562-570 |
| 12 | | Alejandro López-Ortiz,
Sven Schuierer:
Going Home Through an Unknown Street.
WADS 1995: 135-146 |
| 11 | | Sven Schuierer,
Derick Wood:
Staircase Visibility and Computation of Kernels.
Algorithmica 14(1): 1-26 (1995) |
| 1994 |
|---|
| 10 | | Sven Schuierer:
An O(log N) Algorithm to Compute the Kernel of a Polygon.
SWAT 1994: 314-325 |
| 9 | | Sven Schuierer:
Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel.
SWAT 1994: 326-337 |
| 8 | | Sven Schuierer:
An O(log log n) Time Algorithm to Compute the Kernel of a Polygon.
Nord. J. Comput. 1(4): 458-474 (1994) |
| 1993 |
|---|
| 7 | | Sven Schuierer,
Derick Wood:
Generalized Kernels of Polygons with Holes.
CCCG 1993: 222-227 |
| 6 | | Sven Schuierer:
Rectilinear Path Queries in a Simple Rectilinear Polygon.
STACS 1993: 282-293 |
| 1992 |
|---|
| 5 | | Bengt J. Nilsson,
Thomas Ottmann,
Sven Schuierer,
Christian Icking:
Restricted Orientation Computational Geometry.
Data Structures and Efficient Algorithms 1992: 148-185 |
| 4 | | Bengt J. Nilsson,
Sven Schuierer:
Shortest m-Watchmen Routes for Histograms: The MinMax Case.
ICCI 1992: 30-33 |
| 1991 |
|---|
| 3 | | Bengt J. Nilsson,
Sven Schuierer:
An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon.
WADS 1991: 249-260 |
| 2 | | Bengt J. Nilsson,
Sven Schuierer:
Computing the Rectilinear Link Diameter of a Polygon.
Workshop on Computational Geometry 1991: 203-215 |
| 1 | | Sven Schuierer,
Gregory J. E. Rawlins,
Derick Wood:
A Generalization of Staircase Visibility.
Workshop on Computational Geometry 1991: 277-287 |
