The following publications are possibly variants of this publication:
- Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degreeToshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe. iscas 2005: 752-755 [doi]
- Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree IncreaseToshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe. ieicet, 89-D(2):751-762, 2006. [doi]
- Minimum Augmentation to k-Edge-Connect Specified Vertices of a GraphSatoshi Taoka, Toshimasa Watanabe. isaac 1994: 217-225
- Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degreeToshiya Mashima, Satoshi Taoka, Toshimasa Watanabe. iscas 2009: 2934-2937 [doi]
- A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree IncreaseTakanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe. ieicet, 88-A(4):954-963, 2005. [doi]
- Minimum-cost augmentation to 3-edge-connect all specified vertices in a graphToshimasa Watanabe, Satoshi Taoka, Toshiya Mashima. iscas 1993: 2311-2314
- ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a GraphMakoto Tamura, Satoshi Taoka, Toshimasa Watanabe. ieiceta, 86-A(4):822-828, 2003. [doi]