The following pages link to Jörg-Rüdiger Sack (Q170449):
Displaying 50 items.
- Finding paths with minimum shared edges (Q386426) (← links)
- \(\alpha\)-visibility (Q390160) (← links)
- Computing the configuration space for a robot on a mesh-of-prosessors (Q582158) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Fréchet distance with speed limits (Q621928) (← links)
- Obituary: Paul Erdős (1913-1996) (Q676061) (← links)
- A new model in firefighting theory (Q779236) (← links)
- (Q797278) (redirect page) (← links)
- An algorithm for merging heaps (Q797280) (← links)
- A characterization of heaps and its applications (Q918196) (← links)
- Note on the paper ``K-vertex guarding simple polygons'' (Q924091) (← links)
- Translation separability of sets of polygons (Q1100897) (← links)
- Bounds for min-max heaps (Q1101212) (← links)
- Algorithms for minimum length partitions of polygons (Q1102107) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- (Q1175649) (redirect page) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Generating binary trees at random (Q1186567) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- (Q1263992) (redirect page) (← links)
- Heuristics for optimum binary search trees and minimum weight triangulation problems (Q1263993) (← links)
- Uniform generation of forests of restricted height (Q1330666) (← links)
- Uniform generation of binary trees in parallel (Q1345659) (← links)
- Stage-graph representations (Q1363763) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- Pop-stacks in parallel (Q1606930) (← links)
- Approximating the integral Fréchet distance (Q1615637) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Path refinement in weighted regions (Q1799222) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- An \(\varOmega (n^3)\) lower bound on the number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures (Q2081620) (← links)
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures (Q2144452) (← links)
- Shortest paths among transient obstacles (Q2156288) (← links)
- A new model and algorithms in firefighting theory (Q2161254) (← links)
- Improved algorithms for partial curve matching (Q2249744) (← links)
- Weighted minimum backward Fréchet distance (Q2317859) (← links)
- Rectilinear shortest paths among transient obstacles (Q2327102) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- Shortest paths in time-dependent FIFO networks (Q2428679) (← links)
- Similarity of polygonal curves in the presence of outliers (Q2444314) (← links)
- Minimizing Walking Length in Map Matching (Q2798023) (← links)
- α-Visibility (Q2904538) (← links)
- Improved Approximation for Time-Dependent Shortest Paths (Q2920481) (← links)
- (Q3026346) (← links)
- Finding Paths with Minimum Shared Edges (Q3087983) (← links)
- Improved Algorithms for Partial Curve Matching (Q3092257) (← links)
- Approximation algorithms for geometric shortest path problems (Q3191995) (← links)
- (Q3484389) (← links)
- A Meeting Scheduling Problem Respecting Time and Space (Q3511415) (← links)
