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

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs., and . CoRR, (2020)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)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)Closing the Gap Between Directed Hopsets and Shortcut Sets., and . SODA, page 163-182. SIAM, (2023)Algorithms and Hardness for Approximating the Diameter of a Graph.. Massachusetts Institute of Technology, USA, (2021)Online List Labeling: Breaking the log2n Barrier., , , , , and . FOCS, page 980-990. IEEE, (2022)Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial., , and . DISC, volume 209 of LIPIcs, page 33:1-33:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)