The following pages link to (Q2978407):
Displaying 14 items.
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- On the complexity of minimum-link path problems (Q3132885) (← links)
- The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- Global Curve Simplification (Q5075813) (← links)
- Link-Length Minimization in Networks (Q5378793) (← links)
- Global optimization: On pathlengths in min-max graphs (Q5928206) (← links)