| Publication | Date of Publication | Type |
|---|
| A simple and fast algorithm for fair cuts | 2025-12-22 | Paper |
Deterministic minimum cut in poly-logarithmic maximum flows
Journal of the ACM | 2025-10-23 | Paper |
Vertex connectivity in poly-logarithmic max-flows
Journal of the ACM | 2025-10-23 | Paper |
| All-pairs max-flow is no harder than single-pair max-flow: Gomory-Hu trees in almost-linear time | 2025-08-15 | Paper |
| Breaking the cubic barrier for all-pairs max-flow: Gomory-Hu tree in nearly quadratic time | 2025-08-15 | Paper |
| Minimum cuts in directed graphs via partial sparsification | 2025-08-13 | Paper |
| A nearly optimal all-pairs min-cuts algorithm in simple graphs | 2025-08-13 | Paper |
| A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond | 2025-08-12 | Paper |
| Deterministic min-cut in poly-logarithmic max-flows | 2025-08-12 | Paper |
| Faster minimum k-cut of a simple graph | 2025-08-12 | Paper |
| Faster exact and approximate algorithms for k-cut | 2025-08-12 | Paper |
| O(1) Steiner point removal in series-parallel graphs | 2025-06-19 | Paper |
| Deterministic near-linear time minimum cut in weighted graphs | 2024-11-28 | Paper |
| Beyond the quadratic time barrier for network unreliability | 2024-11-28 | Paper |
Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows
SIAM Journal on Computing | 2024-08-27 | Paper |
Matroid-based TSP rounding for half-integral solutions
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
| Augmenting edge connectivity via isolating cuts | 2024-07-19 | Paper |
| Near-linear time approximations for cut problems via fair cuts | 2024-05-14 | Paper |
| Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows | 2024-05-14 | Paper |
| A local search-based approach for set covering | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788345 (Why is no real title available?) | 2024-01-15 | Paper |
Edge connectivity augmentation in near-linear time
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Breaking the <i> n <sup>k</sup> </i> barrier for minimum <i>k</i> -cut on simple graphs
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Undirected (1+ <i>đ</i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Deterministic mincut in almost-linear time
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
A quasipolynomial (2 + <i>Δ</i> )-approximation for planar sparsest cut
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Vertex connectivity in poly-logarithmic max-flows
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Approximate GomoryâHu tree is faster than <i>n</i> â 1 max-flows
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i> <sup>â</sup> (2.7 <i>k</i> ) Time
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
(available as arXiv preprint) | 2023-09-20 | Paper |
Matroid-based TSP rounding for half-integral solutions
(available as arXiv preprint) | 2022-08-16 | Paper |
On the fixed-parameter tractability of capacitated clustering
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561535 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561283 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Faster distributed shortest path approximations via shortcuts
(available as arXiv preprint) | 2022-07-21 | Paper |
Optimal Bounds for the <i>k</i> -cut Problem
Journal of the ACM | 2022-03-31 | Paper |
Non-preemptive flow-time minimization via rejections
(available as arXiv preprint) | 2021-07-28 | Paper |
Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i>*(2.7<sup><i>k</i></sup>) Time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Faster parallel algorithm for approximate shortest path
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
The Karger-Stein algorithm is optimal for k-cut
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Planar diameter via metric compression
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
The number of minimum \(k\)-cuts: improving the Karger-Stein bound
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Losing Treewidth by Separating Subsets
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Minor excluded network families admit fast distributed algorithms
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Improved distributed algorithms for exact shortest paths
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| An FPT algorithm beating 2-approximation for \(k\)-cut | 2018-03-15 | Paper |
An FPT algorithm beating 2-approximation for \(k\)-cut
(available as arXiv preprint) | 2018-03-15 | Paper |
Lower central series of a free associative algebra over the integers and finite fields.
Journal of Algebra | 2013-06-24 | Paper |
