( en | de | ru )

 

Disambiguation of "Mozes, Shay"

Author of the publication

copydeleteadd this publication to your clipboard
Planar Negative k-Cycle.

, , and . SODA, page 2717-2724. SIAM, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mózes Gálffy

Viktoria Mozes

Shay Maymon

Shay Artzi

Alexey Shaytan

 

Other publications of authors with the same name

Structured recursive separator decompositions for planar graphs in linear time., , and . STOC, page 505-514. ACM, (2013)Exact distance oracles for planar graphs., and . SODA, page 209-222. SIAM, (2012)Õptimal Dynamic Time Warping on Run-Length Encoded Strings., , , and . ICALP, volume 297 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Short and Simple Cycle Separators in Planar Graphs., , , and . ACM Journal of Experimental Algorithmics, 21 (1): 2.2:1-2.2:24 (2016)Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs., and . WAOA, volume 10787 of Lecture Notes in Computer Science, page 269-284. Springer, (2017)Efficient Vertex-Label Distance Oracles for Planar Graphs., and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 97-109. Springer, (2015)Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings., , , and . CoRR, (2023)Planar Negative k-Cycle., , and . SODA, page 2717-2724. SIAM, (2021)Dynamic String Alignment., , and . CPM, volume 161 of LIPIcs, page 9:1-9:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities., , , and . ISAAC, volume 212 of LIPIcs, page 72:1-72:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)