A capacity scaling algorithm for convex cost submodular flows

A faster algorithm for minimum cost submodular flows

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)

A fully combinatorial algorithm for submodular function minimization

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

A fully combinatorial algorithm for submodular function minimization

Journal of Combinatorial Theory Series B

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

A Faster Scaling Algorithm for Minimizing Submodular Functions

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

A push-relabel framework for submodular function minimization and applications to parametric optimization

Discrete Applied Mathematics - Submodularity

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Minimizing a sum of submodular functions

Discrete Applied Mathematics