Norbert Zeh - Publications

Journal papers

U. Meyer and N. Zeh. "I/O-Efficient Shortest Path Algorithms for Undirected Graphs with Random and Bounded Edge Lengths." Submitted, 2008.

P. Bose, P. Carmi, M. Couture, A. Maheshwari, M. Smid, and N. Zeh. "Geometric Spanners with Small Chromatic Number." Computational Geometry: Theory and Applications, 42(2):134–146, 2009.

A. Maheshwari and N. Zeh. "I/O-Efficient Planar Separators." SIAM Journal on Computing, 38(3):767–801, 2008.

A. Maheshwari, M. Smid, and N. Zeh. "I/O-Efficient Algorithms for Computing Planar Geometric Spanners." Computational Geometry: Theory and Applications, 40(3):252–271, 2008.

O. Baltzer, A. Rau-Chaplin, and N. Zeh. "Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions." Journal of Digital Information Management, 5(4):180–190, 2007.

A. Maheshwari and N. Zeh. "I/O-Efficient Algorithms for Graphs of Bounded Treewidth." Algorithmica, DOI 10.1007/s00453-007-9131-5, 2007.

R. Nowakowski and N. Zeh. "Boundary-Optimal Triangulation Flooding." International Journal of Computational Geometry and Applications, 16(2-3):271–290, 2006.

S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh. "I/O-Efficient Well-Separated Pair Decomposition and its Applications." Algorithmica, 45(4):585–614, 2006.

A. Maheshwari and N. Zeh. "I/O-Efficient Algorithms for Outerplanar Graphs." Journal of Graph Algorithms and Applications, 8(1):47–87, 2004.

P. Bose, A. Maheshwari, G. Narasimhan, M. Smid, and N. Zeh. "Approxmating Geometric Bottleneck Shortest Paths." Computational Geometry: Theory and Applications, 29:233--249, 2004.

L. Arge, U. Meyer, L. Toma, and N. Zeh. "On External-Memory Planar Depth First Search." Journal of Graph Algorithms and Applications, 7(2):105–129, 2003.

D. Hutchinson, A. Maheshwari, and N. Zeh. "An External Memory Data Structure for Shortest Path Queries." Discrete Applied Mathematics, 126(1):55–82, 2003.

Conference papers

A. Cosgaya and N. Zeh. "A Faster Heuristic for Strong Connectivity of Massive Graphs." Submitted, 2009.

P. Afshani, C. Hamilton, and N. Zeh. "Cache-Oblivious Range Reporting With Optimal Queries Requires Superlinear Space." Submitted, 2008.

P. Afshani, C. Hamilton, and N. Zeh. "A General Approach for Cache-Oblivious Range Reporting and Approximate Range Counting." Submitted, 2008.

L. Arge, T. Mølhave, and N. Zeh. "Cache-Oblivious Red-Blue Line Segment Intersection." In Proceedings of the 16th European Symposium on Algorithms (ESA 2008), pp. 88–99, 2008.

G. Hickey, P. Carmi, A. Maheshwari, and N. Zeh. "A Polynomial-Time Approximation Scheme for Noah's Ark Problem." In Proceedings of the 8th International Workshop on Algorithms in Bioniformatics (WABI 2008), pp. 76–86, 2008.

P. Bose, P. Carmi, M. Couture, A. Maheshwari, M. Smid, and N. Zeh. "Geometric Spanners with Small Chromatic Number." In Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA 2007), pp. 75–88, 2007.

J.-P. Deveaux, A. Rau-Chaplin, and N. Zeh. "Adaptive Tuple Differential Coding." In Proceedings of the 18th International Conference on Database and Expert Systems Applications (DEXA 2007), pp. 109–119, 2007.

A. Cosgaya-Lozano, A. Rau-Chaplin, and N. Zeh. "Parallel Computation of Skyline Queries." In Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (HPCS 2007), 2007.

L. Allulli, P. Lichodzijewski, and N. Zeh. "A Faster Cache-Oblivious Shortest-Path Algorithm for Undirected Graphs with Bounded Edge Lengths." In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 910–919, 2007.

A.E. Scott, U. Stege, and N. Zeh. "Politician's Firefighting." In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), pp. 608–617, 2006.

U. Meyer and N. Zeh. "I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths." In Proceedings of the 14th European Symposium on Algorithms (ESA 2006), pp. 540–551, 2006.

L. Arge and N. Zeh. "Simple and Semi-Dynamic Structures for Cache-Oblivious Planar Orthogonal Range Searching." In Proceedings of the 22nd ACM Symposium on Computational Geometry (SCG 2006), pp. 158–166, 2006.

L. Arge, A. Danner, H. Haverkort, and N. Zeh. "I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrain Models." In Progress in Spatial Data Handling: 12th International Symposium on Spatial Data Handling (SDH 2006), pp. 825–844. Springer-Verlag, 2006.

H. Jampala and N. Zeh. "Cache-Oblivious Planar Shortest-Paths." In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), Lecture Notes in Computer Science, Vol. 3580, pp. 563–575. © Springer-Verlag, 2005.

R. Nowakowski and N. Zeh. "Boundary-Optimal Triangulation Flooding." In Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC 2004), Lecture Notes in Computer Science, Vol. 3341, pp. 717–728. © Springer-Verlag, 2004. (PDF, PS.GZ)

N. Zeh. "Connectivity of Graphs Under Edge Flips." In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), Lecture Notes in Computer Science, Vol. 3111, pp. 161–173. © Springer-Verlag, 2004. (PDF, PS.GZ)

G. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. "Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths." In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), Lecture Notes in Computer Science, Vol. 3111, pp. 480–492. © Springer-Verlag, 2004. (PDF, PS.GZ)

U. Meyer and N. Zeh. "I/O-Efficient Undirected Shortest Paths." In Proceedings of the 11th Annual European Symposium on Algorithms (ESA 2003), Lecture Notes in Computer Science, Vol. 2832, pp. 434–445. © Springer-Verlag, 2003. (PDF, PS.GZ)

L. Arge and N. Zeh. "I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs." In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 261–270, 2003. (PDF, PS.GZ)

L. Arge, L. Toma, and N. Zeh. "I/O-Efficient Topological Sorting of Planar DAGs." In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2003), pp. 85–93, 2003. (PDF, PS.GZ)

P. Bose, A. Maheshwari, G. Narasimhan, M. Smid, and N. Zeh. "Approxmating Geometric Bottleneck Shortest Paths." In Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003), Lecture Notes in Computer Science, Vol. 2607, pp. 38–49. © Springer-Verlag, 2003.

A. Maheshwari, J. Vahrenhold, and N. Zeh. "On Reverse Nearest Neighbor Queries." In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG 2002), pp. 128–132, 2002.

A. Maheshwari and N. Zeh. "I/O-Optimal Algorithms for Planar Graphs Using Separators." In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp.372–381, 2002. (PDF, PS.GZ)

T. Lukovszki, A. Maheshwari, and N. Zeh. "I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems." In Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS 2001), Lecture Notes in Computer Science, Vol. 2245, pp. 244–255. © Springer-Verlag, 2001. (PDF, PS.GZ)

L. Arge, U. Meyer, L. Toma, and N. Zeh. "On External-Memory Planar Depth First Search." In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, Vol. 2125, pp. 471–482. © Springer-Verlag, 2001. (PDF, PS.GZ)

A. Maheshwari, M. Smid, and N. Zeh. "I/O-Efficient Shortest-Path Queries in Geometric Spanners." In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, Vol. 2125, pp. 287–299. © Springer-Verlag, 2001. (PDF, PS.GZ)

N. Zeh and N. Santoro. "On Finding Minimum Deadly Sets for Directed Networks." In Proceedings of the 8th International Colloquium on Structural Informationand Communication Complexity (SIROCCO 2001), pp. 351–365, 2001. (PDF, PS.GZ)

