Oren Weimann - RankMe

140 papers A* 22A 7B 16C 5Journal 77Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Simple Distributed Deterministic Planar Separator. CoRR Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
2026	B	`conf`	Maintaining a Kingdom in a Tournament. SOFSEM Oren Weimann, Raphael Yuster
2025	A*	`conf`	Distributed Maximum Flow in Planar Graphs. PODC Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann
2025	A*	`conf`	Faster Construction of a Planar Distance Oracle with Õ(1) Query Time. ICALP Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, Oren Weimann
2025	J	`jnl`	Faster Construction of a Planar Distance Oracle with Õ(1) Query Time. CoRR Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, Oren Weimann
2025	A*	`conf`	Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. STOC Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann
2025	J	`jnl`	Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. CoRR Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann
2024	A	`conf`	Brief Announcement: Distributed Maximum Flow in Planar Graphs. DISC Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann
2024	J	`jnl`	Distributed Maximum Flow in Planar Graphs. CoRR Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann
2024	J	`jnl`	Minimum Cut in O(mlog Theory Comput. Syst. Pawel Gawrychowski, Shay Mozes, Oren Weimann
2024	A*	`conf`	Õptimal Dynamic Time Warping on Run-Length Encoded Strings. ICALP Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
2023	J	`jnl`	Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen
2023	J	`jnl`	Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings. CoRR Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
2023	J	`jnl`	What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs? CoRR Amir Abboud, Shay Mozes, Oren Weimann
2023	A	`conf`	What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? ESA Amir Abboud, Shay Mozes, Oren Weimann
2023	J	`jnl`	Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs. CoRR Shiri Chechik, Shay Mozes, Oren Weimann
2022	J	`jnl`	Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2022	B	`conf`	Improved Compression of the Okamura-Seymour Metric. ISAAC Shay Mozes, Nathan Wallheimer, Oren Weimann
2022	J	`jnl`	Improved Compression of the Okamura-Seymour Metric. CoRR Shay Mozes, Nathan Wallheimer, Oren Weimann
2022	C	`conf`	On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2022	B	`conf`	The Fine-Grained Complexity of Episode Matching. CPM Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
2021	J	`jnl`	A Conditional Lower Bound for Episode Matching. CoRR Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
2021	—	`conf`	A Note on a Recent Algorithm for Minimum Cut. SOSA Pawel Gawrychowski, Shay Mozes, Oren Weimann
2021	A*	`conf`	An Almost Optimal Edit Distance Oracle. ICALP Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2021	J	`jnl`	An Almost Optimal Edit Distance Oracle. CoRR Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2021	B	`conf`	Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2021	J	`jnl`	Fault-Tolerant Distance Labeling for Planar Graphs. CoRR Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2021	A*	`conf`	Planar Negative SODA Pawel Gawrychowski, Shay Mozes, Oren Weimann
2021	J	`jnl`	Top Tree Compression of Tries. Algorithmica Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2021	J	`jnl`	Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n SIAM J. Comput. Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2020	B	`ed.`	31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, Copenhagen, Denmark, June 17-19, 2020 CPM Inge Li Gørtz, Oren Weimann
2020	J	`jnl`	A Note on a Recent Algorithm for Minimum Cut. CoRR Pawel Gawrychowski, Shay Mozes, Oren Weimann
2020	J	`jnl`	Compressed range minimum queries. Theor. Comput. Sci. Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann
2020	J	`jnl`	Incremental distance products via faulty shortest paths. Inf. Process. Lett. Oren Weimann, Raphael Yuster
2020	A*	`conf`	Minimum Cut in O(m log² n) Time. ICALP Pawel Gawrychowski, Shay Mozes, Oren Weimann
2020	A*	`conf`	On the Fine-Grained Complexity of Parity Problems. ICALP Amir Abboud, Shon Feller, Oren Weimann
2020	J	`jnl`	On the Fine-Grained Complexity of Parity Problems. CoRR Amir Abboud, Shon Feller, Oren Weimann
2020	J	`jnl`	Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. ACM Trans. Algorithms Pawel Gawrychowski, Shay Mozes, Oren Weimann
2020	J	`jnl`	Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can). ACM Trans. Algorithms Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2019	A*	`conf`	Almost optimal distance oracles for planar graphs. STOC Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2019	J	`jnl`	Compressed Range Minimum Queries. CoRR Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann
2019	J	`jnl`	Minimum Cut in O(m log CoRR Pawel Gawrychowski, Shay Mozes, Oren Weimann
2019	B	`conf`	Top Tree Compression of Tries. ISAAC Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2019	J	`jnl`	Top Tree Compression of Tries. CoRR Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann
2018	A*	`conf`	A Faster Construction of Greedy Consensus Trees. ICALP Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann
2018	A*	`conf`	A Faster FPTAS for #Knapsack. ICALP Pawel Gawrychowski, Liran Markin, Oren Weimann
2018	J	`jnl`	A Faster FPTAS for #Knapsack. CoRR Pawel Gawrychowski, Liran Markin, Oren Weimann
2018	J	`jnl`	Almost Optimal Distance Oracles for Planar Graphs. CoRR Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2018	A*	`conf`	Better Tradeoffs for Exact Distance Oracles in Planar Graphs. SODA Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen
2018	C	`conf`	Compressed Range Minimum Queries. SPIRE Seungbum Jo, Shay Mozes, Oren Weimann
2018	J	`jnl`	Faster shortest paths in dense distance graphs, with applications. Theor. Comput. Sci. Shay Mozes, Yahav Nussbaum, Oren Weimann
2018	J	`jnl`	Improved bounds for randomized preemptive online matching. Inf. Comput. Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2018	A*	`conf`	Minimum Cut of Directed Planar Graphs in SODA Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann
2018	A*	`conf`	Near-Optimal Compression for the Planar Graph Metric. SODA Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2018	A	`conf`	Near-Optimal Distance Emulator for Planar Graphs. ESA Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2018	J	`jnl`	Near-Optimal Distance Emulator for Planar Graphs. CoRR Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2018	J	`jnl`	The nearest colored node in a tree. Theor. Comput. Sci. Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
2018	A*	`conf`	Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). SODA Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2018	A*	`conf`	Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic SODA Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2017	J	`jnl`	A Faster Construction of Phylogenetic Consensus Trees. CoRR Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann
2017	J	`jnl`	Better Tradeoffs for Exact Distance Oracles in Planar Graphs. CoRR Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen
2017	A	`conf`	Dispersion on Trees. ESA Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann
2017	J	`jnl`	Dispersion on Trees. CoRR Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann
2017	J	`jnl`	Near-Optimal Compression for the Planar Graph Metric. CoRR Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2017	A*	`conf`	Optimal Distance Labeling Schemes for Trees. PODC Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann
2017	J	`jnl`	Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). CoRR Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2017	J	`jnl`	Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n CoRR Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2016	J	`jnl`	Approximating the Diameter of Planar Graphs in Near Linear Time. ACM Trans. Algorithms Oren Weimann, Raphael Yuster
2016	C	`conf`	Bookmarks in Grammar-Compressed Strings. SPIRE Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann
2016	J	`jnl`	Longest common extensions in trees. Theor. Comput. Sci. Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2016	J	`jnl`	Optimal Distance Labeling Schemes for Trees. CoRR Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann
2016	B	`conf`	The Nearest Colored Node in a Tree. CPM Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
2015	J	`jnl`	Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2015	B	`conf`	Longest Common Extensions in Trees. CPM Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2015	J	`jnl`	Minimum Cut of Directed Planar Graphs in O(nloglogn) Time. CoRR Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, Oren Weimann
2015	J	`jnl`	Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2015	—	`conf`	Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. ICALP (1) Pawel Gawrychowski, Shay Mozes, Oren Weimann
2015	J	`jnl`	Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search. CoRR Pawel Gawrychowski, Shay Mozes, Oren Weimann
2015	J	`jnl`	Tree compression with top trees. Inf. Comput. Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2014	J	`jnl`	Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
2014	J	`jnl`	Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann
2014	—	`conf`	Consequences of Faster Alignment of Sequences. ICALP (1) Amir Abboud, Virginia Vassilevska Williams, Oren Weimann
2014	J	`jnl`	Faster Shortest Paths in Dense Distance Graphs, with Applications. CoRR Shay Mozes, Yahav Nussbaum, Oren Weimann
2014	—	`conf`	Improved Submatrix Maximum Queries in Monge Matrices. ICALP (1) Pawel Gawrychowski, Shay Mozes, Oren Weimann
2014	J	`jnl`	Longest Common Extensions in Trees. CoRR Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2014	J	`jnl`	On Cartesian Trees and Range Minimum Queries. Algorithmica Erik D. Demaine, Gad M. Landau, Oren Weimann
2014	J	`jnl`	Towards optimal packed string matching. Theor. Comput. Sci. Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
2013	—	`conf`	Approximating the Diameter of Planar Graphs in Near Linear Time. ICALP (1) Oren Weimann, Raphael Yuster
2013	J	`jnl`	Binary Jumbled Pattern Matching on Trees and Tree-Like Structures CoRR Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013	A	`conf`	Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013	A	`conf`	Improved Bounds for Online Preemptive Matching. STACS Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2013	J	`jnl`	Improved Submatrix Maximum Queries in Monge Matrices. CoRR Shay Mozes, Oren Weimann
2013	J	`jnl`	On approximating string selection problems with outliers. Theor. Comput. Sci. Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2013	J	`jnl`	Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication. ACM Trans. Algorithms Oren Weimann, Raphael Yuster
2013	J	`jnl`	The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2013	J	`jnl`	Tree Compression with Top Trees CoRR Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2013	—	`conf`	Tree Compression with Top Trees. ICALP (1) Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2013	J	`jnl`	Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2012	J	`jnl`	Improved Bounds for Online Preemptive Matching CoRR Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2012	B	`conf`	Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. CPM Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster
2012	J	`jnl`	On Approximating String Selection Problems with Outliers CoRR Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2012	B	`conf`	On Approximating String Selection Problems with Outliers. CPM Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2011	J	`jnl`	A note on exact distance labeling. Inf. Process. Lett. Oren Weimann, David Peleg
2011	J	`jnl`	Approximating the Diameter of Planar Graphs in Near Linear Time CoRR Oren Weimann, Raphael Yuster
2011	—	`conf`	Distance Oracles for Vertex-Labeled Graphs. ICALP (2) Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster
2011	J	`jnl`	Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
2011	—	`conf`	Optimal Packed String Matching. FSTTCS Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
2011	A*	`conf`	Random Access to grammar-Compressed Strings. SODA Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2011	J	`jnl`	The Stackelberg Minimum Spanning Tree Game. Algorithmica Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2010	J	`jnl`	Computing the Girth of a Planar Graph in O(n logn) Time. SIAM J. Discret. Math. Oren Weimann, Raphael Yuster
2010	—	`conf`	Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications Gad M. Landau, Dekel Tsur, Oren Weimann
2010	J	`jnl`	Random Access to Grammar Compressed Strings CoRR Philip Bille, Gad M. Landau, Oren Weimann
2010	A*	`conf`	Replacement Paths via Fast Matrix Multiplication. FOCS Oren Weimann, Raphael Yuster
2010	J	`jnl`	Shortest paths in directed planar graphs with negative lengths: A linear-space ACM Trans. Algorithms Philip N. Klein, Shay Mozes, Oren Weimann
2010	J	`jnl`	Unified Compression-Based Acceleration of Edit-Distance Computation CoRR Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009	J	`jnl`	A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression CoRR Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009	A	`conf`	A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009	—	`—`	Accelerating dynamic programming. Oren Weimann
2009	J	`jnl`	An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
2009	—	`conf`	Computing the Girth of a Planar Graph in ICALP (1) Oren Weimann, Raphael Yuster
2009	B	`conf`	Fast RNA Structure Alignment for Crossing Input Structures. CPM Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
2009	J	`jnl`	Fast algorithms for computing tree LCS. Theor. Comput. Sci. Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
2009	—	`conf`	On Cartesian Trees and Range Minimum Queries. ICALP (1) Erik D. Demaine, Gad M. Landau, Oren Weimann
2009	A*	`conf`	Shortest paths in directed planar graphs with negative lengths: a linear-space SODA Philip N. Klein, Shay Mozes, Oren Weimann
2009	J	`jnl`	Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
2009	J	`jnl`	The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs CoRR Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2009	—	`conf`	The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. WINE Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2008	B	`conf`	Fast Algorithms for Computing Tree LCS. CPM Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
2008	A*	`conf`	Finding an optimal tree searching strategy in linear time. SODA Shay Mozes, Krzysztof Onak, Oren Weimann
2007	A*	`conf`	An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
2007	C	`conf`	Indexing a Dictionary for Subset Matching Queries. SPIRE Gad M. Landau, Dekel Tsur, Oren Weimann
2007	J	`jnl`	Locality and Gaps in RNA Comparison. J. Comput. Biol. Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang
2007	B	`conf`	Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
2007	J	`jnl`	The Stackelberg Minimum Spanning Tree Game CoRR Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2007	B	`conf`	The Stackelberg Minimum Spanning Tree Game. WADS Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2006	J	`jnl`	An O(n^3)-Time Algorithm for Tree Edit Distance CoRR Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
2006	B	`conf`	Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
2005	J	`jnl`	Gene Proximity Analysis across Whole Genomes via PQ Trees J. Comput. Biol. Gad M. Landau, Laxmi Parida, Oren Weimann
2005	C	`conf`	Normalized Similarity of RNA Sequences. SPIRE Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
2005	B	`conf`	Using PQ Trees for Comparative Genomics. CPM Gad M. Landau, Laxmi Parida, Oren Weimann