The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sven Schuierer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  46. Large-scale benchmark of Endeavour using MetaCore maps. [Citation Graph (, )][DBLP]


Search in 0.396secs, Finished in 0.398secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002