The following pages link to Algorithms - ESA 2003 (Q5897266):
Displaying 12 items.
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- The red-blue pebble game on trees and DAGs with large input (Q2097342) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- External-memory exact and approximate all-pairs shortest-paths in undirected graphs (Q2921735) (← links)
- On Trade-Offs in External-Memory Diameter-Approximation (Q3512478) (← links)
- Design and Engineering of External Memory Traversal Algorithms for General Graphs (Q3637309) (← links)
- Via Detours to I/O-Efficient Shortest Paths (Q3644724) (← links)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299) (← links)
- I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths (Q5449557) (← links)
- Automata, Languages and Programming (Q5466457) (← links)