| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Peyman Afshani, Chris H. Hamilton, Norbert Zeh |
Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space.  |
Discrete & Computational Geometry  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Whidden, Robert G. Beiko, Norbert Zeh |
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh |
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh |
Ordered and Unordered Top-K Range Reporting in Large Data Sets. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Peyman Afshani, Norbert Zeh |
Improved Space Bounds for Cache-Oblivious Range Reporting. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Deepak Ajwani, Nodari Sitchinava, Norbert Zeh |
I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors. |
IPDPS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh |
Engineering a Topological Sorting Algorithm for Massive Graphs. |
ALENEX |
2011 |
DBLP BibTeX RDF |
|
| 1 | Peyman Afshani, Chris H. Hamilton, Norbert Zeh |
A general approach for cache-oblivious range reporting and approximate range counting. |
Comput. Geom. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Zeh |
Editorial. |
Comput. Geom. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepak Ajwani, Nodari Sitchinava, Norbert Zeh |
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Morten Revsbæk, Norbert Zeh |
I/O-efficient computation of water flow across a terrain. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
i/o-efficient algorithms, geographical information systems, terrains |
| 1 | Chris Whidden, Robert G. Beiko, Norbert Zeh |
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. |
SEA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-Efficient Algorithms for Graphs of Bounded Treewidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Algorithms, Graph algorithms, External memory algorithms, Bounded treewidth |
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
Geometric spanners with small chromatic number. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Chris H. Hamilton, Norbert Zeh |
Cache-oblivious range reporting with optimal queries requires superlinear space. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
data structures, lower bounds, memory hierarchies, range searching, cache-obliviousness |
| 1 | Peyman Afshani, Chris H. Hamilton, Norbert Zeh |
A general approach for cache-oblivious range reporting and approximate range counting. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
data structures, memory hierarchies, range searching, cache-obliviousness |
| 1 | Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh |
Relaxed Gabriel Graphs. |
CCCG |
2009 |
DBLP BibTeX RDF |
|
| 1 | Adan Cosgaya-Lozano, Norbert Zeh |
A Heuristic Strong Connectivity Algorithm for Large Graphs. |
SEA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Whidden, Norbert Zeh |
A Unifying View on Approximation and FPT of Agreement Forests. |
WABI |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh |
I/O and Space-Efficient Path Traversal in Planar Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vlado Keselj, Haibin Liu, Norbert Zeh, Christian Blouin, Chris Whidden |
Finding optimal parameters for edit distance based sequence classification is NP-hard. |
KDD Workshop on Statistical and Relational Learning in Bioinformatics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh |
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
I/O-efficient algorithms for computing planar geometric spanners. |
Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-Efficient Planar Separators. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Zeh |
I/O-model. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Thomas Mølhave, Norbert Zeh |
Cache-Oblivious Red-Blue Line Segment Intersection. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh |
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. |
WABI |
2008 |
DBLP DOI BibTeX RDF |
Noah’s Ark Problem, phylogenetic diversity, approximation algorithm |
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
Geometric Spanners With Small Chromatic Number |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Oliver Baltzer, Andrew Rau-Chaplin, Norbert Zeh |
Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions. |
JDIM |
2007 |
DBLP BibTeX RDF |
|
| 1 | Adan Cosgaya-Lozano, Andrew Rau-Chaplin, Norbert Zeh |
Parallel Computation of Skyline Queries. |
HPCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Allulli, Peter Lichodzijewski, Norbert Zeh |
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh (eds.) |
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings |
WADS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
Geometric Spanners with Small Chromatic Number. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Paul Deveaux, Andrew Rau-Chaplin, Norbert Zeh |
Adaptive Tuple Differential Coding. |
DEXA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Well-Separated Pair Decomposition and Applications. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Nowakowski, Norbert Zeh |
Boundary-optimal Triangulation Flooding. |
Int. J. Comput. Geometry Appl. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Meyer, Norbert Zeh |
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Norbert Zeh |
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
data structures, memory hierarchies, range searching, cache-obliviousness |
| 1 | Allan E. Scott, Ulrike Stege, Norbert Zeh |
Politician's Firefighting. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hema Jampala, Norbert Zeh |
Cache-Oblivious Planar Shortest Paths. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
Approximating geometric bottleneck shortest paths. |
Comput. Geom. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-Optimal Algorithms for Outerplanar Graphs. |
J. Graph Algorithms Appl. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Norbert Zeh |
Connectivity of Graphs Under Edge Flips. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh |
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Nowakowski, Norbert Zeh |
Boundary-Optimal Triangulation Flooding. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Hutchinson, Anil Maheshwari, Norbert Zeh |
An external memory data structure for shortest path queries. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh |
On External-Memory Planar Depth First Search. |
J. Graph Algorithms Appl. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ulrich Meyer, Norbert Zeh |
I/O-Efficient Undirected Shortest Paths. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
Approximating Geometric Bottleneck Shortest Paths. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Laura Toma, Norbert Zeh |
I/O-efficient topological sorting of planar DAGs. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
I/O-efficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition |
| 1 | Lars Arge, Norbert Zeh |
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-optimal algorithms for planar graphs using separators. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Jan Vahrenhold, Norbert Zeh |
On reverse nearest neighbor queries. |
CCCG |
2002 |
DBLP BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
A Survey of Techniques for Designing I/O-Efficient Algorithms. |
Algorithms for Memory Hierarchies |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Laura Toma, Norbert Zeh |
I/O-Efficient Algorithms for Sparse Graphs. |
Algorithms for Memory Hierarchies |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
I/O-efficient algorithms for graphs of bounded treewidth. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
I/O-Efficient Shortest Path Queries in Geometric Spanners. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh |
On External-Memory Planar Depth First Search. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Zeh, Nicola Santoro |
On Finding Minimum Deadly Sets for Directed Networks. |
SIROCCO |
2001 |
DBLP BibTeX RDF |
|
| 1 | Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Well-Separated Pair Decomposition and Its Applications. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Hutchinson, Anil Maheshwari, Norbert Zeh |
An External Memory Data Structure for Shortest Path Queries. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Maheshwari, Norbert Zeh |
External Memory Algorithms for Outerplanar Graphs. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")