Author of the publication

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.

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

Finding All Useless Arcs in Directed Planar Graphs., , and . CoRR, (2017)Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary., , and . ESA, volume 244 of LIPIcs, page 17:1-17:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs., , , and . CoRR, (2023)Individual Preference Stability for Clustering., , , , , , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 197-246. PMLR, (2022)To Store or Not to Store: a graph theoretical approach for Dataset Versioning., , , , , and . CoRR, (2024)Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver., , , , , and . ICALP, volume 229 of LIPIcs, page 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Discovery and Matching Numerical Attributes in Data Lakes., , , , and . IEEE Big Data, page 423-432. IEEE, (2023)Constant Approximation for Individual Preference Stable Clustering., , , , , , and . CoRR, (2023)Multi-transversals for Triangles and the Tuza's Conjecture., , , and . SODA, page 1955-1974. SIAM, (2020)An nO(1/ϵ) Approximation Scheme For The Minimum Dominating Set In Unit Disk Graphs., and . JCSSE, page 1-5. IEEE, (2018)