Norbert Zeh

Q: What Schools Are Affiliated With Norbert Zeh

Norbert Zeh is affiliated with the following schools: Dalhousie University, Paderborn University

Norbert Zeh's AcademicInfluence.com Rankings

Norbert Zeh

Computer Science

#12562

World Rank

#13436

Historical Rank

Database

#9671

World Rank

#10222

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Norbert Zeh's Degrees

PhD Computer Science Paderborn University
Masters Computer Science Paderborn University
Bachelors Computer Science Paderborn University

Similar Degrees You Can Earn

Why Is Norbert Zeh Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Norbert Zeh is a German computer scientist, currently a Canada Research Chair at Dalhousie University.

(See a Problem?)

Norbert Zeh's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Fixed-Parameter Algorithms for Maximum Agreement Forests (2013) (78)
Supertrees Based on the Subtree Prune-and-Regraft Distance (2014) (76)
An external memory data structure for shortest path queries (1999) (71)
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths (2004) (68)
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments (2010) (53)
A Unifying View on Approximation and FPT of Agreement Forests (2009) (53)
Approximating Geometric Bottleneck Shortest Paths (2003) (52)
I/O-Efficient Undirected Shortest Paths (2003) (46)
External-memory algorithms and data structures (2010) (46)
Reverse Nearest Neighbor Queries (2002) (42)
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees (2011) (40)
I/O-optimal algorithms for planar graphs using separators (2002) (39)
I/O-Efficient Algorithms for Graphs of Bounded Treewidth (2001) (39)
External Memory Algorithms for Outerplanar Graphs (1999) (36)
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (2014) (33)
Ordered and unordered top-K range reporting in large data sets (2011) (33)
On External-Memory Planar Depth First Search (2001) (32)
I/O-efficient topological sorting of planar DAGs (2003) (29)
A Survey of Techniques for Designing I/O-Efficient Algorithms (2002) (28)
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths (2006) (28)
I/o-efficient algorithms for shortest path related problems (2002) (26)
I/O-efficient computation of water flow across a terrain (2010) (21)
Parallel Computation of Skyline Queries (2007) (21)
Enhancement of Short Text Clustering by Iterative Classification (2020) (20)
Hybridization Number on Three Rooted Binary Trees is EPT (2014) (20)
On the Advice Complexity of Buffer Management (2012) (20)
Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs (2013) (19)
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract) (2010) (19)
A general approach for cache-oblivious range reporting and approximate range counting (2009) (18)
I/O-efficient strong connectivity and depth-first search for directed planar graphs (2003) (18)
I/O-Efficient Well-Separated Pair Decomposition and Its Applications (2000) (16)
I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrain Models (2006) (15)
I/O-Efficient Planar Separators (2008) (15)
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees (2019) (13)
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths (2007) (12)
Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space (2009) (12)
A topological sorting algorithm for large graphs (2012) (12)
Relaxed Gabriel Graphs (2009) (11)
Categorizing Online Harassment on Twitter (2019) (11)
A parallel buffer tree (2012) (11)
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching (2006) (11)
Politician's Firefighting (2006) (10)
I/O-Efficient Algorithms for Sparse Graphs (2002) (10)
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation (2018) (9)
Cache-Oblivious Red-Blue Line Segment Intersection (2008) (9)
A unifying characterization of tree-based networks and orchard networks using cherry covers (2020) (9)
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths (2012) (8)
Cache-Oblivious Planar Shortest Paths (2005) (8)
I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors (2011) (8)
A Heuristic Strong Connectivity Algorithm for Large Graphs (2009) (8)
Polynomial-Time Algorithms for Phylogenetic Inference Problems (2018) (8)
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems (2001) (7)
I/O-Optimal Algorithms for Outerplanar Graphs (2004) (7)
QuPARA: Query-driven large-scale portfolio aggregate risk analysis on MapReduce (2013) (6)
Geometric Spanners with Small Chromatic Number (2007) (6)
Short Text Stream Clustering via Frequent Word Pairs and Reassignment of Outliers to Clusters (2020) (6)
Engineering a Topological Sorting Algorithm for Massive Graphs (2011) (6)
Parallel construction of succinct trees (2015) (5)
I/O-efficient algorithms for computing planar geometric spanners (2008) (5)
Boundary-optimal Triangulation Flooding (2004) (5)
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem (2008) (4)
I/O-Efficient Planar Separators and Applications (2001) (4)
I/O-Efficient Well-Separated Pair Decomposition and Applications (2006) (4)
Efficient clustering of short text streams using online-offline clustering (2021) (4)
Computing Maximum Agreement Forests without Cluster Partitioning is Folly (2017) (4)
Adaptive Tuple Differential Coding (2007) (3)
Maximal and Convex Layers of Random Point Sets (2018) (3)
Improved space bounds for cache-oblivious range reporting (2011) (3)
I/O-Efficient Shortest Path Queries in Geometric Spanners (2001) (3)
Graph Representation Learning in Document Wikification (2021) (3)
Low-interference networks in metric spaces of bounded doubling dimension (2011) (3)
I/O-E cient Undirected Shortest Paths with Unbounded Weights (2006) (3)
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss (2011) (3)
Improving Short Text Clustering by Similarity Matrix Sparsification (2018) (3)
Finding optimal parameters for edit distance based sequence classification is NP-hard (2009) (2)
Hybridization Number on Three Trees (2014) (2)
I/O and Space-Efficient Path Traversal in Planar Graphs (2009) (2)
Building a scalable spatial OLAP system (2013) (2)
I/O-Efficient Path Traversal in Succinct Planar Graphs (2017) (2)
Efficient Data Structures for Risk Modelling in Portfolios of Catastrophic Risk Using MapReduce (2014) (2)
Contextualized Knowledge Base Sense Embeddings in Word Sense Disambiguation (2021) (2)
A Space-Efficient Framework for Dynamic Point Location (2012) (1)
I/O-Model (2016) (1)
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings (2007) (1)
Graph Convolutional Networks for Categorizing Online Harassment on Twitter (2021) (1)
Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions (2007) (1)
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (2013) (1)
Connectivity of Graphs Under Edge Flips (2004) (1)
I/O-Efficient Algorithms for Bounded Treewidth Graphs (2006) (1)
On Finding Minimum Deadly Sets for Directed Networks (2001) (1)
Lower Bounds for Sorted Geometric Queries in the I/O Model (2012) (1)
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees (2015) (1)
High-performance Computational Framework for Phrase Relatedness (2017) (1)
I/O-Optimal Planar Embedding Using Graph Separators (2001) (0)
Computing Pfafstetter labellings I/O-efficiently (Abstract) (2005) (0)
A Near-Linear Kernel for Two-Parsimony Distance (2022) (0)
Computing the visibility map of fat objects (2007) (0)
Biomedical Word Sense Disambiguation with Contextualized Representation Learning (2022) (0)
I/O-Efficient Path Traversal in Succinct Planar Graphs (2015) (0)
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013 (2013) (0)
I / O-Efficient Algorithms for Planar Graphs I : Separators ∗ (2006) (0)
Computing Pfafstetter Labelings I/o-efficiently (2005) (0)
I/O-EÆ ient Algorithms for Sparse Graphs (2008) (0)
Navigation2D: A Directional Navigation Module for XMonad (2011) (0)
Introduction to Special Issue ALENEX 2013 (2016) (0)
Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG) (2019) (0)
Adaptive tuple differential coding ; LECTURE NOTES IN COMPUTER SCIENCE (2013) (0)
Efficient location-level risk analytics (2020) (0)
I/O-Efficient Path Traversal in Planar Graphs∗ (2009) (0)
Industrial-Scale Ad Hoc Risk Analytics Using MapReduce (2016) (0)

This paper list is powered by the following services:

Other Resources About Norbert Zeh

en.wikipedia.org

What Schools Are Affiliated With Norbert Zeh?

Norbert Zeh is affiliated with the following schools:

Norbert Zeh's Academic­Influence.com Rankings