Author of the publication

New Additive Approximations for Shortest Paths and Cycles.

, , , , and . ICALP, volume 229 of LIPIcs, page 50:1-50:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made., , , and . STOC, page 375-388. ACM, (2016)Fast approximation algorithms for the diameter and radius of sparse graphs., and . STOC, page 515-524. ACM, (2013)Fine-grained Algorithms and Complexity.. ICDT, volume 98 of LIPIcs, page 1:1-1:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Metatheorems for Dynamic Weighted Matching., and . ITCS, volume 67 of LIPIcs, page 58:1-58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles., , and . SIAM J. Comput., 50 (5): 1627-1662 (2021)A Refined Laser Method and Faster Matrix Multiplication., and . SODA, page 522-539. SIAM, (2021)Better Distance Preservers and Additive Spanners., and . SODA, page 855-872. SIAM, (2016)Improved girth approximation in weighted undirected graphs., , , , and . SODA, page 2242-2255. SIAM, (2023)Who Can Win a Single-Elimination Tournament?, , and . AAAI, page 516-522. AAAI Press, (2016)Fixing a Tournament.. AAAI, page 895-900. AAAI Press, (2010)