On submodular function minimization
Combinatorica
A strongly polynomial minimum cost circulation algorithm
Combinatorica
Generalized polymatroids and submodular flows
Mathematical Programming: Series A and B
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A unifying location model on tree graphs based on submodularity properties
Discrete Applied Mathematics
Block-Triangularizations of Partitioned Matrices under Similarity/Equivalence Transformations
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Matrix Analysis and Applications
A capacity scaling algorithm for convex cost submodular flows
Mathematical Programming: Series A and B
“The quickest transshipment problem”
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Improved algorithms for submodular function minimization and submodular flow
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Unified Framework for Approximating Multiway Partition Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On Testing Convexity and Submodularity
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Discrete Applied Mathematics
A note on Schrijver's submodular function minimization algorithm
Journal of Combinatorial Theory Series B
A note on the minimization of symmetric and general submodular functions
Discrete Applied Mathematics - Submodularity
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows
International Journal of Computer Vision
A max-flow/min-cut algorithm for a class of wireless networks
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An impossibility result for truthful combinatorial auctions with submodular valuations
Proceedings of the forty-third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |