MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Norbert Zeh" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

19 documents found, showing 1 through 10. Next 10 →

ATOM

I/O-Optimal Planar Embedding Using Graph Separators
by Norbert Zeh — 2001
…I/O-Optimal Planar Embedding Using Graph Separators Norbert Zeh School of Computer Science…
Cited by 1 (0 self) – Add To MetaCart

Connectivity of graphs under edge flips
by Norbert Zeh — 2003
…Connectivity of Graphs Under Edge Flips Norbert Zeh Faculty of Computer Science, Dalhousie…
Cited by 1 (0 self) – Add To MetaCart

I/O-Efficient Planar Separators and Applications
by Norbert Zeh, B. Together — 2001
…I/O-Efficient Planar Separators and Applications Norbert Zeh May 30, 2001 Abstract We present a…
Cited by 3 (1 self) – Add To MetaCart

I/O-efficient undirected shortest paths
by Ulrich Meyer, Norbert Zeh — 2003 — In Proc. 11th Annual European Symposium on Algorithms, volume 2832 of LNCS
…I/O-Efficient Undirected Shortest Paths Ulrich Meyer 1,⋆ and Norbert Zeh 2,⋆⋆ 1 Max…
Cited by 7 (2 self) – Add To MetaCart

I/O-efficient algorithms for bounded treewidth graphs
by Anil Maheshwari, Norbert Zeh — 2001 — In Proc. ACM-SIAM Symp. on Discrete Algorithms
…I/O-Efficient Algorithms for Bounded Treewidth Graphs Anil Maheshwari Norbert Zeh August 6, 2000…
Cited by 1 (0 self) – Add To MetaCart

External memory algorithms for outerplanar graphs
by Anil Maheshwari, Norbert Zeh — 1999 — In Proceedings of the 10th International Symposium on Algorithms and Computation
… External Memory Algorithms for Outerplanar Graphs Anil Maheshwari ? and Norbert Zeh School…
Cited by 15 (4 self) – Add To MetaCart

I/O-Efficient Algorithms for Graphs of Bounded Treewidth
by Anil Maheshwari, Norbert Zeh — 2000
…I/O-Ecient Algorithms for Graphs of Bounded Treewidth Anil Maheshwari Norbert Zeh October 19…
Cited by 12 (4 self) – Add To MetaCart

On Reverse Nearest Neighbor Queries
by Extended Anil, Anil Maheshwari, Norbert Zeh — 2002
… Norbert Zeh z Abstract In this paper, we discuss static and dynamic data structures for answering…
Add To MetaCart

I/O-Efficient Topological Sorting of Planar DAGs
by Lars Arge, Laura Toma, Norbert Zeh — 2003 — In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures
… Durham, NC 27708-0129 laura@(email omitted); Norbert Zeh Dept. of Computer Science Duke University Durham, NC…
Cited by 5 (1 self) – Add To MetaCart

I/O-efficient well-separated pair decomposition and its applications
by Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh — 2000 — In Proc. Annual European Symposium on Algorithms
… Govindarajan 1 , Tamás Lukovszki 2 , Anil Maheshwari 3 , and Norbert Zeh 3 1 Duke University,gsat@(email omitted); 2…
Cited by 7 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB