Norbert Zeh - Concepedia

Author

Norbert Zeh

Dalhousie University ORCID

Also Known As

N Zeh, N. Zeh, NORBERT ZEH, Norbert Zeh, Xun Zhou, Zeh, N., Zeh, Norbert

146

Publications

1.3K

Citations

H-Index

Concepts

All Affiliations

Dalhousie University Aarhus University Carleton University Delft University of Technology Duke University

About

Norbert Zeh is an author at Dalhousie University specializing in computer science, engineering, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	12	17	424
2	Education	6	6	118
3	Natural Sciences	4	4	124
4	Business	2	2	29
5	Management	1	1	31

Norbert Zeh

Publications

628

Citations

H-Index

Page 1

	Year	Citations
Fixed-Parameter Algorithms for Maximum Agreement Forests Chris Whidden, Robert G. Beiko, Norbert Zeh SIAM Journal on Computing EngineeringMachine LearningSpeech RecognitionAgreement ForestPhylogenetics	2013	92
Supertrees Based on the Subtree Prune-and-Regraft Distance Chris Whidden, Norbert Zeh, Robert G. Beiko Systematic Biology	2014	88
An external memory data structure for shortest path queries D. A. W. Hutchinson, Anil Maheshwari, Norbert Zeh Discrete Applied Mathematics EngineeringData ScienceComputer ArchitectureExternal-memory AlgorithmShortest Path Queries	2002	60
I/O-optimal algorithms for planar graphs using separators Anil Maheshwari, Norbert Zeh Symposium on Discrete Algorithms Mathematical ProgrammingEngineeringPlanar GraphComputational ComplexityGraph Processing	2002	32
Parallel Computation of Skyline Queries Adan Cosgaya-Lozano, Andrew Rau‐Chaplin, Norbert Zeh Cluster ComputingEngineeringInformation RetrievalData ScienceData Mining	2007	31
I/O-efficient topological sorting of planar DAGs Lars Arge, Laura Toma, Norbert Zeh Directed GraphEngineeringPlanar DigraphsPlanar GraphNetwork Analysis	2003	28
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests Chris Whidden, Robert G. Beiko, Norbert Zeh arXiv (Cornell University)	2011	28
I/O-efficient algorithms for graphs of bounded treewidth Anil Maheshwari, Norbert Zeh Symposium on Discrete Algorithms Mathematical ProgrammingDirected GraphBounded TreewidthI/o-efficient AlgorithmsEngineering	2001	25
On External-Memory Planar Depth First Search Lars Arge, Ulrich Meyer, Laura Toma, Journal of Graph Algorithms and Applications Graph SparsityEngineeringPlanar GraphComputer ArchitectureNetwork Analysis	2003	19
I/O-efficient computation of water flow across a terrain Lars Arge, Norbert Zeh Terrain TStream ProcessingEngineeringGeometric AlgorithmWater Resources	2010	18

Page 1