The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. - Toshimasa Watanabe; Toshiya Mashima; Satoshi Taoka (ISAAC, 1992)

Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. - Toshimasa Watanabe; Toshiya Mashima; Satoshi Taoka (ISCAS, 1993)

Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. - Toshimasa Watanabe; Satoshi Taoka; Toshiya Mashima (ISCAS, 1993)

Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem. - Toshiya Mashima; Toshimasa Watanabe (ISCAS, 1995)

A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph. - Satoshi Taoka; Toshiya Mashima; Toshimasa Watanabe (ISCAS (3), 2003)

Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. - Toshiya Mashima; Takanori Fukuoka; Satoshi Taoka; Toshimasa Watanabe (ISCAS (1), 2005)

Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. - Toshimasa Watanabe; Satoshi Taoka; Toshiya Mashima (ISCAS (3), 2005)

A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase. - Takanori Fukuoka; Toshiya Mashima; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

A 2-Approximation Algorithm to (k + 1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph. - Toshiya Mashima; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase. - Toshiya Mashima; Takanori Fukuoka; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Inf. Syst., 2006)

On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree. - Toshiya Mashima; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree. - Toshiya Mashima; Satoshi Taoka; Toshimasa Watanabe (ISCAS, 2009)

A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints. - Tadachika Oki; Satoshi Taoka; Toshiya Mashima; Toshimasa Watanabe (IEICE Trans. Inf. Syst., 2012)

Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One. - Satoshi Taoka; Tadachika Oki; Toshiya Mashima; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)