4 papers:
STOC-1998-HolmLT #algorithm- Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.
- STOC-1994-Rauch #data type
- Improved data structures for fully dynamic biconnectivity (MR), pp. 686–695.
- STOC-1992-KhullerV #approximate #graph
- Biconnectivity Approximations and Graph Carvings (SK, UV), pp. 759–770.
ICALP-1991-GalilI #component #graph #maintenance- Maintaining Biconnected Components of Dynamic Planar Graphs (ZG, GFI), pp. 339–350.
