A separator theorem for graphs of bounded genus
Journal of Algorithms
Data structures and network algorithms
Data structures and network algorithms
Faster scaling algorithms for network problems
SIAM Journal on Computing
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Shallow excluded minors and improved graph decompositions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
Graph Algorithms
Global Price Updates Help
Finding maximum flows in undirected graphs seems easier than bipartite matching
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Better random sampling algorithms for flows in undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Random sampling in residual graphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Maximum Bipartite Flow in Networks with Adaptive Channel Width
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On computing minimum (s,t)-cuts in digraphs
Information Processing Letters
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science
| Hi-index | 0.00 |