Author of the publication

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

, and . Int. J. Comput. Geom. Appl., 27 (1-2): 85-120 (2017)

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

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)The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds., , , and . CoRR, (2023)Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise., , and . CoRR, (2023)Walking the dog fast in practice: Algorithm engineering of the Fréchet distance., , and . J. Comput. Geom., 12 (1): 70-108 (2021)The Time Complexity of Fully Sparse Matrix Multiplication., , , and . CoRR, (2023)Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts., , and . SODA, page 1126-1145. SIAM, (2019)Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability., , and . SODA, page 2902-2921. SIAM, (2019)The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds., , , and . ITCS, volume 287 of LIPIcs, page 22:1-22:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Fine-Grained Completeness for Optimization in P., , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 9:1-9:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)