206 citations · 303 across the 29 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs
Shiri Chechik, Shay Mozes, Oren Weimann
We show how to assign labels of size to the vertices of a directed planar graph , such that from the labels of any three vertices we can deduce in $\tilde…
cs.DS2023
What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs?
Amir Abboud, Shay Mozes, Oren Weimann
The Voronoi diagrams technique was introduced by Cabello to compute the diameter of planar graphs in subquadratic time. We present novel applications of this technique in static, f…
cs.DS2023
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings
Itai Boneh, Shay Golan, Shay Mozes +1
We give an time algorithm for computing the exact Dynamic Time Warping distance between two strings whose run-length encoding is of size at most . This matches (…