Author of the publication

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.

 

Other publications of authors with the same name

Incremental distance products via faulty shortest paths., and . Inf. Process. Lett., (2020)Fault-Tolerant Distance Labeling for Planar Graphs., , , , and . SIROCCO, volume 12810 of Lecture Notes in Computer Science, page 315-333. Springer, (2021)An Almost Optimal Edit Distance Oracle., , , and . ICALP, volume 198 of LIPIcs, page 48:1-48:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Fine-Grained Complexity of Episode Matching., , , , and . CPM, volume 223 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Improved Compression of the Okamura-Seymour Metric., , and . ISAAC, volume 248 of LIPIcs, page 27:1-27:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Minimum Cut in O(mlog 2 n) Time., , and . Theory Comput. Syst., 68 (4): 814-834 (August 2024)Planar Negative k-Cycle., , and . SODA, page 2717-2724. SIAM, (2021)Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings., , , and . CoRR, (2023)Õ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)Almost optimal distance oracles for planar graphs., , , and . STOC, page 138-151. ACM, (2019)