On the number of small cuts in a graph

Minimum cuts in near-linear time

Journal of the ACM (JACM)

Polynomial-Time Separation of Simple Comb Inequalities

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

On the Number of Minimum Cuts in a Graph

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics

Planarity of the 2-Level Cactus Model

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

Mathematics of Operations Research

Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs

SIAM Journal on Discrete Mathematics