Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
A faster algorithm for finding the minimum cut in a directed graph
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A new and improved algorithm for the 3-cut problem
Operations Research Letters
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Finding minimum 3-way cuts in hypergraphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Finding minimum 3-way cuts in hypergraphs
Information Processing Letters
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
Hi-index | 0.00 |