Search the dblp DataBase
Norbert Zeh :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Anil Maheshwari , Jan Vahrenhold , Norbert Zeh On reverse nearest neighbor queries. [Citation Graph (0, 0)][DBLP ] CCCG, 2002, pp:128-132 [Conf ] David A. Hutchinson , Anil Maheshwari , Norbert Zeh An External Memory Data Structure for Shortest Path Queries. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:51-60 [Conf ] Lars Arge , Norbert Zeh Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:158-166 [Conf ] Anil Maheshwari , Norbert Zeh A Survey of Techniques for Designing I/O-Efficient Algorithms. [Citation Graph (0, 0)][DBLP ] Algorithms for Memory Hierarchies, 2002, pp:36-61 [Conf ] Laura Toma , Norbert Zeh I/O-Efficient Algorithms for Sparse Graphs. [Citation Graph (0, 0)][DBLP ] Algorithms for Memory Hierarchies, 2002, pp:85-109 [Conf ] Sathish Govindarajan , Tamás Lukovszki , Anil Maheshwari , Norbert Zeh I/O-Efficient Well-Separated Pair Decomposition and Its Applications. [Citation Graph (0, 0)][DBLP ] ESA, 2000, pp:220-231 [Conf ] Ulrich Meyer , Norbert Zeh I/O-Efficient Undirected Shortest Paths. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:434-445 [Conf ] Ulrich Meyer , Norbert Zeh I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:540-551 [Conf ] Lars Arge , Norbert Zeh I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. [Citation Graph (0, 0)][DBLP ] FOCS, 2003, pp:261-270 [Conf ] Tamás Lukovszki , Anil Maheshwari , Norbert Zeh I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2001, pp:244-255 [Conf ] Hema Jampala , Norbert Zeh Cache-Oblivious Planar Shortest Paths. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:563-575 [Conf ] Anil Maheshwari , Norbert Zeh External Memory Algorithms for Outerplanar Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 1999, pp:307-316 [Conf ] Richard J. Nowakowski , Norbert Zeh Boundary-Optimal Triangulation Flooding. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:717-728 [Conf ] Allan E. Scott , Ulrike Stege , Norbert Zeh Politician's Firefighting. [Citation Graph (0, 0)][DBLP ] ISAAC, 2006, pp:608-617 [Conf ] Norbert Zeh , Nicola Santoro On Finding Minimum Deadly Sets for Directed Networks. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2001, pp:351-366 [Conf ] Anil Maheshwari , Norbert Zeh I/O-efficient algorithms for graphs of bounded treewidth. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:89-90 [Conf ] Anil Maheshwari , Norbert Zeh I/O-optimal algorithms for planar graphs using separators. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:372-381 [Conf ] Lars Arge , Laura Toma , Norbert Zeh I/O-efficient topological sorting of planar DAGs. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:85-93 [Conf ] Prosenjit Bose , Anil Maheshwari , Giri Narasimhan , Michiel H. M. Smid , Norbert Zeh Approximating Geometric Bottleneck Shortest Paths. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:38-49 [Conf ] Gerth Stølting Brodal , Rolf Fagerberg , Ulrich Meyer , Norbert Zeh Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:480-492 [Conf ] Norbert Zeh Connectivity of Graphs Under Edge Flips. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:161-173 [Conf ] Lars Arge , Ulrich Meyer , Laura Toma , Norbert Zeh On External-Memory Planar Depth First Search. [Citation Graph (0, 0)][DBLP ] WADS, 2001, pp:471-482 [Conf ] Anil Maheshwari , Michiel H. M. Smid , Norbert Zeh I/O-Efficient Shortest Path Queries in Geometric Spanners. [Citation Graph (0, 0)][DBLP ] WADS, 2001, pp:287-299 [Conf ] Sathish Govindarajan , Tamás Lukovszki , Anil Maheshwari , Norbert Zeh I/O-Efficient Well-Separated Pair Decomposition and Applications. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2006, v:45, n:4, pp:585-614 [Journal ] Prosenjit Bose , Anil Maheshwari , Giri Narasimhan , Michiel H. M. Smid , Norbert Zeh Approximating geometric bottleneck shortest paths. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2004, v:29, n:3, pp:233-249 [Journal ] David A. Hutchinson , Anil Maheshwari , Norbert Zeh An external memory data structure for shortest path queries. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:126, n:1, pp:55-82 [Journal ] Richard J. Nowakowski , Norbert Zeh Boundary-optimal Triangulation Flooding. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:271-290 [Journal ] Lars Arge , Ulrich Meyer , Laura Toma , Norbert Zeh On External-Memory Planar Depth First Search. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2003, v:7, n:2, pp:105-129 [Journal ] Anil Maheshwari , Norbert Zeh I/O-Optimal Algorithms for Outerplanar Graphs. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2004, v:8, n:, pp:47-87 [Journal ] Jean-Paul Deveaux , Andrew Rau-Chaplin , Norbert Zeh Adaptive Tuple Differential Coding. [Citation Graph (0, 0)][DBLP ] DEXA, 2007, pp:109-119 [Conf ] Adan Cosgaya-Lozano , Andrew Rau-Chaplin , Norbert Zeh Parallel Computation of Skyline Queries. [Citation Graph (0, 0)][DBLP ] HPCS, 2007, pp:12- [Conf ] Luca Allulli , Peter Lichodzijewski , Norbert Zeh A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:910-919 [Conf ] Relaxed Gabriel Graphs. [Citation Graph (, )][DBLP ] Cache-oblivious range reporting with optimal queries requires superlinear space. [Citation Graph (, )][DBLP ] A general approach for cache-oblivious range reporting and approximate range counting. [Citation Graph (, )][DBLP ] I/O-efficient computation of water flow across a terrain. [Citation Graph (, )][DBLP ] Cache-Oblivious Red-Blue Line Segment Intersection. [Citation Graph (, )][DBLP ] Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). [Citation Graph (, )][DBLP ] I/O and Space-Efficient Path Traversal in Planar Graphs. [Citation Graph (, )][DBLP ] Finding optimal parameters for edit distance based sequence classification is NP-hard. [Citation Graph (, )][DBLP ] NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. [Citation Graph (, )][DBLP ] A Unifying View on Approximation and FPT of Agreement Forests. [Citation Graph (, )][DBLP ] Geometric Spanners with Small Chromatic Number. [Citation Graph (, )][DBLP ] Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. [Citation Graph (, )][DBLP ] A Heuristic Strong Connectivity Algorithm for Large Graphs. [Citation Graph (, )][DBLP ] I/O-Efficient Algorithms for Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP ] Editorial. [Citation Graph (, )][DBLP ] I/O-efficient algorithms for computing planar geometric spanners. [Citation Graph (, )][DBLP ] Geometric spanners with small chromatic number. [Citation Graph (, )][DBLP ] A general approach for cache-oblivious range reporting and approximate range counting. [Citation Graph (, )][DBLP ] Geometric Spanners With Small Chromatic Number [Citation Graph (, )][DBLP ] NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem [Citation Graph (, )][DBLP ] Search in 0.071secs, Finished in 0.075secs