| 2025 | ICALP | Faster Construction of a Planar Distance Oracle with (1) Query Time. | Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, 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 | ISAAC | A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities. | Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes |
| 2021 | ISAAC | Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. | Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen |
| 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 | CPM | Dynamic String Alignment. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes |
| 2020 | ICALP | Minimum Cut in O(m log² n) Time. | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2019 | SODA | Exact Distance Oracles for Planar Graphs with Failing Vertices. | Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka |
| 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 | 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 | WAOA | Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. | Itay Laish, Shay Mozes |
| 2016 | CPM | The Nearest Colored Node in a Tree. | Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann |
| 2015 | ICALP | Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2015 | STOC | A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. | Kyle Fox, Philip N. Klein, Shay Mozes |
| 2015 | WAOA | Efficient Vertex-Label Distance Oracles for Planar Graphs. | Shay Mozes, Eyal E. Skop |
| 2014 | ICALP | Improved Submatrix Maximum Queries in Monge Matrices. | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2013 | ALENEX | Short and Simple Cycle Separators in Planar Graphs. | Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer |
| 2013 | STOC | Structured recursive separator decompositions for planar graphs in linear time. | Philip N. Klein, Shay Mozes, Christian Sommer |
| 2012 | SODA | Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. | Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir |
| 2012 | SODA | Exact distance oracles for planar graphs. | Shay Mozes, Christian Sommer |
| 2011 | FOCS | Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. | Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen |
| 2011 | WADS | Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time. | Philip N. Klein, Shay Mozes |
| 2010 | ESA | Shortest Paths in Planar Graphs with Real Lengths in | Shay Mozes, Christian Wulff-Nilsen |
| 2010 | WAOA | The Train Delivery Problem - Vehicle Routing Meets Bin Packing. | Aparna Das, Claire Mathieu, Shay Mozes |
| 2009 | SODA | Shortest paths in directed planar graphs with negative lengths: a linear-space | Philip N. Klein, Shay Mozes, Oren Weimann |
| 2009 | WABI | Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes. | Crystal L. Kahn, Shay Mozes, Benjamin J. Raphael |
| 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 |