Author of the publication

Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds.

, and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 517-528. Springer, (2015)

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

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds., , , and . CoRR, (2023)A tight (non-combinatorial) conditional lower bound for Klee's Measure Problem in 3D.. FOCS, page 555-566. IEEE, (2022)Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs., , , , and . SoCG, volume 224 of LIPIcs, page 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Tight Analysis of Randomized Rumor Spreading in Complete Graphs., and . ANALCO, page 82-91. SIAM, (2014)Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm., , and . ACM Trans. Algorithms, 17 (3): 25:1-25:42 (2021)On the Fine-Grained Complexity of One-Dimensional Dynamic Programming., , and . ICALP, volume 80 of LIPIcs, page 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances., and . Theor. Comput. Sci., (2015)Secretary markets with local information., , , , and . Distributed Comput., 32 (5): 361-378 (2019)When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation., , and . ESA, volume 173 of LIPIcs, page 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance., , and . SoCG, volume 129 of LIPIcs, page 17:1-17:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)