Author of the publication

Hardness of Token Swapping on Trees.

, , , , , , , , and . ESA, volume 244 of LIPIcs, page 3:1-3:15. 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

Algorithms and Hardness for Diameter in Dynamic Graphs., , , , and . ICALP, volume 132 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs., and . CoRR, (2020)Hardness of Token Swapping on Trees., , , , , , , , and . ESA, volume 244 of LIPIcs, page 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product., , , and . SODA, page 3311-3331. SIAM, (2022)Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles., , , and . FOCS, page 290-300. IEEE, (2022)New algorithms and hardness for incremental single-source shortest paths in directed graphs., , and . STOC, page 153-166. ACM, (2020)Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights?, , and . ITCS, volume 287 of LIPIcs, page 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Approximation Algorithms for Min-Distance Problems., , , , , and . ICALP, volume 132 of LIPIcs, page 46:1-46:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Lower Bounds for Dynamic Distributed Task Allocation., and . ICALP, volume 168 of LIPIcs, page 99:1-99:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems., , , and . ICALP, volume 132 of LIPIcs, page 47:1-47:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)