Oren Weimann

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65(2): 339-353 (2013)

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. 25(1): 19-46 (2013)

Oren Weimann, Raphael Yuster: Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication. ACM Transactions on Algorithms 9(2): 14 (2013)

Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399

Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann: Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. CoRR abs/1301.6127 (2013)

Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann: Tree Compression with Top Trees. CoRR abs/1304.5702 (2013)

Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster: Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. CPM 2012: 149-158

Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann: On Approximating String Selection Problems with Outliers. CPM 2012: 427-438

Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann: On Approximating String Selection Problems with Outliers. CoRR abs/1202.2820 (2012)

Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012)

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. Algorithmica 59(2): 129-144 (2011)

Oren Weimann, David Peleg: A note on exact distance labeling. Inf. Process. Lett. 111(14): 671-673 (2011)

Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann: Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9(1): 2-11 (2011)

Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann: Optimal Packed String Matching. FSTTCS 2011: 423-432

Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster: Distance Oracles for Vertex-Labeled Graphs. ICALP (2) 2011: 490-501

Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann: Random Access to grammar-Compressed Strings. SODA 2011: 373-389

Oren Weimann, Raphael Yuster: Approximating the Diameter of Planar Graphs in Near Linear Time. CoRR abs/1112.1116 (2011)

Oren Weimann, Raphael Yuster: Computing the Girth of a Planar Graph in O(n logn) Time. SIAM J. Discrete Math. 24(2): 609-616 (2010)

Philip N. Klein, Shay Mozes, Oren Weimann: Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log² n)-time algorithm. ACM Transactions on Algorithms 6(2) (2010)

Gad M. Landau, Dekel Tsur, Oren Weimann: Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications 2010: 158-169

Oren Weimann, Raphael Yuster: Replacement Paths via Fast Matrix Multiplication. FOCS 2010: 655-662

Philip Bille, Gad M. Landau, Oren Weimann: Random Access to Grammar Compressed Strings. CoRR abs/1001.1565 (2010)

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: Unified Compression-Based Acceleration of Edit-Distance Computation. CoRR abs/1004.1194 (2010)

Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica 54(3): 379-399 (2009)

Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An optimal decomposition algorithm for tree edit distance. ACM Transactions on Algorithms 6(1) (2009)

Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast algorithms for computing tree LCS. Theor. Comput. Sci. 410(43): 4303-4314 (2009)

Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann: Fast RNA Structure Alignment for Crossing Input Structures. CPM 2009: 236-248

Erik D. Demaine, Gad M. Landau, Oren Weimann: On Cartesian Trees and Range Minimum Queries. ICALP (1) 2009: 341-353

Oren Weimann, Raphael Yuster: Computing the Girth of a Planar Graph in O(n logn) Time. ICALP (1) 2009: 764-773

Philip N. Klein, Shay Mozes, Oren Weimann: Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log² n)-time algorithm. SODA 2009: 236-245

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS 2009: 529-540

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. WINE 2009: 125-136

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. CoRR abs/0902.2649 (2009)

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. CoRR abs/0909.3221 (2009)

Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243

Shay Mozes, Krzysztof Onak, Oren Weimann: Finding an optimal tree searching strategy in linear time. SODA 2008: 1096-1105

Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang: Locality and Gaps in RNA Comparison. Journal of Computational Biology 14(8): 1074-1087 (2007)

Shay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15

Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157

Gad M. Landau, Dekel Tsur, Oren Weimann: Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. WADS 2007: 64-76

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. CoRR abs/cs/0703019 (2007)

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann: Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM 2006: 246-257

Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An O(n^3)-Time Algorithm for Tree Edit Distance. CoRR abs/cs/0604037 (2006)

Gad M. Landau, Laxmi Parida, Oren Weimann: Gene Proximity Analysis across Whole Genomes via PQ Trees¹. Journal of Computational Biology 12(10): 1289-1306 (2005)

Gad M. Landau, Laxmi Parida, Oren Weimann: Using PQ Trees for Comparative Genomics. CPM 2005: 128-143

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann: Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369