An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Computing edge-connectivity in multigraphs and capacitated graphs
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
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Two recent algorithms for the global minimum cut problem
ACM SIGACT News
Journal of the ACM (JACM)
A note on the minimization of symmetric and general submodular functions
Discrete Applied Mathematics - Submodularity
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
SFO: A Toolbox for Submodular Function Optimization
The Journal of Machine Learning Research
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
Operations Research Letters
Separation of partition inequalities for the (1,2)-survivable network design problem
Operations Research Letters
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |