The following pages link to STACS 2005 (Q5710703):
Displaying 5 items.
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Truly Optimal Euclidean Spanners (Q5071083) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)