| Publication | Date of Publication | Type |
|---|
| Deterministic near-linear time minimum cut in weighted graphs | 2024-11-28 | Paper |
Local flow partitioning for faster edge connectivity
SIAM Journal on Computing | 2020-01-21 | Paper |
Local flow partitioning for faster edge connectivity
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Unified acceleration method for packing and covering problems via diameter reduction
(available as arXiv preprint) | 2017-12-19 | Paper |
| Approximating the solution to mixed packing and covering LPs in parallel \(\widetilde O(\varepsilon^{-3})\) time | 2017-12-19 | Paper |
Faster shortest-path algorithms for planar graphs
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM | 2015-11-11 | Paper |
Graph partitioning using single commodity flows
Journal of the ACM | 2015-11-11 | Paper |
Approximate load balancing on dynamic and asynchronous networks
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Excluded minors, network decomposition, and multicommodity flow
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
| Distributed algorithms for multicommodity flow problems via approximate steepest descent framework | 2014-12-18 | Paper |
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Expander flows, geometric embeddings and graph partitioning
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 1775394 (Why is no real title available?) | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1775442 (Why is no real title available?) | 2002-09-17 | Paper |
Computing Vertex Connectivity: New Bounds from Old Techniques
Journal of Algorithms | 2000-06-22 | Paper |
| scientific article; zbMATH DE number 1304266 (Why is no real title available?) | 1999-06-17 | Paper |
Work-preserving emulations of fixed-connection networks
Journal of the ACM | 1998-01-22 | Paper |
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences | 1997-10-28 | Paper |
| scientific article; zbMATH DE number 1003278 (Why is no real title available?) | 1997-08-03 | Paper |
Approximation Algorithms for Steiner and Directed Multicuts
Journal of Algorithms | 1997-07-06 | Paper |
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
Combinatorica | 1996-04-16 | Paper |
Randomized Routing and Sorting on Fixed-Connection Networks
Journal of Algorithms | 1995-03-09 | Paper |
Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
Combinatorica | 1994-08-11 | Paper |
