Reachability and distance queries via 2-hop labels E Cohen, E Halperin, H Kaplan, U Zwick SIAM Journal on Computing 32 (5), 1338-1355, 2003 | 647 | 2003 |

A faster and simpler algorithm for sorting signed permutations by reversals H Kaplan, R Shamir, RE Tarjan SIAM Journal on Computing 29 (3), 880-892, 2000 | 402 | 2000 |

Labeling dynamic XML trees E Cohen, H Kaplan, T Milo SIAM Journal on Computing 39 (5), 2048-2074, 2010 | 385 | 2010 |

Reach for *A**: Efficient Point-to-Point Shortest Path AlgorithmsAV Goldberg, H Kaplan, RF Werneck 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and …, 2006 | 360 | 2006 |

Associative search in peer to peer networks: Harnessing latent semantics E Cohen, A Fiat, H Kaplan IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003 | 264 | 2003 |

Graph sandwich problems MC Golumbic, H Kaplan, R Shamir Journal of Algorithms 19 (3), 449-473, 1995 | 250 | 1995 |

Compact labeling scheme for ancestor queries S Abiteboul, S Alstrup, H Kaplan, T Milo, T Rauhe SIAM Journal on Computing 35 (6), 1295-1309, 2006 | 244 | 2006 |

Optimal oblivious routing in polynomial time Y Azar, E Cohen, A Fiat, H Kaplan, H Räcke Journal of Computer and System Sciences 69 (3), 383-394, 2004 | 242 | 2004 |

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs H Kaplan, M Lewenstein, N Shafrir, M Sviridenko Journal of the ACM (JACM) 52 (4), 602-626, 2005 | 234 | 2005 |

Four strikes against physical mapping of DNA PW Goldberg, MC Golumbic, H Kaplan, R Shamir Journal of Computational Biology 2 (1), 139-152, 1995 | 212 | 1995 |

Prefetching the means for document transfer: A new approach for reducing Web latency E Cohen, H Kaplan Proceedings IEEE INFOCOM 2000. Conference on Computer Communications …, 2000 | 210 | 2000 |

Proactive caching of DNS records: Addressing a performance bottleneck E Cohen, H Kaplan Computer Networks 41 (6), 707-726, 2003 | 161 | 2003 |

Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs H Kaplan, R Shamir, RE Tarjan SIAM Journal on Computing 28 (5), 1906-1922, 1999 | 156 | 1999 |

On the complexity of DNA physical mapping MC Golumbic, H Kaplan, R Shamir Advances in Applied Mathematics 15 (3), 251-261, 1994 | 148 | 1994 |

Computing the discrete Fréchet distance in subquadratic time PK Agarwal, RB Avraham, H Kaplan, M Sharir SIAM Journal on Computing 43 (2), 429-449, 2014 | 141 | 2014 |

A comparison of labeling schemes for ancestor queries H Kaplan, T Milo, R Shabo SODA 2, 954-963, 2002 | 138 | 2002 |

Refreshment policies for web content caches E Cohen, H Kaplan Proceedings IEEE INFOCOM 2001. Conference on Computer Communications …, 2001 | 135 | 2001 |

Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques H Kaplan, R Shamir SIAM Journal on Computing 25 (3), 540-561, 1996 | 131 | 1996 |

Summarizing data using bottom-k sketches E Cohen, H Kaplan Proceedings of the twenty-sixth annual ACM symposium on Principles of …, 2007 | 127 | 2007 |

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems S Arora, A Frieze, H Kaplan Proceedings of 37th Conference on Foundations of Computer Science, 21-30, 1996 | 117 | 1996 |