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
352 2009 Consequences of faster alignment of sequences A Abboud, VV Williams, O Weimann
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
151 2014 Shortest paths in directed planar graphs with negative lengths: A linear-space O (n log2 n )-time algorithm PN Klein, S Mozes, O Weimann
ACM Transactions on Algorithms (TALG) 6 (2), 1-18, 2010
122 2010 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
101 2015 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
86 2011 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
69 2009 On cartesian trees and range minimum queries ED Demaine, GM Landau, O Weimann
International Colloquium on Automata, Languages, and Programming, 341-353, 2009
66 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
59 2020 Finding an optimal tree searching strategy in linear time. S Mozes, K Onak, O Weimann
SODA 8, 1096-1105, 2008
54 2008 Replacement paths and distance sensitivity oracles via fast matrix multiplication O Weimann, R Yuster
ACM Transactions on Algorithms (TALG) 9 (2), 1-13, 2013
53 2013 The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59, 129-144, 2011
53 2011 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
52 2018 Gene Proximity Analysis across Whole Genomes via PQ Trees1 GM Landau, L Parida, O Weimann
Journal of Computational Biology 12 (10), 1289-1306, 2005
51 2005 Tree compression with top trees P Bille, IL Gørtz, GM Landau, O Weimann
Information and Computation 243, 166-177, 2015
49 2015 Improved bounds for online preemptive matching L Epstein, A Levin, D Segev, O Weimann
arXiv preprint arXiv:1207.1788, 2012
47 2012 Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic P Gawrychowski, H Kaplan, S Mozes, M Sharir, O Weimann
SIAM Journal on Computing 50 (2), 509-554, 2021
43 2021 Minimum Cut in P Gawrychowski, S Mozes, O Weimann
arXiv preprint arXiv:1911.01145, 2019
42 2019 On cartesian trees and range minimum queries ED Demaine, GM Landau, O Weimann
Algorithmica 68 (3), 610-625, 2014
42 2014 Using PQ trees for comparative genomics GM Landau, L Parida, O Weimann
Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island …, 2005
39 2005 Binary jumbled pattern matching on trees and tree-like structures T Gagie, D Hermelin, GM Landau, O Weimann
Algorithmica 73, 571-588, 2015
37 2015 