Shay Mozes

According to our database1, Shay Mozes authored at least 45 papers between 2006 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Compressed range minimum queries.
Theor. Comput. Sci., 2020

2019
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs.
Theory Comput. Syst., 2019

Minimum Cut in O(m log2n) Time.
CoRR, 2019

Almost optimal distance oracles for planar graphs.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Exact Distance Oracles for Planar Graphs with Failing Vertices.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Faster shortest paths in dense distance graphs, with applications.
Theor. Comput. Sci., 2018

The nearest colored node in a tree.
Theor. Comput. Sci., 2018

Efficient Vertex-Label Distance Oracles for Planar Graphs.
Theory Comput. Syst., 2018

Compressed Range Minimum Queries.
Proceedings of the String Processing and Information Retrieval, 2018

Minimum Cut of Directed Planar Graphs in O(n log log n) Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Better Tradeoffs for Exact Distance Oracles in Planar Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can).
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Near-Optimal Compression for the Planar Graph Metric.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Near-Optimal Distance Emulator for Planar Graphs.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications.
ACM Trans. Algorithms, 2017

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.
SIAM J. Comput., 2017

Efficient Approximate Distance Oracles for Vertex-Labeled Planar Graphs.
CoRR, 2017

Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time.
CoRR, 2017

Dispersion on Trees.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Recursive Separator Decompositions for Planar Graphs.
Encyclopedia of Algorithms, 2016

Short and Simple Cycle Separators in Planar Graphs.
ACM Journal of Experimental Algorithmics, 2016

2015
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time.
CoRR, 2015

A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Improved Submatrix Maximum Queries in Monge Matrices.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Improved Submatrix Maximum Queries in Monge Matrices.
CoRR, 2013

Structured recursive separator decompositions for planar graphs in linear time.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
Exact distance oracles for planar graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

2010
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm.
ACM Trans. Algorithms, 2010

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time
CoRR, 2010

Exact Shortest Path Queries for Planar Graphs Using Linear Space
CoRR, 2010

Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time
CoRR, 2010

Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes.
Algorithms for Molecular Biology, 2010

The Train Delivery Problem - Vehicle Routing Meets Bin Packing.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time.
Proceedings of the Algorithms, 2010

2009
Fast algorithms for computing tree LCS.
Theor. Comput. Sci., 2009

An optimal decomposition algorithm for tree edit distance.
ACM Trans. Algorithms, 2009

Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time
CoRR, 2009

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.
Algorithmica, 2009

2008
Finding an optimal tree searching strategy in linear time.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
An O(n^3)-Time Algorithm for Tree Edit Distance
CoRR, 2006


  Loading...