Oren Weimann
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
57
Venues
13
Active years
2005–2026
Best venue rank
A*
Where they publish
Papers
57 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SIROCCO | A Simple Distributed Deterministic Planar Separator. | Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann |
| 2026 | SOFSEM | Maintaining a Kingdom in a Tournament. | Oren Weimann, Raphael Yuster |
| 2025 | ICALP | Faster Construction of a Planar Distance Oracle with (1) Query Time. | Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, Oren Weimann |
| 2025 | PODC | Distributed Maximum Flow in Planar Graphs. | Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann |
| 2025 | STOC | ptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. | Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann |
| 2024 | ICALP | ptimal Dynamic Time Warping on Run-Length Encoded Strings. | Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann |
| 2023 | ESA | What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? | Amir Abboud, Shay Mozes, Oren Weimann |
| 2022 | CPM | The Fine-Grained Complexity of Episode Matching. | Philip Bille, Inge Li Grtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann |
| 2022 | ISAAC | Improved Compression of the Okamura-Seymour Metric. | Shay Mozes, Nathan Wallheimer, Oren Weimann |
| 2022 | SPIRE | On the Hardness of Computing the Edit Distance of Shallow Trees. | Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2021 | ICALP | An Almost Optimal Edit Distance Oracle. | Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2021 | SODA | Planar Negative | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2021 | SIROCCO | Fault-Tolerant Distance Labeling for Planar Graphs. | Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2020 | ICALP | On the Fine-Grained Complexity of Parity Problems. | Amir Abboud, Shon Feller, Oren Weimann |
| 2020 | ICALP | Minimum Cut in O(m log² n) Time. | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2019 | ISAAC | Top Tree Compression of Tries. | Philip Bille, Pawel Gawrychowski, Inge Li Grtz, Gad M. Landau, Oren Weimann |
| 2019 | STOC | Almost optimal distance oracles for planar graphs. | Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | ESA | Near-Optimal Distance Emulator for Planar Graphs. | Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | ICALP | A Faster Construction of Greedy Consensus Trees. | Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann |
| 2018 | ICALP | A Faster FPTAS for #Knapsack. | Pawel Gawrychowski, Liran Markin, Oren Weimann |
| 2018 | SODA | Near-Optimal Compression for the Planar Graph Metric. | Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | SODA | Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). | Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | SODA | Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic | Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann |
| 2018 | SODA | Better Tradeoffs for Exact Distance Oracles in Planar Graphs. | Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen |
| 2018 | SODA | Minimum Cut of Directed Planar Graphs in | Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann |
| 2018 | SPIRE | Compressed Range Minimum Queries. | Seungbum Jo, Shay Mozes, Oren Weimann |
| 2017 | ESA | Dispersion on Trees. | Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann |
| 2017 | PODC | Optimal Distance Labeling Schemes for Trees. | Ofer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann |
| 2016 | CPM | The Nearest Colored Node in a Tree. | Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann |
| 2016 | SPIRE | Bookmarks in Grammar-Compressed Strings. | Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann |
| 2015 | CPM | Longest Common Extensions in Trees. | Philip Bille, Pawel Gawrychowski, Inge Li Grtz, Gad M. Landau, Oren Weimann |
| 2015 | ICALP | Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2014 | ICALP | Consequences of Faster Alignment of Sequences. | Amir Abboud, Virginia Vassilevska Williams, Oren Weimann |
| 2014 | ICALP | Improved Submatrix Maximum Queries in Monge Matrices. | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2013 | ESA | Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. | Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann |
| 2013 | ICALP | Tree Compression with Top Trees. | Philip Bille, Inge Li Grtz, Gad M. Landau, Oren Weimann |
| 2013 | ICALP | Approximating the Diameter of Planar Graphs in Near Linear Time. | Oren Weimann, Raphael Yuster |
| 2013 | STACS | Improved Bounds for Online Preemptive Matching. | Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann |
| 2012 | CPM | On Approximating String Selection Problems with Outliers. | Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann |
| 2012 | CPM | Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. | Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster |
| 2011 | ICALP | Distance Oracles for Vertex-Labeled Graphs. | Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster |
| 2011 | SODA | Random Access to grammar-Compressed Strings. | Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann |
| 2010 | FOCS | Replacement Paths via Fast Matrix Multiplication. | Oren Weimann, Raphael Yuster |
| 2009 | CPM | Fast RNA Structure Alignment for Crossing Input Structures. | Rolf Backofen, Gad M. Landau, Mathias Mhl, Dekel Tsur, Oren Weimann |
| 2009 | ICALP | On Cartesian Trees and Range Minimum Queries. | Erik D. Demaine, Gad M. Landau, Oren Weimann |
| 2009 | ICALP | Computing the Girth of a Planar Graph in | Oren Weimann, Raphael Yuster |
| 2009 | SODA | Shortest paths in directed planar graphs with negative lengths: a linear-space | Philip N. Klein, Shay Mozes, Oren Weimann |
| 2009 | STACS | A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. | Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann |
| 2008 | CPM | Fast Algorithms for Computing Tree LCS. | Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson |
| 2008 | SODA | Finding an optimal tree searching strategy in linear time. | Shay Mozes, Krzysztof Onak, Oren Weimann |
| 2007 | CPM | Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. | Shay Mozes, Oren Weimann, Michal Ziv-Ukelson |
| 2007 | ICALP | An Optimal Decomposition Algorithm for Tree Edit Distance. | Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann |
| 2007 | SPIRE | Indexing a Dictionary for Subset Matching Queries. | Gad M. Landau, Dekel Tsur, Oren Weimann |
| 2007 | WADS | The Stackelberg Minimum Spanning Tree Game. | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenal Joret, Stefan Langerman, Ilan Newman, Oren Weimann |
| 2006 | CPM | Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. | Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann |
| 2005 | CPM | Using PQ Trees for Comparative Genomics. | Gad M. Landau, Laxmi Parida, Oren Weimann |
| 2005 | SPIRE | Normalized Similarity of RNA Sequences. | Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann |