dblp.uni-trier.dewww.uni-trier.de

Toshiya Mashima

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2006
11EEToshiya Mashima, Satoshi Taoka, Toshimasa Watanabe: On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree. IEICE Transactions 89-A(4): 1042-1048 (2006)
10EEToshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe: Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase. IEICE Transactions 89-D(2): 751-762 (2006)
2005
9EEToshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe: Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. ISCAS (1) 2005: 752-755
8EEToshimasa Watanabe, Satoshi Taoka, Toshiya Mashima: Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. ISCAS (3) 2005: 2231-2234
7EETakanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe: A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase. IEICE Transactions 88-A(4): 954-963 (2005)
6EEToshiya Mashima, Satoshi Taoka, Toshimasa Watanabe: A 2-Approximation Algorithm to (k + 1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph. IEICE Transactions 88-A(5): 1290-1300 (2005)
2003
5EESatoshi Taoka, Toshiya Mashima, Toshimasa Watanabe: A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph. ISCAS (3) 2003: 236-239
1995
4 Toshiya Mashima, Toshimasa Watanabe: Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem. ISCAS 1995: 155-158
1993
3 Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima: Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. ISCAS 1993: 2311-2314
2 Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka: Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. ISCAS 1993: 2556-2559
1992
1 Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka: The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. ISAAC 1992: 31-40

Coauthor Index

1Takanori Fukuoka [7] [9] [10]
2Satoshi Taoka [1] [2] [3] [5] [6] [7] [8] [9] [10] [11]
3Toshimasa Watanabe [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)