I/o-efficient algorithms for shortest path related problems

I/O-efficient topological sorting of planar DAGs

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

I/O-efficient algorithms for computing planar geometric spanners

Computational Geometry: Theory and Applications

Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science

A near linear time approximation scheme for Steiner tree among obstacles in the plane

Computational Geometry: Theory and Applications

Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures

Compact oracles for approximate distances around obstacles in the plane

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

Journal of Discrete Algorithms

External-memory algorithms and data structures

Algorithms and theory of computation handbook

STXXL: standard template library for XXL data sets

ESA'05 Proceedings of the 13th annual European conference on Algorithms

A near linear time approximation scheme for steiner tree among obstacles in the plane

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures