Satoshi Taoka

	2008
24		Daisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, Toshimasa Watanabe: Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs. IEICE Transactions 91-A(4): 1129-1139 (2008)
23		Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe: Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem. IEICE Transactions 91-A(4): 1140-1149 (2008)
	2007
22		Satoshi Taoka, Daisuke Takafuji, Takashi Iguchi, Toshimasa Watanabe: Performance Comparison of Algorithms for the Dynamic Shortest Path Problem. IEICE Transactions 90-A(4): 847-856 (2007)
	2006
21		S. Shimada, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe: An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets. ISCAS 2006
20		Satoshi Taoka, Toshimasa Watanabe: Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs. IEICE Transactions 89-A(11): 3216-3226 (2006)
19		Toshiya 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)
18		Satoshi Taoka, Kazuya Watanabe, Toshimasa Watanabe: Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs. IEICE Transactions 89-A(4): 1049-1057 (2006)
17		Toshiya 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
16		Toshiya 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
15		Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima: Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. ISCAS (3) 2005: 2231-2234
14		Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe: Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets. IEICE Transactions 88-A(11): 3051-3061 (2005)
13		Takanori 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)
12		Akihiro Taguchi, Atsushi Iriboshi, Satoshi Taoka, Toshimasa Watanabe: Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants. IEICE Transactions 88-A(4): 964-971 (2005)
11		Toshiya 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
10		Satoshi Taoka, Shinji Furusato, Toshimasa Watanabe: A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets. ICATPN 2003: 417-439
9		Akihiro Taguchi, Satoshi Taoka, Toshimasa Watanabe: An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants. ISCAS (3) 2003: 172-175
8		Satoshi 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
	2002
7		Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe: Efficient approximation algorithms for the maximum weight matching problem. ISCAS (4) 2002: 457-460
	2001
6		T. Yamaoki, Satoshi Taoka, Toshimasa Watanabe: Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem. ISCAS (5) 2001: 153-156
	2000
5		Satoshi Taoka, Toshimasa Watanabe: The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph. IFIP TCS 2000: 169-185
	1994
4		Satoshi Taoka, Toshimasa Watanabe: Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. ISAAC 1994: 217-225
	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

1	Takanori Fukuoka	[13] [16] [17]
2	Shinji Furusato	[10]
3	Takashi Iguchi	[22]
4	Atsushi Iriboshi	[12]
5	Toshiya Mashima	[1] [2] [3] [8] [11] [13] [15] [16] [17] [19]
6	Yasunori Nishikawa	[24]
7	S. Shimada	[21]
8	Akihiro Taguchi	[9] [12]
9	Daisuke Takafuji	[7] [22] [23] [24]
10	Kazuya Watanabe	[18]
11	Toshimasa Watanabe	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24]
12	T. Yamaoki	[6]
13	Masahiro Yamauchi	[14] [21]