A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity

A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics

Using expander graphs to find vertex connectivity

Journal of the ACM (JACM)

Sparse connectivity certificates via MA orderings in graphs

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University

Dynamic bottleneck optimization for k-edge and 2-vertex connectivity

Information Processing Letters

Mining most frequently changing component in evolving graphs

World Wide Web