Obserwuj
Norbert Zeh
Norbert Zeh
Professor of Computer Science, Dalhousie University
Zweryfikowany adres z cs.dal.ca
Tytuł
Cytowane przez
Cytowane przez
Rok
Fixed-parameter algorithms for maximum agreement forests
C Whidden, RG Beiko, N Zeh
SIAM Journal on Computing 42 (4), 1431-1466, 2013
992013
Supertrees based on the subtree prune-and-regraft distance
C Whidden, N Zeh, RG Beiko
Systematic biology 63 (4), 566-581, 2014
952014
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
GS Brodal, R Fagerberg, U Meyer, N Zeh
Algorithm Theory-SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory …, 2004
702004
A unifying view on approximation and FPT of agreement forests
C Whidden, N Zeh
International Workshop on Algorithms in Bioinformatics, 390-402, 2009
652009
I/O-efficient undirected shortest paths
U Meyer, N Zeh
European Symposium on Algorithms, 434-445, 2003
652003
Approximating geometric bottleneck shortest paths
P Bose, A Maheshwari, G Narasimhan, M Smid, N Zeh
Computational Geometry 29 (3), 233-249, 2004
642004
Fast FPT algorithms for computing rooted agreement forests: theory and experiments
C Whidden, RG Beiko, N Zeh
Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia …, 2010
592010
On reverse nearest neighbor queries.
A Maheshwari, J Vahrenhold, N Zeh
CCCG, 128-132, 2002
562002
Enhancement of short text clustering by iterative classification
MRH Rakib, N Zeh, M Jankowska, E Milios
Natural Language Processing and Information Systems: 25th International …, 2020
522020
Parallel computation of skyline queries
A Cosgaya-Lozano, A Rau-Chaplin, N Zeh
21st International Symposium on High Performance Computing Systems and …, 2007
522007
External memory algorithms for outerplanar graphs
A Aggarwal, CP Rangan, A Maheshwari, N Zeh
Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999
521999
I/O-optimal algorithms for planar graphs using separators
A Maheshwari, N Zeh
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
502002
An external memory data structure for shortest path queries
D Hutchinson, A Maheshwari, N Zeh
Discrete Applied Mathematics 126 (1), 55-82, 2003
472003
An external memory data structure for shortest path queries
D Hutchinson, A Maheshwari, N Zeh
International Computing and Combinatorics Conference, 51-60, 1999
471999
Ordered and unordered top-k range reporting in large data sets
P Afshani, GS Brodal, N Zeh
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011
432011
Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
M He, G Tang, N Zeh
International Symposium on Algorithms and Computation, 128-140, 2014
422014
A survey of techniques for designing I/O-efficient algorithms
A Maheshwari, N Zeh
Algorithms for Memory Hierarchies: Advanced Lectures, 36-61, 2003
422003
I/O-efficient algorithms for shortest path related problems
NR Zeh
Carleton University, 2002
402002
I/O-efficient topological sorting of planar DAGs
L Arge, L Toma, N Zeh
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003
382003
I/O-efficient undirected shortest paths with unbounded edge lengths
U Meyer, N Zeh
European Symposium on Algorithms, 540-551, 2006
372006
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20