The following publications are possibly variants of this publication:
- 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]
- 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 Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degreeToshiya Mashima, Satoshi Taoka, Toshimasa Watanabe. iscas 2009: 2934-2937 [doi]
- Minimum Augmentation to k-Edge-Connect Specified Vertices of a GraphSatoshi Taoka, Toshimasa Watanabe. isaac 1994: 217-225
- Minimum-cost augmentation to 3-edge-connect all specified vertices in a graphToshimasa Watanabe, Satoshi Taoka, Toshiya Mashima. iscas 1993: 2311-2314
- 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]
- Graph Augmentation Problems for a Specified Set of VerticesToshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura. sigal 1990: 378-387