Your search returned the following 5 documents:

5. I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
   Ulrich Meyer and Norbert Zeh
   In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, 2006, 540-551
   
4. Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
   Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, and Norbert Zeh
   In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, Humlebaek, Denmark, 2004, 480-492
   
3. On External-Memory Planar Depth First Search
   Lars Arge, Ulrich Meyer, Laura Toma, and Norbert Zeh
   In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), Providence, Rhode Island, USA, August, 8 - August, 10, 2001, 471-482
   
2. On external-memory planar depth first search
   Lars Arge, Ulrich Meyer, Laura Toma, and Norbert Zeh
   Journal of Graph Algorithms and Applications 7 (2): 105-129, 2003
   
1. I/O-Efficient Undirected Shortest Paths
   Ulrich Meyer and Norbert Zeh
   In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, September, 16 - September, 19, 2003, 434-445