Fixed-parameter algorithms for maximum agreement forests C Whidden, RG Beiko, N Zeh SIAM Journal on Computing 42 (4), 1431-1466, 2013 | 92 | 2013 |
Fixed-parameter algorithms for maximum agreement forests C Whidden, RG Beiko, N Zeh SIAM Journal on Computing 42 (4), 1431-1466, 2013 | 92 | 2013 |
Supertrees based on the subtree prune-and-regraft distance C Whidden, N Zeh, RG Beiko Systematic biology 63 (4), 566-581, 2014 | 87 | 2014 |
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 | 68 | 2004 |
A unifying view on approximation and FPT of agreement forests C Whidden, N Zeh International Workshop on Algorithms in Bioinformatics, 390-402, 2009 | 62 | 2009 |
I/O-efficient undirected shortest paths U Meyer, N Zeh European Symposium on Algorithms, 434-445, 2003 | 61 | 2003 |
Approximating geometric bottleneck shortest paths P Bose, A Maheshwari, G Narasimhan, M Smid, N Zeh Computational Geometry 29 (3), 233-249, 2004 | 58 | 2004 |
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 | 57 | 2010 |
On reverse nearest neighbor queries. A Maheshwari, J Vahrenhold, N Zeh CCCG, 128-132, 2002 | 56 | 2002 |
Parallel computation of skyline queries A Cosgaya-Lozano, A Rau-Chaplin, N Zeh 21st International Symposium on High Performance Computing Systems and …, 2007 | 49 | 2007 |
I/O-optimal algorithms for planar graphs using separators A Maheshwari, N Zeh Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002 | 49 | 2002 |
External memory algorithms for outerplanar graphs A Aggarwal, CP Rangan, A Maheshwari, N Zeh Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999 | 49 | 1999 |
An external memory data structure for shortest path queries D Hutchinson, A Maheshwari, N Zeh Discrete Applied Mathematics 126 (1), 55-82, 2003 | 48 | 2003 |
An external memory data structure for shortest path queries D Hutchinson, A Maheshwari, N Zeh International Computing and Combinatorics Conference, 51-60, 1999 | 48 | 1999 |
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 | 41 | 2011 |
I/O-efficient algorithms for shortest path related problems NR Zeh Carleton University, 2002 | 41 | 2002 |
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 | 38 | 2003 |
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 | 37 | 2020 |
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 | 37 | 2014 |
A survey of techniques for designing I/O-efficient algorithms A Maheshwari, N Zeh Algorithms for Memory Hierarchies: Advanced Lectures, 36-61, 2003 | 37 | 2003 |