The following pages link to Rolf Klein (Q166235):
Displaying 25 items.
- An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. (Q3132855) (← links)
- Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
- New Results on Visibility in Simple Polygons (Q3183466) (← links)
- Chords halving the area of a planar convex set (Q3422482) (← links)
- A Meeting Scheduling Problem Respecting Time and Space (Q3511415) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard (Q3595495) (← links)
- (Q3601548) (← links)
- (Q3619930) (← links)
- Competitive Online Approximation of the Optimal Search Ratio (Q3631895) (← links)
- (Q3777461) (← links)
- (Q3785961) (← links)
- (Q3789085) (← links)
- (Q3794819) (← links)
- (Q3795194) (← links)
- (Q3795223) (← links)
- Direct dominance of points (Q3802650) (← links)
- (Q3824965) (← links)
- On the path length of binary trees (Q3829055) (← links)
- (Q3833670) (← links)
- Moving an angle around a region (Q5054844) (← links)
- Partially Walking a Polygon (Q5091053) (← links)
- Algorithms and Computation (Q5191653) (← links)
- The geometric dilation of three points (Q5213194) (← links)
- A Fire Fighter's Problem. (Q5368727) (← links)
