The connectivity carcass of a vertex subset in a graph and its incremental maintenance

A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Locally orientable graphs, cell structures, and a new algorithm for the incremental maintenance of connectivity carcasses

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory

A fast algorithm for computing steiner edge connectivity

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Compacting cuts: A new linear formulation for minimum cut

ACM Transactions on Algorithms (TALG)

Spanning cactus of a graph: Existence, extension, optimization, and approximation

Discrete Applied Mathematics