The following pages link to Jörg-Rüdiger Sack (Q170449):
Displaying 18 items.
- Finding paths with minimum shared edges (Q386426) (← links)
- \(\alpha\)-visibility (Q390160) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Fréchet distance with speed limits (Q621928) (← links)
- An algorithm for merging heaps (Q797280) (← links)
- Note on the paper ``K-vertex guarding simple polygons'' (Q924091) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Uniform generation of binary trees in parallel (Q1345659) (← links)
- Approximating the integral Fréchet distance (Q1615637) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- Improved Algorithms for Partial Curve Matching (Q3092257) (← links)
- Shortest Path Queries in Polygonal Domains (Q3511429) (← links)
- Finding Maximum Edge Bicliques in Convex Bipartite Graphs (Q3578311) (← links)
- Generating triangulations at random (Q4876039) (← links)
- Ray shooting from convex ranges (Q5929310) (← links)
- Approximating shortest paths on weighted polyhedral surfaces (Q5940611) (← links)
