Skip to content

Author

L. Roditty

We have 2 of 115 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Hardness Results for Approximate Distance Labeling in Sparse Graphs

Distance labeling schemes assign short labels to the vertices of a graph so that distances between pairs of vertices can be recovered, exactly or approximately, from the two corresponding labels alone. For sparse graphs, Kosowski, Uzna\'nski, and Viennot [PODC'2019] showed that, assuming the hardness of the Sum-Index c...

T. Kopelowitz, Ariel Korin, L. Roditty · 0 citations
Sep 2026

A Faster Undirected Single-Source Shortest Path Algorithm

A faster algorithm for SSSP in weighted undirected graphs, giving the first improvement in running time since the FOCS'23 breakthrough of Duan, Mao, Shu, and Yin is presented.

Avi Kadria, L. Roditty · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.