An optimal decomposition algorithm for tree edit distance ED Demaine, S Mozes, B Rossman, O Weimann ACM Transactions on Algorithms (TALG) 6 (1), 1-19, 2009 | 323 | 2009 |

Consequences of faster alignment of sequences A Abboud, VV Williams, O Weimann International Colloquium on Automata, Languages, and Programming, 39-51, 2014 | 129 | 2014 |

Shortest paths in directed planar graphs with negative lengths: A linear-space *O*(*n* log^{2} *n*)-time algorithmPN Klein, S Mozes, O Weimann ACM Transactions on Algorithms (TALG) 6 (2), 1-18, 2010 | 113 | 2010 |

On cartesian trees and range minimum queries ED Demaine, GM Landau, O Weimann International Colloquium on Automata, Languages, and Programming, 341-353, 2009 | 88* | 2009 |

Random access to grammar-compressed strings P Bille, GM Landau, R Raman, K Sadakane, SR Satti, O Weimann Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 84 | 2011 |

Random access to grammar-compressed strings and trees P Bille, GM Landau, R Raman, K Sadakane, SR Satti, O Weimann SIAM Journal on Computing 44 (3), 513-539, 2015 | 76 | 2015 |

Replacement paths via fast matrix multiplication O Weimann, R Yuster 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 655-662, 2010 | 62* | 2010 |

A unified algorithm for accelerating edit-distance computation via text-compression D Hermelin, GM Landau, S Landau, O Weimann arXiv preprint arXiv:0902.2649, 2009 | 61 | 2009 |

Tree compression with top trees OW Philip Bille, Inge Li Gørtz, Gad M. Landaub Information and Computation 243, 166-177, 2015 | 52* | 2015 |

The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59 (2), 129-144, 2011 | 49 | 2011 |

Gene Proximity Analysis across Whole Genomes via PQ Trees^{1}GM Landau, L Parida, O Weimann Journal of Computational Biology 12 (10), 1289-1306, 2005 | 49 | 2005 |

Improved bounds for online preemptive matching L Epstein, A Levin, D Segev, O Weimann arXiv preprint arXiv:1207.1788, 2012 | 43 | 2012 |

Finding an optimal tree searching strategy in linear time. S Mozes, K Onak, O Weimann SODA 8, 1096-1105, 2008 | 40 | 2008 |

Better tradeoffs for exact distance oracles in planar graphs P Gawrychowski, S Mozes, O Weimann, C Wulff-Nilsen Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 38 | 2018 |

Binary jumbled pattern matching on trees and tree-like structures T Gagie, D Hermelin, GM Landau, O Weimann Algorithmica 73 (3), 571-588, 2015 | 38 | 2015 |

Using PQ trees for comparative genomics GM Landau, L Parida, O Weimann Annual Symposium on Combinatorial Pattern Matching, 128-143, 2005 | 36 | 2005 |

Speeding up HMM decoding and training by exploiting sequence repetitions Y Lifshits, S Mozes, O Weimann, M Ziv-Ukelson Algorithmica 54 (3), 379-399, 2009 | 33 | 2009 |

Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) K Bringmann, P Gawrychowski, S Mozes, O Weimann ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020 | 32 | 2020 |

Towards optimal packed string matching O Ben-Kiki, P Bille, D Breslauer, L Gasieniec, R Grossi, O Weimann Theoretical Computer Science 525, 111-129, 2014 | 32* | 2014 |

Approximating the maximum consecutive subsums of a sequence F Cicalese, E Laber, O Weimann, R Yuster Theoretical Computer Science 525, 130-137, 2014 | 29* | 2014 |