Shay Mozes

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 67

Top Topics

Top Venues

Theor. Comput. Sci.

ACM Trans. Algorithms

Publications

Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
Õptimal Dynamic Time Warping on Run-Length Encoded Strings. ICALP (2024)
Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings. CoRR (2023)
Amir Abboud, Shay Mozes, Oren Weimann
What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs? CoRR (2023)
Amir Abboud, Shay Mozes, Oren Weimann
What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? ESA (2023)
Shiri Chechik, Shay Mozes, Oren Weimann
Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs. CoRR (2023)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70 (2) (2023)
Shay Mozes, Nathan Wallheimer, Oren Weimann
Improved Compression of the Okamura-Seymour Metric. CoRR (2022)
Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
The Fine-Grained Complexity of Episode Matching. CPM (2022)
Shay Mozes, Nathan Wallheimer, Oren Weimann
Improved Compression of the Okamura-Seymour Metric. ISAAC (2022)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE (2022)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. 918 (2022)
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
Exact Distance Oracles for Planar Graphs with Failing Vertices. ACM Trans. Algorithms 18 (2) (2022)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-Tolerant Distance Labeling for Planar Graphs. CoRR (2021)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
A Note on a Recent Algorithm for Minimum Cut. SOSA (2021)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
-Cycle. SODA (2021)
Dor Mesica, Shay Mozes
A Note on Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities. CoRR (2021)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
An Almost Optimal Edit Distance Oracle. CoRR (2021)
Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
A Conditional Lower Bound for Episode Matching. CoRR (2021)
Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes
A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities. ISAAC (2021)
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO (2021)
Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
) Time. SIAM J. Comput. 50 (2) (2021)
Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. ISAAC (2021)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
An Almost Optimal Edit Distance Oracle. ICALP (2021)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
A Note on a Recent Algorithm for Minimum Cut. CoRR (2020)
Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. CoRR (2020)
Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann
Compressed range minimum queries. Theor. Comput. Sci. 812 (2020)
Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can). ACM Trans. Algorithms 16 (4) (2020)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Minimum Cut in O(m log² n) Time. ICALP (2020)
Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes
Dynamic String Alignment. CPM (2020)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. ACM Trans. Algorithms 16 (2) (2020)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
n) Time. CoRR (2019)
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
Exact Distance Oracles for Planar Graphs with Failing Vertices. SODA (2019)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Almost optimal distance oracles for planar graphs. STOC (2019)
Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann
Compressed Range Minimum Queries. CoRR (2019)
Itay Laish, Shay Mozes
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. Theory Comput. Syst. 63 (8) (2019)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Almost Optimal Distance Oracles for Planar Graphs. CoRR (2018)
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
Exact Distance Oracles for Planar Graphs with Failing Vertices. CoRR (2018)
Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
) Time. SODA (2018)
Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Near-Optimal Distance Emulator for Planar Graphs. ESA (2018)
Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. SODA (2018)
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
The nearest colored node in a tree. Theor. Comput. Sci. 710 (2018)
Shay Mozes, Yahav Nussbaum, Oren Weimann
Faster shortest paths in dense distance graphs, with applications. Theor. Comput. Sci. 711 (2018)
Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Near-Optimal Compression for the Planar Graph Metric. SODA (2018)
Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). SODA (2018)
Shay Mozes, Eyal E. Skop
Efficient Vertex-Label Distance Oracles for Planar Graphs. Theory Comput. Syst. 62 (2) (2018)
Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann
) Time. SODA (2018)
Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Near-Optimal Distance Emulator for Planar Graphs. CoRR (2018)
Seungbum Jo, Shay Mozes, Oren Weimann
Compressed Range Minimum Queries. SPIRE (2018)
Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Near-Optimal Compression for the Planar Graph Metric. CoRR (2017)
Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann
Dispersion on Trees. CoRR (2017)
Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
) time. CoRR (2017)
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. SIAM J. Comput. 46 (4) (2017)
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Trans. Algorithms 13 (2) (2017)
Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. CoRR (2017)
Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann
Dispersion on Trees. ESA (2017)
Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). CoRR (2017)
Itay Laish, Shay Mozes
Efficient Approximate Distance Oracles for Vertex-Labeled Planar Graphs. CoRR (2017)
Itay Laish, Shay Mozes
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. WAOA (2017)
Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer
Short and Simple Cycle Separators in Planar Graphs. ACM J. Exp. Algorithmics 21 (1) (2016)
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
The Nearest Colored Node in a Tree. CPM (2016)
Shay Mozes, Eyal E. Skop
Efficient Vertex-Label Distance Oracles for Planar Graphs. CoRR (2015)
Shay Mozes, Eyal E. Skop
Efficient Vertex-Label Distance Oracles for Planar Graphs. WAOA (2015)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search. CoRR (2015)
Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, Oren Weimann
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time. CoRR (2015)
Kyle Fox, Philip N. Klein, Shay Mozes
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. STOC (2015)
Kyle Fox, Philip N. Klein, Shay Mozes
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. CoRR (2015)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. ICALP (1) (2015)
Pawel Gawrychowski, Shay Mozes, Oren Weimann
Improved Submatrix Maximum Queries in Monge Matrices. ICALP (1) (2014)
Shay Mozes, Yahav Nussbaum, Oren Weimann
Faster Shortest Paths in Dense Distance Graphs, with Applications. CoRR (2014)
Shay Mozes, Oren Weimann
Improved Submatrix Maximum Queries in Monge Matrices. CoRR (2013)
Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer
Short and Simple Cycle Separators in Planar Graphs. ALENEX (2013)
Philip N. Klein, Shay Mozes, Christian Sommer
Structured recursive separator decompositions for planar graphs in linear time. STOC (2013)
Philip N. Klein, Shay Mozes, Christian Sommer
Structured Recursive Separator Decompositions for Planar Graphs in Linear Time CoRR (2012)
Shay Mozes, Christian Sommer
Exact distance oracles for planar graphs. SODA (2012)
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA (2012)
Philip N. Klein, Shay Mozes
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time CoRR (2011)
Philip N. Klein, Shay Mozes
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time. WADS (2011)
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time CoRR (2011)
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS (2011)
Shay Mozes, Christian Sommer
Exact Shortest Path Queries for Planar Graphs Using Linear Space CoRR (2010)
Crystal L. Kahn, Shay Mozes, Benjamin J. Raphael
Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes. Algorithms Mol. Biol. 5 (2010)
Philip N. Klein, Shay Mozes, Oren Weimann
)-time algorithm. ACM Trans. Algorithms 6 (2) (2010)
Philip N. Klein, Shay Mozes
Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time CoRR (2010)
Shay Mozes
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time CoRR (2010)
Shay Mozes, Christian Wulff-Nilsen
) Time. ESA (2) (2010)
Aparna Das, Claire Mathieu, Shay Mozes
The Train Delivery Problem - Vehicle Routing Meets Bin Packing. WAOA (2010)
Crystal L. Kahn, Shay Mozes, Benjamin J. Raphael
Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes. WABI (2009)
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6 (1) (2009)
Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica 54 (3) (2009)
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
Fast algorithms for computing tree LCS. Theor. Comput. Sci. 410 (43) (2009)
Shay Mozes, Christian Wulff-Nilsen
Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time CoRR (2009)
Philip N. Klein, Shay Mozes, Oren Weimann
)-time algorithm. SODA (2009)
Shay Mozes, Krzysztof Onak, Oren Weimann
Finding an optimal tree searching strategy in linear time. SODA (2008)
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
Fast Algorithms for Computing Tree LCS. CPM (2008)
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM (2007)
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP (2007)
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
An O(n^3)-Time Algorithm for Tree Edit Distance CoRR (2006)