A. Maheshwari and N. Zeh. "I/O-Efficient Algorithms for Bounded Treewidth Graphs." In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 89–90, 2001. (PDF, PS.GZ)

S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh. "I/O-Efficient Well-Separated Pair Decomposition and its Applications." In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), Lecture Notes in Computer Science, Vol. 1879, pp. 220–231. © Springer-Verlag, 2000. (PDF, PS.GZ)

A. Maheshwari and N. Zeh. "External Memory Algorithms for Outerplanar Graphs." In Proceedings of the 10th Annual Sumposium on Algorithms and Computation (ISAAC 99), Lecture Notes in Computer Science, Vol. 1741, pp. 307–316. © Springer-Verlag, 1999. (PDF, PS.GZ)

D. Hutchinson, A. Maheshwari, and N. Zeh. "An External Memory Data Structure for Shortest Path Queries." In Proceedings of the 5th Annual Combinatorics and Computing Conference (COCOON 99), Lecture Notes in Computer Science, Vol. 1627, pp. 51–60. © Springer-Verlag, 1999. (PDF, PS.GZ)

Technical reports

U. Meyer and N. Zeh. "I/O-Efficient Undirected Shortest Paths with Unbounded Edge Weights." Technical Report CS-2006-04, Faculty of Computer Science, Dalhousie University, Halifax, 2006.

N. Zeh. "Improved and More Realistic Algorithms for Maximal Graph Connectivity." Technical Report CS-2004-04, Faculty of Computer Science, Dalhousie University, Halifax, 2004.

G. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. "Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths." BRICS Report RS-04-2, Aarhus, Denmark, 2004.

N. Zeh. "Connecivity of Graphs Under Edge Flips." Technical Report CS-2003-07, Faculty of Computer Science, Dalhousie University, Halifax, 2003.

N. Zeh. "I/O-Efficient Planar Embedding Using Graph Separators." Technical Report TR-01-07, School of Computer Science, Carleton University, Ottawa, 2001. (PDF, PS.GZ)

N. Zeh. "I/O-Efficient Planar Separators and Applications." Technical Report TR-01-02, School of Computer Science, Carleton University, Ottawa, 2001. (PDF, PS.GZ)

D. Hutchinson, A. Maheshwari, and N. Zeh. "An External Memory Data Structure for Shortest Path Queries." Jenaer Schriften zur Mathematik und Informatik 99/11, Friedrich-Schiller-Universität Jena, 1999.

N. Zeh, J. Dietel, and H.-D. Hecker. "Computing the Union of Simple Polygons in O(log n) Time Using O(n²) Processors." Forschungsergebnisse Math/Inf/97/12, Friedrich-Schiller-Universität Jena, 1997.

Theses

N. Zeh. I/O-Efficient Algorithms for Shortest Path Related Problems. Ph.D. thesis, School of Computer Science, Carleton University, Ottawa, Canada, April 2002. (PDF, PS.GZ)

N. Zeh. An External-Memory Data Structure for Shortest Path Queries. Diplomarbeit, Friedrich-Schiller-Universität Jena, November 1998. (PDF, PS.GZ)

Book chapters

L. Arge and N. Zeh. "I/O-Efficient Algorithms." In Handbook of Algorithms and Theory of Computation, 2nd edition, CRC Press, to appear.

N. Zeh. "I/O-Model." In Encyclopedia of Algorithms, Springer-Verlag, 2008.

N. Zeh. "I/O-Efficient Graph Algorithms." In EEF Summer School on Massive Data Sets. To appear.

A. Maheshwari and N. Zeh. "A Survey of Techniques for Designing I/O-Efficient Algorithms." In Algorithms for Memory Hierarchies, Lecture Notes in Computer Science, Vol. 2625, pp. 36–61. © Springer-Verlag, 2003.

L. Toma and N. Zeh. "I/O-Efficient Algoriths for Sparse Graphs." In Algorithms for Memory Hierarchies, Lecture Notes in Computer Science, Vol. 2625, pp. 85–109. © Springer-Verlag, 2003.

