Augmenting undirected connectivity in RNC and in randomized Õ(n3) time

Matching is as easy as matrix inversion

Combinatorica

Edge-connectivity augmentation problems

Journal of Computer and System Sciences

A new approach to the maximum-flow problem

Journal of the ACM (JACM)

A matroid approach to finding edge connectivity and packing arborescences

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Applications of a poset representation to edge connectivity and graph rigidity

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science

Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics

A faster algorithm for finding the minimum cut in a graph

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

An Õ(n2) algorithm for minimum cuts

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Efficient splitting off algorithms for graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Global min-cuts in RNC, and other ramifications of a simple min-out algorithm

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms