 | 2008 |
|---|
| 40 |       | 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) |
| 39 | | 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 |
|---|
| 38 | | 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 |
|---|
| 37 | | 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 |
| 36 | | 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) |
| 35 | | 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) |
| 34 | | 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) |
| 33 | | 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 |
|---|
| 32 | | Daisuke Takafuji,
Toshimasa Watanabe:
Hierarchical extraction of a spanning planar subgraph maintaining clockwise directedness of cycles.
ISCAS (1) 2005: 172-175 |
| 31 | | 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 |
| 30 | | Makoto Fujimoto,
Daisuke Takafuji,
Toshimasa Watanabe:
Approximation algorithms for the rectilinear Steiner tree problem with obstacles.
ISCAS (2) 2005: 1362-1365 |
| 29 | | Toshimasa Watanabe,
Satoshi Taoka,
Toshiya Mashima:
Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph.
ISCAS (3) 2005: 2231-2234 |
| 28 | | Satoshi Taoka,
Masahiro Yamauchi,
Toshimasa Watanabe:
Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets.
IEICE Transactions 88-A(11): 3051-3061 (2005) |
| 27 | | 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) |
| 26 | | 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) |
| 25 | | 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) |
| 24 | | Takao Hinamoto,
Toshimasa Watanabe:
Special Section on Recent Advances in Circuits and Systems - Part 1.
IEICE Transactions 88-D(7): 1321-1322 (2005) |
| 23 | | Takao Hinamoto,
Toshimasa Watanabe:
Special Section on Recent Advances in Circuits and Systems - Part 2.
IEICE Transactions 88-D(8): 1861-1862 (2005) |
| 2003 |
|---|
| 22 | | 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 |
| 21 | | 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 |
| 20 | | 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 |
|---|
| 19 | | Daisuke Takafuji,
Satoshi Taoka,
Toshimasa Watanabe:
Efficient approximation algorithms for the maximum weight matching problem.
ISCAS (4) 2002: 457-460 |
| 2001 |
|---|
| 18 | | 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 |
|---|
| 17 | | Satoshi Taoka,
Toshimasa Watanabe:
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph.
IFIP TCS 2000: 169-185 |
| 1995 |
|---|
| 16 |  | Toshiya Mashima,
Toshimasa Watanabe:
Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem.
ISCAS 1995: 155-158 |
| 1994 |
|---|
| 15 | | Satoshi Taoka,
Toshimasa Watanabe:
Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph.
ISAAC 1994: 217-225 |
| 14 | | Masahiro Yamauchi,
Toshimasa Watanabe:
An Approximation Algorithm for the Legal Firing Sequence Problem of Petri Nets.
ISCAS 1994: 181-184 |
| 1993 |
|---|
| 13 | | Toshimasa Watanabe,
Masahiro Yamauchi:
New Priority-Lists for Scheduling in Timed Petri Nets.
Application and Theory of Petri Nets 1993: 493-512 |
| 12 | | Toshimasa Watanabe,
Satoshi Taoka,
Toshiya Mashima:
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph.
ISCAS 1993: 2311-2314 |
| 11 | | Toshimasa Watanabe,
Toshiya Mashima,
Satoshi Taoka:
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph.
ISCAS 1993: 2556-2559 |
| 10 | | Toshimasa Watanabe,
Akira Nakamura:
A Minimum 3-Connectivity Augmentation of a Graph.
J. Comput. Syst. Sci. 46(1): 91-127 (1993) |
| 1992 |
|---|
| 9 | | Toshimasa Watanabe,
Toshiya Mashima,
Satoshi Taoka:
The k-Edge-Connectivity Augmentation Problem of Weighted Graphs.
ISAAC 1992: 31-40 |
| 1991 |
|---|
| 8 | | Kenji Onaga,
Manuel Silva,
Toshimasa Watanabe:
On Periodic Schedules for Deterministically Timed Petri Net Systems.
PNPM 1991: 210-215 |
| 1990 |
|---|
| 7 | | Toshimasa Watanabe,
Yasuhiko Higashi,
Akira Nakamura:
Graph Augmentation Problems for a Specified Set of Vertices.
SIGAL International Symposium on Algorithms 1990: 378-387 |
| 6 | | Toshimasa Watanabe,
Akira Nakamura:
A smallest augmentation to 3-connect a graph.
Discrete Applied Mathematics 28(2): 183-186 (1990) |
| 1989 |
|---|
| 5 | | Kenji Onaga,
Yoshiki Fushimi,
Toshimasa Watanabe:
FEM-TORUS: token driven processor torus array functional simulation and performance evaluation - for processing of finite-element-method matrices.
ICS 1989: 361-370 |
| 4 | | Toshimasa Watanabe,
Yukata Mizobata,
Kenji Onaga:
Legal Firing Sequence and Related Problems of Petri Nets.
PNPM 1989: 277-286 |
| 1987 |
|---|
| 3 | | Toshimasa Watanabe,
Akira Nakamura:
Edge-Connectivity Augmentation Problems.
J. Comput. Syst. Sci. 35(1): 96-144 (1987) |
| 1983 |
|---|
| 2 | | Toshimasa Watanabe,
Akira Nakamura:
On the Transformation Semigroups of Finite Automata.
J. Comput. Syst. Sci. 26(1): 107-138 (1983) |
| 1977 |
|---|
| 1 | | Toshimasa Watanabe,
Shoichi Noguchi:
The Amalgamation of Automata.
J. Comput. Syst. Sci. 15(1): 1-16 (1977) |