Norbert Zeh	Publications
Home Teaching CSCI 3110 CSCI 6104 Grading Policies Office hours Research Interests Thesis topics Publications Journal papers Conference papers Technical reports Theses Book chapters Curriculum vitae	Journal papers U. Meyer and N. Zeh. "I/O-Efficient Shortest Path Algorithms for Undirected Graphs with Random and Bounded Edge Lengths." Submitted, 2008. P. Bose, P. Carmi, M. Couture, A. Maheshwari, M. Smid, and N. Zeh. "Geometric Spanners with Small Chromatic Number." Computational Geometry: Theory and Applications, 42(2):134–146, 2009. A. Maheshwari and N. Zeh. "I/O-Efficient Planar Separators." SIAM Journal on Computing, 38(3):767–801, 2008. A. Maheshwari, M. Smid, and N. Zeh. "I/O-Efficient Algorithms for Computing Planar Geometric Spanners." Computational Geometry: Theory and Applications, 40(3):252–271, 2008. O. Baltzer, A. Rau-Chaplin, and N. Zeh. "Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions." Journal of Digital Information Management, 5(4):180–190, 2007. A. Maheshwari and N. Zeh. "I/O-Efficient Algorithms for Graphs of Bounded Treewidth." Algorithmica, DOI 10.1007/s00453-007-9131-5, 2007. R. Nowakowski and N. Zeh. "Boundary-Optimal Triangulation Flooding." International Journal of Computational Geometry and Applications, 16(2-3):271–290, 2006. S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh. "I/O-Efficient Well-Separated Pair Decomposition and its Applications." Algorithmica, 45(4):585–614, 2006. A. Maheshwari and N. Zeh. "I/O-Efficient Algorithms for Outerplanar Graphs." Journal of Graph Algorithms and Applications, 8(1):47–87, 2004. P. Bose, A. Maheshwari, G. Narasimhan, M. Smid, and N. Zeh. "Approxmating Geometric Bottleneck Shortest Paths." Computational Geometry: Theory and Applications, 29:233--249, 2004. L. Arge, U. Meyer, L. Toma, and N. Zeh. "On External-Memory Planar Depth First Search." Journal of Graph Algorithms and Applications, 7(2):105–129, 2003. D. Hutchinson, A. Maheshwari, and N. Zeh. "An External Memory Data Structure for Shortest Path Queries." Discrete Applied Mathematics, 126(1):55–82, 2003. Conference papers A. Cosgaya and N. Zeh. "A Faster Heuristic for Strong Connectivity of Massive Graphs." Submitted, 2009. P. Afshani, C. Hamilton, and N. Zeh. "Cache-Oblivious Range Reporting With Optimal Queries Requires Superlinear Space." Submitted, 2008. P. Afshani, C. Hamilton, and N. Zeh. "A General Approach for Cache-Oblivious Range Reporting and Approximate Range Counting." Submitted, 2008. L. Arge, T. Mølhave, and N. Zeh. "Cache-Oblivious Red-Blue Line Segment Intersection." In Proceedings of the 16th European Symposium on Algorithms (ESA 2008), pp. 88–99, 2008. G. Hickey, P. Carmi, A. Maheshwari, and N. Zeh. "A Polynomial-Time Approximation Scheme for Noah's Ark Problem." In Proceedings of the 8th International Workshop on Algorithms in Bioniformatics (WABI 2008), pp. 76–86, 2008. P. Bose, P. Carmi, M. Couture, A. Maheshwari, M. Smid, and N. Zeh. "Geometric Spanners with Small Chromatic Number." In Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA 2007), pp. 75–88, 2007. J.-P. Deveaux, A. Rau-Chaplin, and N. Zeh. "Adaptive Tuple Differential Coding." In Proceedings of the 18th International Conference on Database and Expert Systems Applications (DEXA 2007), pp. 109–119, 2007. A. Cosgaya-Lozano, A. Rau-Chaplin, and N. Zeh. "Parallel Computation of Skyline Queries." In Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (HPCS 2007), 2007. L. Allulli, P. Lichodzijewski, and N. Zeh. "A Faster Cache-Oblivious Shortest-Path Algorithm for Undirected Graphs with Bounded Edge Lengths." In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 910–919, 2007. A.E. Scott, U. Stege, and N. Zeh. "Politician's Firefighting." In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), pp. 608–617, 2006. U. Meyer and N. Zeh. "I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths." In Proceedings of the 14th European Symposium on Algorithms (ESA 2006), pp. 540–551, 2006. L. Arge and N. Zeh. "Simple and Semi-Dynamic Structures for Cache-Oblivious Planar Orthogonal Range Searching." In Proceedings of the 22nd ACM Symposium on Computational Geometry (SCG 2006), pp. 158–166, 2006. L. Arge, A. Danner, H. Haverkort, and N. Zeh. "I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrain Models." In Progress in Spatial Data Handling: 12th International Symposium on Spatial Data Handling (SDH 2006), pp. 825–844. Springer-Verlag, 2006. H. Jampala and N. Zeh. "Cache-Oblivious Planar Shortest-Paths." In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), Lecture Notes in Computer Science, Vol. 3580, pp. 563–575. © Springer-Verlag, 2005. R. Nowakowski and N. Zeh. "Boundary-Optimal Triangulation Flooding." In Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC 2004), Lecture Notes in Computer Science, Vol. 3341, pp. 717–728. © Springer-Verlag, 2004. (PDF, PS.GZ) N. Zeh. "Connectivity of Graphs Under Edge Flips." In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), Lecture Notes in Computer Science, Vol. 3111, pp. 161–173. © Springer-Verlag, 2004. (PDF, PS.GZ) G. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. "Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths." In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), Lecture Notes in Computer Science, Vol. 3111, pp. 480–492. © Springer-Verlag, 2004. (PDF, PS.GZ) U. Meyer and N. Zeh. "I/O-Efficient Undirected Shortest Paths." In Proceedings of the 11th Annual European Symposium on Algorithms (ESA 2003), Lecture Notes in Computer Science, Vol. 2832, pp. 434–445. © Springer-Verlag, 2003. (PDF, PS.GZ) L. Arge and N. Zeh. "I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs." In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 261–270, 2003. (PDF, PS.GZ) L. Arge, L. Toma, and N. Zeh. "I/O-Efficient Topological Sorting of Planar DAGs." In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2003), pp. 85–93, 2003. (PDF, PS.GZ) P. Bose, A. Maheshwari, G. Narasimhan, M. Smid, and N. Zeh. "Approxmating Geometric Bottleneck Shortest Paths." In Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003), Lecture Notes in Computer Science, Vol. 2607, pp. 38–49. © Springer-Verlag, 2003. A. Maheshwari, J. Vahrenhold, and N. Zeh. "On Reverse Nearest Neighbor Queries." In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG 2002), pp. 128–132, 2002. A. Maheshwari and N. Zeh. "I/O-Optimal Algorithms for Planar Graphs Using Separators." In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp.372–381, 2002. (PDF, PS.GZ) T. Lukovszki, A. Maheshwari, and N. Zeh. "I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems." In Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS 2001), Lecture Notes in Computer Science, Vol. 2245, pp. 244–255. © Springer-Verlag, 2001. (PDF, PS.GZ) L. Arge, U. Meyer, L. Toma, and N. Zeh. "On External-Memory Planar Depth First Search." In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, Vol. 2125, pp. 471–482. © Springer-Verlag, 2001. (PDF, PS.GZ) A. Maheshwari, M. Smid, and N. Zeh. "I/O-Efficient Shortest-Path Queries in Geometric Spanners." In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, Vol. 2125, pp. 287–299. © Springer-Verlag, 2001. (PDF, PS.GZ) N. Zeh and N. Santoro. "On Finding Minimum Deadly Sets for Directed Networks." In Proceedings of the 8th International Colloquium on Structural Informationand Communication Complexity (SIROCCO 2001), pp. 351–365, 2001. (PDF, PS.GZ) A. Maheshwari and N. Zeh. "I/O-Efficient Algorithms for Bounded Treewidth Graphs." In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 89–90, 2001. (PDF, PS.GZ) S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh. "I/O-Efficient Well-Separated Pair Decomposition and its Applications." In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), Lecture Notes in Computer Science, Vol. 1879, pp. 220–231. © Springer-Verlag, 2000. (PDF, PS.GZ) A. Maheshwari and N. Zeh. "External Memory Algorithms for Outerplanar Graphs." In Proceedings of the 10th Annual Sumposium on Algorithms and Computation (ISAAC 99), Lecture Notes in Computer Science, Vol. 1741, pp. 307–316. © Springer-Verlag, 1999. (PDF, PS.GZ) D. Hutchinson, A. Maheshwari, and N. Zeh. "An External Memory Data Structure for Shortest Path Queries." In Proceedings of the 5th Annual Combinatorics and Computing Conference (COCOON 99), Lecture Notes in Computer Science, Vol. 1627, pp. 51–60. © Springer-Verlag, 1999. (PDF, PS.GZ) Technical reports U. Meyer and N. Zeh. "I/O-Efficient Undirected Shortest Paths with Unbounded Edge Weights." Technical Report CS-2006-04, Faculty of Computer Science, Dalhousie University, Halifax, 2006. N. Zeh. "Improved and More Realistic Algorithms for Maximal Graph Connectivity." Technical Report CS-2004-04, Faculty of Computer Science, Dalhousie University, Halifax, 2004. G. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. "Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths." BRICS Report RS-04-2, Aarhus, Denmark, 2004. N. Zeh. "Connecivity of Graphs Under Edge Flips." Technical Report CS-2003-07, Faculty of Computer Science, Dalhousie University, Halifax, 2003. N. Zeh. "I/O-Efficient Planar Embedding Using Graph Separators." Technical Report TR-01-07, School of Computer Science, Carleton University, Ottawa, 2001. (PDF, PS.GZ) N. Zeh. "I/O-Efficient Planar Separators and Applications." Technical Report TR-01-02, School of Computer Science, Carleton University, Ottawa, 2001. (PDF, PS.GZ) D. Hutchinson, A. Maheshwari, and N. Zeh. "An External Memory Data Structure for Shortest Path Queries." Jenaer Schriften zur Mathematik und Informatik 99/11, Friedrich-Schiller-Universität Jena, 1999. N. Zeh, J. Dietel, and H.-D. Hecker. "Computing the Union of Simple Polygons in O(log n) Time Using O(n²) Processors." Forschungsergebnisse Math/Inf/97/12, Friedrich-Schiller-Universität Jena, 1997. Theses N. Zeh. I/O-Efficient Algorithms for Shortest Path Related Problems. Ph.D. thesis, School of Computer Science, Carleton University, Ottawa, Canada, April 2002. (PDF, PS.GZ) N. Zeh. An External-Memory Data Structure for Shortest Path Queries. Diplomarbeit, Friedrich-Schiller-Universität Jena, November 1998. (PDF, PS.GZ) Book chapters L. Arge and N. Zeh. "I/O-Efficient Algorithms." In Handbook of Algorithms and Theory of Computation, 2nd edition, CRC Press, to appear. N. Zeh. "I/O-Model." In Encyclopedia of Algorithms, Springer-Verlag, 2008. N. Zeh. "I/O-Efficient Graph Algorithms." In EEF Summer School on Massive Data Sets. To appear. A. Maheshwari and N. Zeh. "A Survey of Techniques for Designing I/O-Efficient Algorithms." In Algorithms for Memory Hierarchies, Lecture Notes in Computer Science, Vol. 2625, pp. 36–61. © Springer-Verlag, 2003. L. Toma and N. Zeh. "I/O-Efficient Algoriths for Sparse Graphs." In Algorithms for Memory Hierarchies, Lecture Notes in Computer Science, Vol. 2625, pp. 85–109. © Springer-Verlag, 2003.