Author of the publication

Faster Cut Sparsification of Weighted Graphs.

, and . ICALP, volume 229 of LIPIcs, page 61:1-61:19. 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

Minimum Cost Flow in the CONGEST Model.. SIROCCO, volume 13892 of Lecture Notes in Computer Science, page 406-426. Springer, (2023)Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique., and . PODC, page 75-78. ACM, (2023)An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions., , and . OPODIS, volume 217 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fast 2-Approximate All-Pairs Shortest Paths., , , , , and . SODA, page 4728-4757. SIAM, (2024)Faster Cut Sparsification of Weighted Graphs., and . Algorithmica, 85 (4): 929-964 (April 2023)Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model.. PODC, page 71-74. ACM, (2023)The Laplacian Paradigm in the Broadcast Congested Clique., and . PODC, page 335-344. ACM, (2022)A Framework for Distributed Quantum Queries in the CONGEST Model., and . PODC, page 109-119. ACM, (2022)Faster Cut Sparsification of Weighted Graphs., and . ICALP, volume 229 of LIPIcs, page 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths., , , and . ICALP, volume 297 of LIPIcs, page 58:1-58:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)