Toshiya Mashima

According to our database, Toshiya Mashima authored at least 14 papers between 1992 and 2018.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2018

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

2012

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

2009

Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree.

Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009

2006

On Minimum <i>k</i>-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

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

2005

A 2-Approximation Algorithm to (<i>k</i> + 1)-Edge-Connect a Specified Set of Vertices in a <i>k</i>-Edge-Connected Graph.

Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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

Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph.

Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree.

Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

2003

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

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

1995

Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem.

Toshiya Mashima, Toshimasa Watanabe

Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995

1993

Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph.

Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph.

Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

1992

The k-Edge-Connectivity Augmentation Problem of Weighted Graphs.

Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka

Proceedings of the Algorithms and Computation, Third International Symposium, 1992