An o(nm log n) algorithm for maximum network flow

Parallel algorithms for minimum cuts and maximum flows in planar networks

Journal of the ACM (JACM)

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)

A data structure for dynamic trees

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Finding safe paths in a faulty environment

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing

An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing