The following publications are possibly variants of this publication:
- Minimum Augmentation to k-Edge-Connect Specified Vertices of a GraphSatoshi Taoka, Toshimasa Watanabe. isaac 1994: 217-225
- 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]
- Graph Augmentation Problems for a Specified Set of VerticesToshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura. sigal 1990: 378-387
- On Minimum ::::k::::-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-DegreeToshiya Mashima, Satoshi Taoka, Toshimasa Watanabe. ieicet, 89-A(4):1042-1048, 2006. [doi]
- 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]
- 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]
- A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graphSatoshi Taoka, Toshiya Mashima, Toshimasa Watanabe. iscas 2003: 236-239 [doi]
- A 2-Approximation Algorithm to (::::k:::: + 1)-Edge-Connect a Specified Set of Vertices in a ::::k::::-Edge-Connected GraphToshiya Mashima, Satoshi Taoka, Toshimasa Watanabe. ieicet, 88-A(5):1290-1300, 2005. [doi]