A capacity scaling algorithm for convex cost submodular flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Edge-Splitting Problems with Demands
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Gross substitution, discrete convexity, and submodularity
Discrete Applied Mathematics - Submodularity
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
Discrete Applied Mathematics - Submodularity
Discrete Applied Mathematics - Submodularity
Pre-Emptive Scheduling Problems with Controllable Processing Times
Journal of Scheduling
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Optimal matching forests and valuated delta-matroids
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
ESA'11 Proceedings of the 19th European conference on Algorithms
Neighbor Systems and the Greedy Algorithm
SIAM Journal on Discrete Mathematics
Covering skew-supermodular functions by hypergraphs of minimum total size
Operations Research Letters
Two-machine open shop problem with controllable processing times
Discrete Optimization
A dual algorithm for submodular flow problems
Operations Research Letters
The constraint of difference and total dual integrality
Proceedings of the 17th Panhellenic Conference on Informatics
Note: Algorithms for finding a rooted (k, 1)-edge-connected orientation
Discrete Applied Mathematics
| Hi-index | 0.00 |