- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| j17 |      | Sven Schuierer, Léon-Charles Tranchevent, Uwe Dengler, Yves Moreau: Large-scale benchmark of Endeavour using MetaCore maps. Bioinformatics 26(15): 1922-1923 (2010) |
| 2004 | ||
| j16 | | 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) |
| j15 | | 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 | ||
| j14 | | Alejandro López-Ortiz, Sven Schuierer: Searching and on-line recognition of star-shaped polygons. Inf. Comput. 185(1): 66-88 (2003) |
| c29 | | Sven Schuierer: A Lower Bound for Randomized Searching on m Rays. Computer Science in Perspective 2003: 264-277 |
| 2002 | ||
| j13 | | Susanne Albers, Klaus Kursawe, Sven Schuierer: Exploring Unknown Environments with Obstacles. Algorithmica 32(1): 123-143 (2002) |
| j12 |  | Mikael Hammar, Bengt J. Nilsson, Sven Schuierer: Improved Exploration of Rectilinear Polygons. Nord. J. Comput. 9(1): 32-53 (2002) |
| c28 | | Alejandro López-Ortiz, Sven Schuierer: Online Parallel Heuristics and Robot Searching under the Competitive Framework. SWAT 2002: 260-269 |
| 2001 | ||
| j11 | | |
| j10 | | Mikael Hammar, Bengt J. Nilsson, Sven Schuierer: Parallel searching on m rays. Comput. Geom. 18(3): 125-139 (2001) |
| j9 | | Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen: Optimal Robot Localization in Trees. Inf. Comput. 171(2): 224-247 (2001) |
| j8 | | Alejandro López-Ortiz, Sven Schuierer: Lower Bounds for Streets and Generalized Streets. Int. J. Comput. Geometry Appl. 11(4): 401-421 (2001) |
| j7 | | Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi: Enumerating Extreme Points in Higher Dimensions. Nord. J. Comput. 8(2): 179-192 (2001) |
| j6 | | Alejandro López-Ortiz, Sven Schuierer: The ultimate strategy to search on m rays? Theor. Comput. Sci. 261(2): 267-295 (2001) |
| 1999 | ||
| c27 | | Susanne Albers, Klaus Kursawe, Sven Schuierer: Exploring Unknown Environments with Obstacles. SODA 1999: 842-843 |
| c26 | | Sven Schuierer, Ines Semrau: An Optimal Strategy for Searching in Unknown Streets. STACS 1999: 121-131 |
| c25 | | |
| c24 | | |
| 1998 | ||
| c23 | | |
| c22 | | Alejandro López-Ortiz, Sven Schuierer: The Ultimate Strategy to Search on m Rays? COCOON 1998: 75-84 |
| c21 | | |
| 1997 | ||
| c20 | | 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 |
| c19 | | |
| c18 | | Alejandro López-Ortiz, Sven Schuierer: Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons. WADS 1997: 284-296 |
| 1996 | ||
| j5 | | Bengt J. Nilsson, Sven Schuierer: An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon. Comput. Geom. 6: 169-194 (1996) |
| j4 | | 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) |
| j3 | | Sabine Hanke, Thomas Ottmann, Sven Schuierer: The Edge-flipping Distance of Triangulations. J. UCS 2(8): 570-579 (1996) |
| c17 | | Kathleen Romanik, Sven Schuierer: Optimal Robot Localization in Trees. Symposium on Computational Geometry 1996: 264-273 |
| c16 | | Sven Schuierer: Efficient Robot Self-Localization in Simple Polygons. Intelligent Robots 1996: 129-146 |
| c15 | | |
| c14 | | |
| 1995 | ||
| j2 | | Sven Schuierer, Derick Wood: Staircase Visibility and Computation of Kernels. Algorithmica 14(1): 1-26 (1995) |
| c13 | | Amitava Datta, Christoph A. Hipke, Sven Schuierer: Competitive Searching in Polygons - Beyond Generalised Streets. ISAAC 1995: 32-41 |
| c12 | | |
| c11 | | Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi: Enumerating Extreme Points in Higher Dimensions. STACS 1995: 562-570 |
| c10 | | |
| 1994 | ||
| j1 | | Sven Schuierer: An O(log log n) Time Algorithm to Compute the Kernel of a Polygon. Nord. J. Comput. 1(4): 458-474 (1994) |
| c9 | | |
| c8 | | Sven Schuierer: Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel. SWAT 1994: 326-337 |
| 1993 | ||
| c7 | | |
| c6 | | |
| 1992 | ||
| c5 | | Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking: Restricted Orientation Computational Geometry. Data Structures and Efficient Algorithms 1992: 148-185 |
| c4 | | Bengt J. Nilsson, Sven Schuierer: Shortest m-Watchmen Routes for Histograms: The MinMax Case. ICCI 1992: 30-33 |
| 1991 | ||
| c3 | | Bengt J. Nilsson, Sven Schuierer: Computing the Rectilinear Link Diameter of a Polygon. Workshop on Computational Geometry 1991: 203-215 |
| c2 | | Sven Schuierer, Gregory J. E. Rawlins, Derick Wood: A Generalization of Staircase Visibility. Workshop on Computational Geometry 1991: 277-287 |
| c1 | | Bengt J. Nilsson, Sven Schuierer: An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. WADS 1991: 249-260 |
Colors in the list of coauthors
Last update Fri May 24 14:55:33 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page