Toshiya Mashima

14 papers B 1C 4Journal 6Unranked 3
YearRankTypeTitle / Venue / Authors
2018 J jnl
Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Tadachika Oki, Toshiya Mashima, Toshimasa Watanabe
2012 J jnl
A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints.
IEICE Trans. Inf. Syst.
Tadachika Oki, Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe
2009 C conf
Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree.
ISCAS
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
2006 J jnl
Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase.
IEICE Trans. Inf. Syst.
Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe
2006 J jnl
On Minimum
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
2005 J jnl
A 2-Approximation Algorithm to (
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
2005 J jnl
A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Takanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
2005 — conf
Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph.
ISCAS (3)
Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima
2005 — conf
Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree.
ISCAS (1)
Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe
2003 — conf
A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph.
ISCAS (3)
Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe
1995 C conf
Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem.
ISCAS
Toshiya Mashima, Toshimasa Watanabe
1993 C conf
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph.
ISCAS
Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka
1993 C conf
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph.
ISCAS
Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima
1992 B conf
The k-Edge-Connectivity Augmentation Problem of Weighted Graphs.
ISAAC
Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka