Zeh, Norbert - Faculty of Computer Science, Dalhousie University

Advanced Search

Zeh, Norbert - Faculty of Computer Science, Dalhousie University

I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search
I/O-Efficient Undirected Shortest Paths Ulrich Meyer1,
On Finding Minimum Deadly Sets for Directed Networks
I/O-Optimal Planar Embedding Using Graph Separators Norbert Zeh
I/O-Efficient Well-Separated Pair Decomposition and its Applications
Geometric Algorithms for Private-Cache Chip Multiprocessors (Extended Abstract)
Ordered and Unordered Top-K Range Reporting in Large Data Sets Peyman Afshani
Improved Space Bounds for Cache-Oblivious Range Reporting Peyman Afshani
I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors Deepak Ajwani
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
A Heuristic Strong Connectivity Algorithm for Large Graphs
Cache-Oblivious Red-Blue Line Segment Intersection
Engineering a Topological Sorting Algorithm for Massive Graphs Deepak Ajwani
Cache-Oblivious Planar Shortest Paths Hema Jampala and Norbert Zeh
I/O-EFFICIENT PLANAR SEPARATORS ANIL MAHESHWARI AND NORBERT ZEH
Simple and Semi-Dynamic Structures for Cache-Oblivious Planar Orthogonal Range Searching
Approximating geometric bottleneck shortest Prosenjit Bose
Adaptive Tuple Differential Coding Jean-Paul Deveaux, Andrew Rau-Chaplin, and Norbert Zeh
I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrains Models
An External Memory Data Structure for Shortest Path Queries (Extended Abstract)
A Faster Cache-Oblivious Shortest-Path Algorithm for Undirected Graphs with Bounded Edge Lengths
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths (Extended Abstract )
A General Approach for Cache-Oblivious Range Reporting and Approximate Range Counting
I/O and Space-Efficient Path Traversal in Planar Craig Dillabaugh1
Cache-Oblivious Range Reporting With Optimal Queries Requires Superlinear Space
A Unifying View on Approximation and FPT of Agreement Forests (Extended Abstract
I/O-Efficient Computation of Water Flow Across a Terrain University of Aarhus
Boundary-Optimal Triangulation Flooding Richard J. Nowakowski1
Geometric Spanners With Small Chromatic Number Prosenjit Bose1
I/O-Efficient Algorithms for Graphs of Bounded Treewidth Anil Maheshwari
CCCG 2009, Vancouver, BC, August 1719, 2009 Relaxed Gabriel Graphs
September 6, 2005 13:40 WSPC/Guidelines flooding Boundary-Optimal Triangulation Flooding
I/O-Efficient Well-Separated Pair Decomposition and Applications