Author of the publication

Sparsification of Directed Graphs via Cut Balance.

, , , and . ICALP, volume 198 of LIPIcs, page 45:1-45:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Augmenting Edge Connectivity via Isolating Cuts., , and . SODA, page 3237-3252. SIAM, (2022)Hypergraph Unreliability in Quasi-Polynomial Time., , and . STOC, page 1700-1711. ACM, (2024)Beyond the Quadratic Time Barrier for Network Unreliability., , , and . SODA, page 1542-1567. SIAM, (2024)Edge connectivity augmentation in near-linear time., , and . STOC, page 137-150. ACM, (2022)Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows., , , and . SODA, page 2449-2488. SIAM, (2023)Minimum Cuts in Directed Graphs via Partial Sparsification., , , , , and . FOCS, page 1147-1158. IEEE, (2021)Roundtrip Spanners with (2k-1) Stretch., , and . ICALP, volume 168 of LIPIcs, page 24:1-24:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Sparsification of Directed Graphs via Cut Balance., , , and . ICALP, volume 198 of LIPIcs, page 45:1-45:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)