The following pages link to (Q5002738):
Displaying 8 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces (Q3597878) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- (Q5091157) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)