default search action
Sven Schuierer
Person information
- affiliation: University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j17]Sven Schuierer, Léon-Charles Tranchevent
, Uwe Dengler, Yves Moreau
Large-scale benchmark of Endeavour using MetaCore maps. Bioinform. 26(15): 1922-1923 (2010)
2000 – 2009
- 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) - [c30]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) - [c29]Alejandro López-Ortiz, Sven Schuierer:
Online Parallel Heuristics and Robot Searching under the Competitive Framework. SWAT 2002: 260-269 - 2001
- [j11]Sven Schuierer:
Lower bounds in on-line geometric searching. Comput. Geom. 18(1): 37-53 (2001) - [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. Geom. 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)
1990 – 1999
- 1999
- [c28]Susanne Albers, Klaus Kursawe, Sven Schuierer:
Exploring Unknown Environments with Obstacles. SODA 1999: 842-843 - [c27]Sven Schuierer, Ines Semrau:
An Optimal Strategy for Searching in Unknown Streets. STACS 1999: 121-131 - [c26]Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Parallel Searching on m Rays. STACS 1999: 132-142 - [c25]Christoph A. Bröcker, Sven Schuierer:
Searching Rectilinear Streets Completely. WADS 1999: 98-109 - 1998
- [c24]Alejandro López-Ortiz, Sven Schuierer:
The exact cost of exploring streets with a cab. CCCG 1998 - [c23]Alejandro López-Ortiz, Sven Schuierer:
The Ultimate Strategy to Search on m Rays? COCOON 1998: 75-84 - [c22]Sven Schuierer:
On-Line Searching in Simple Polygons. Sensor Based Intelligent Robots 1998: 220-239 - 1997
- [c21]Alejandro López-Ortiz, Sven Schuierer:
Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons. SCG 1997: 445-447 - [c20]Sven Schuierer:
Lower Bounds in On-Line Geometric Searching. FCT 1997: 429-440 - [c19]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. Geom. Appl. 6(2): 205-226 (1996) - [j3]Sabine Hanke, Thomas Ottmann, Sven Schuierer:
The Edge-flipping Distance of Triangulations. J. Univers. Comput. Sci. 2(8): 570-579 (1996) - [c18]Kathleen Romanik, Sven Schuierer:
Optimal Robot Localization in Trees. SCG 1996: 264-273 - [c17]Sven Schuierer:
Efficient Robot Self-Localization in Simple Polygons. Intelligent Robots 1996: 129-146 - [c16]Alejandro López-Ortiz, Sven Schuierer:
Generalized Streets Revisited. ESA 1996: 546-558 - [c15]Alejandro López-Ortiz, Sven Schuierer:
Walking Streets Faster. SWAT 1996: 345-356 - 1995
- [j2]Sven Schuierer, Derick Wood:
Staircase Visibility and Computation of Kernels. Algorithmica 14(1): 1-26 (1995) - [c14]Amitava Datta
Competitive Searching in Polygons - Beyond Generalised Streets. ISAAC 1995: 32-41 - [c13]Jürgen Eckerle, Sven Schuierer:
Efficient Memory-Limited Graph Search. KI 1995: 101-112 - [c12]Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions. STACS 1995: 562-570 - [c11]Alejandro López-Ortiz, Sven Schuierer:
Going Home Through an Unknown Street. WADS 1995: 135-146 - 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) - [c10]Sven Schuierer:
An O(log N) Algorithm to Compute the Kernel of a Polygon. SWAT 1994: 314-325 - [c9]Sven Schuierer:
Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel. SWAT 1994: 326-337 - 1993
- [c8]Sven Schuierer, Derick Wood:
Generalized Kernels of Polygons with Holes. CCCG 1993: 222-227 - [c7]Sven Schuierer:
Rectilinear Path Queries in a Simple Rectilinear Polygon. STACS 1993: 282-293 - 1992
- [c6]Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking:
Restricted Orientation Computational Geometry. Data Structures and Efficient Algorithms 1992: 148-185 - [c5]Bengt J. Nilsson, Sven Schuierer:
Shortest m-Watchmen Routes for Histograms: The MinMax Case. ICCI 1992: 30-33 - 1991
- [b1]Sven Schuierer:
On generalized visibility. University of Freiburg, Freiburg im Breisgau, Germany, 1991, pp. 1-125 - [c4]Bengt J. Nilsson, Sven Schuierer:
Computing the Rectilinear Link Diameter of a Polygon. Workshop on Computational Geometry 1991: 203-215 - [c3]Sven Schuierer, Gregory J. E. Rawlins, Derick Wood:
A Generalization of Staircase Visibility. Workshop on Computational Geometry 1991: 277-287 - [c2]Bengt J. Nilsson, Sven Schuierer:
An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. WADS 1991: 249-260
1980 – 1989
- 1989
- [c1]Sven Schuierer:
Delauney Triangulations and the Radiosity Approach. Eurographics 1989
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: