Shay Mozes

105 papers A* 21A 4B 13C 3Journal 58Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Distances in Planar Graphs are Almost for Free!
CoRR
Shay Mozes, Daniel Prigan
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 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
Exact Distance Oracles for Planar Graphs with Failing Vertices.
ACM Trans. Algorithms
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
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 B conf
A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities.
ISAAC
Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes
2021 J jnl
A Note on Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities.
CoRR
Dor Mesica, Shay Mozes
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 B conf
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs.
ISAAC
Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen
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 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 B conf
Dynamic String Alignment.
CPM
Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes
2020 A* conf
Minimum Cut in O(m log² n) Time.
ICALP
Pawel Gawrychowski, Shay Mozes, 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
2020 J jnl
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs.
CoRR
Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen
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
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs.
Theory Comput. Syst.
Itay Laish, Shay Mozes
2019 A* conf
Exact Distance Oracles for Planar Graphs with Failing Vertices.
SODA
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
2019 J jnl
Minimum Cut in O(m log
CoRR
Pawel Gawrychowski, Shay Mozes, 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
Efficient Vertex-Label Distance Oracles for Planar Graphs.
Theory Comput. Syst.
Shay Mozes, Eyal E. Skop
2018 J jnl
Exact Distance Oracles for Planar Graphs with Failing Vertices.
CoRR
Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka
2018 J jnl
Faster shortest paths in dense distance graphs, with applications.
Theor. Comput. Sci.
Shay Mozes, Yahav Nussbaum, 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
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
Efficient Approximate Distance Oracles for Vertex-Labeled Planar Graphs.
CoRR
Itay Laish, Shay Mozes
2017 B conf
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs.
WAOA
Itay Laish, Shay Mozes
2017 J jnl
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.
SIAM J. Comput.
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
2017 J jnl
Near-Optimal Compression for the Planar Graph Metric.
CoRR
Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2017 J jnl
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications.
ACM Trans. Algorithms
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
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 Õ(n
CoRR
Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2016 — ch.
Recursive Separator Decompositions for Planar Graphs.
Encyclopedia of Algorithms
Shay Mozes
2016 J jnl
Short and Simple Cycle Separators in Planar Graphs.
ACM J. Exp. Algorithmics
Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer
2016 B conf
The Nearest Colored Node in a Tree.
CPM
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
2015 A* conf
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection.
STOC
Kyle Fox, Philip N. Klein, Shay Mozes
2015 J jnl
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection.
CoRR
Kyle Fox, Philip N. Klein, Shay Mozes
2015 B conf
Efficient Vertex-Label Distance Oracles for Planar Graphs.
WAOA
Shay Mozes, Eyal E. Skop
2015 J jnl
Efficient Vertex-Label Distance Oracles for Planar Graphs.
CoRR
Shay Mozes, Eyal E. Skop
2015 J jnl
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time.
CoRR
Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, 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
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
2013 — —
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.
Shay Mozes
2013 J jnl
Improved Submatrix Maximum Queries in Monge Matrices.
CoRR
Shay Mozes, Oren Weimann
2013 A conf
Short and Simple Cycle Separators in Planar Graphs.
ALENEX
Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer
2013 A* conf
Structured recursive separator decompositions for planar graphs in linear time.
STOC
Philip N. Klein, Shay Mozes, Christian Sommer
2012 A* conf
Exact distance oracles for planar graphs.
SODA
Shay Mozes, Christian Sommer
2012 J jnl
Structured Recursive Separator Decompositions for Planar Graphs in Linear Time
CoRR
Philip N. Klein, Shay Mozes, Christian Sommer
2012 A* conf
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications.
SODA
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
2011 J jnl
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
CoRR
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
2011 A* conf
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.
FOCS
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
2011 B conf
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time.
WADS
Philip N. Klein, Shay Mozes
2011 J jnl
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time
CoRR
Philip N. Klein, Shay Mozes
2010 J jnl
Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes.
Algorithms Mol. Biol.
Crystal L. Kahn, Shay Mozes, Benjamin J. Raphael
2010 J jnl
Exact Shortest Path Queries for Planar Graphs Using Linear Space
CoRR
Shay Mozes, Christian Sommer
2010 J jnl
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time
CoRR
Shay Mozes
2010 J jnl
Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time
CoRR
Philip N. Klein, Shay Mozes
2010 — conf
Shortest Paths in Planar Graphs with Real Lengths in
ESA (2)
Shay Mozes, Christian Wulff-Nilsen
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 B conf
The Train Delivery Problem - Vehicle Routing Meets Bin Packing.
WAOA
Aparna Das, Claire Mathieu, Shay Mozes
2009 J jnl
An optimal decomposition algorithm for tree edit distance.
ACM Trans. Algorithms
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
2009 C conf
Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes.
WABI
Crystal L. Kahn, Shay Mozes, Benjamin J. Raphael
2009 J jnl
Fast algorithms for computing tree LCS.
Theor. Comput. Sci.
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson
2009 J jnl
Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time
CoRR
Shay Mozes, Christian Wulff-Nilsen
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
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 B conf
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.
CPM
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
2006 J jnl
An O(n^3)-Time Algorithm for Tree Edit Distance
CoRR
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann