Active Bibliography

13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
1 I/O-Optimal Planar Embedding Using Graph Separators – Norbert Zeh - 2001
33 On External Memory MST, SSSP and Multi-way Planar Graph Separation (Extended Abstract) – Lars Arge, Gerth Stølting Brodal, Laura Toma - 2000
24 On external-memory MST, SSSP and multi-way planar graph separation – Lars Arge, Gerth Stølting Brodal, Laura Toma - 2000
1 I/O-Optimal Algorithms for Outerplanar Graphs – Anil Maheshwari, Norbert Zeh - 2001
I/O-Efficient Algorithms on Near-Planar Graphs – Herman Haverkort, Laura Toma, L. Arge - 2011
31 I/O-Efficient Algorithms for Problems on Grid-based Terrains (Extended Abstract) – Lars Arge, Laura Toma, Jeffrey Scott Vitter - 2000
79 External Memory Data Structures – Lars Arge - 2001
6 I/O-efficient strong connectivity and depth-first search for directed planar graphs – Lars Arge - 2003
2 I/O-efficient shortest path queries in geometric spanners – Anil Maheshwari, Michiel Smid - 2001
64 Cache-oblivious priority queue and graph algorithm applications – Lars Arge, Bryan Holland-minkley, Michael A. Bender, J. Ian Munro, Erik D. Demaine - 2002
1 External Data Structures for Shortest Path Queries on Planar Digraphs – Lars Arge, Laura Toma
9 Bulk Synchronous Parallel Algorithms for the External Memory Model – Frank Dehne, Wolfgang Dittrich, David Hutchinson, Anil Maheshwari - 2002
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
24 On External-Memory Planar Depth First Search – Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
Large Graph Sampling and Visualization – Ryan Kelly, et al. - 2003
47 External-memory breadth-first search with sublinear I/O – Kurt Mehlhorn, Ulrich Meyer - 2002
5 An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms – Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro - 2007