The following pages link to Sven Schuierer (Q175383):
Displaying 39 items.
- (Q232408) (redirect page) (← links)
- Visibility in semi-convex spaces (Q1375948) (← links)
- Searching and on-line recognition of star-shaped polygons. (Q1427863) (← links)
- Multiple-guard kernels of simple polygons (Q1818909) (← links)
- Optimal robot localization in trees (Q1854481) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- An optimal algorithm for the rectilinear link center of a rectilinear polygon (Q1917052) (← links)
- (Q2748152) (← links)
- (Q3024768) (← links)
- Online Parallel Heuristics and Robot Searching under the Competitive Framework (Q3046499) (← links)
- (Q3150180) (← links)
- (Q3973281) (← links)
- (Q4035759) (← links)
- (Q4035765) (← links)
- (Q4037424) (← links)
- (Q4218409) (← links)
- (Q4252368) (← links)
- (Q4281528) (← links)
- (Q4413802) (← links)
- Generalized streets revisited (Q4595514) (← links)
- Enumerating extreme points in higher dimensions (Q4596653) (← links)
- An Optimal Competitive Strategy for Walking in Streets (Q4651475) (← links)
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS (Q4682162) (← links)
- (Q4698691) (← links)
- (Q4862345) (← links)
- AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON (Q4889507) (← links)
- (Q4942049) (← links)
- An O(log log n) algorithm to compute the kernel of a polygon (Q5054771) (← links)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
- Walking streets faster (Q5054825) (← links)
- Lower bounds in on-line geometric searching metric searching (Q5055955) (← links)
- Going home through an unknown street (Q5057428) (← links)
- Position-independent near optimal searching and on-line recognition in star polygons (Q5096946) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)
- The ultimate strategy to search on \(m\) rays? (Q5941439) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- Exploring unknown environments with obstacles (Q5956837) (← links)
- Competitive searching in polygons—Beyond generalised streets (Q6487943) (← links)
