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
360 2009 Consequences of faster alignment of sequences A Abboud, VV Williams, O Weimann
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
175 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
126 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
124 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
88 2011 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
81 2020 On cartesian trees and range minimum queries ED Demaine, GM Landau, O Weimann
International Colloquium on Automata, Languages, and Programming, 341-353, 2009
74 2009 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
72 2009 The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59, 129-144, 2011
62 2011 Replacement paths and distance sensitivity oracles via fast matrix multiplication O Weimann, R Yuster
ACM Transactions on Algorithms (TALG) 9 (2), 1-13, 2013
61 2013 Finding an optimal tree searching strategy in linear time. S Mozes, K Onak, O Weimann
SODA 8, 1096-1105, 2008
61 2008 Minimum Cut in P Gawrychowski, S Mozes, O Weimann
Theory of Computing Systems, 1-21, 2024
58 2024 Tree compression with top trees P Bille, IL Gørtz, GM Landau, O Weimann
Information and Computation 243, 166-177, 2015
57 2015 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
56 2018 On cartesian trees and range minimum queries ED Demaine, GM Landau, O Weimann
Algorithmica 68 (3), 610-625, 2014
56 2014 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
55 2021 Gene Proximity Analysis across Whole Genomes via PQ Trees1 GM Landau, L Parida, O Weimann
Journal of Computational Biology 12 (10), 1289-1306, 2005
52 2005 Improved bounds for online preemptive matching L Epstein, A Levin, D Segev, O Weimann
arXiv preprint arXiv:1207.1788, 2012
48 2012 Optimal distance labeling schemes for trees O Freedman, P Gawrychowski, PK Nicholson, O Weimann
Proceedings of the ACM Symposium on Principles of Distributed Computing, 185-194, 2017
40 2017 Binary jumbled pattern matching on trees and tree-like structures T Gagie, D Hermelin, GM Landau, O Weimann
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013
40 2013 