Fixed-parameter algorithms for maximum agreement forests C Whidden, RG Beiko, N Zeh SIAM Journal on Computing 42 (4), 1431-1466, 2013 | 77 | 2013 |

Fixed-parameter algorithms for maximum agreement forests C Whidden, RG Beiko, N Zeh SIAM Journal on Computing 42 (4), 1431-1466, 2013 | 77 | 2013 |

Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths GS Brodal, R Fagerberg, U Meyer, N Zeh Scandinavian Workshop on Algorithm Theory, 480-492, 2004 | 59 | 2004 |

Supertrees based on the subtree prune-and-regraft distance C Whidden, N Zeh, RG Beiko Systematic biology 63 (4), 566-581, 2014 | 58 | 2014 |

On reverse nearest neighbor queries. A Maheshwari, J Vahrenhold, N Zeh CCCG, 128-132, 2002 | 54 | 2002 |

I/O-efficient undirected shortest paths U Meyer, N Zeh European Symposium on Algorithms, 434-445, 2003 | 52 | 2003 |

Approximating geometric bottleneck shortest paths P Bose, A Maheshwari, G Narasimhan, M Smid, N Zeh Computational Geometry 29 (3), 233-249, 2004 | 49 | 2004 |

A unifying view on approximation and FPT of agreement forests C Whidden, N Zeh International Workshop on Algorithms in Bioinformatics, 390-402, 2009 | 48 | 2009 |

Fast FPT algorithms for computing rooted agreement forests: Theory and experiments C Whidden, RG Beiko, N Zeh International Symposium on Experimental Algorithms, 141-153, 2010 | 45 | 2010 |

I/O-optimal algorithms for planar graphs using separators A Maheshwari, N Zeh Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002 | 44 | 2002 |

Parallel computation of skyline queries A Cosgaya-Lozano, A Rau-Chaplin, N Zeh 21st International Symposium on High Performance Computing Systems and …, 2007 | 42 | 2007 |

An external memory data structure for shortest path queries D Hutchinson, A Maheshwari, N Zeh International Computing and Combinatorics Conference, 51-60, 1999 | 42 | 1999 |

An external memory data structure for shortest path queries D Hutchinson, A Maheshwari, N Zeh Discrete Applied Mathematics 126 (1), 55-82, 2003 | 38 | 2003 |

I/O-efficient algorithms for shortest path related problems. NR Zeh | 38 | 2003 |

External memory algorithms for outerplanar graphs A Maheshwari, N Zeh International Symposium on Algorithms and Computation, 307-316, 1999 | 37 | 1999 |

I/O-efficient undirected shortest paths with unbounded edge lengths U Meyer, N Zeh European Symposium on Algorithms, 540-551, 2006 | 33 | 2006 |

On external-memory planar depth first search L Arge, U Meyer, L Toma, N Zeh J. Graph Algorithms Appl. 7 (2), 105-129, 2003 | 32 | 2003 |

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 | 31 | 2011 |

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 | 31 | 2003 |

I/O-efficient algorithms for graphs of bounded treewidth A Maheshwari, N Zeh SODA 1, 89-90, 2001 | 29 | 2001 |