| 2012 | ISCAS | Performance comparison of approximation algorithms for the minimum weight vertex cover problem. | Satoshi Taoka, Toshimasa Watanabe |
| 2010 | ISCAS | Heuristic algorithms for the marking construction problem of Petri nets. | Satoshi Taoka, Toshimasa Watanabe |
| 2009 | ISCAS | Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree. | Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe |
| 2006 | ISCAS | An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets. | Satoru Shimada, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe |
| 2005 | ISCAS | Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. | Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe |
| 2005 | ISCAS | Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. | Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima |
| 2003 | ISCAS | An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants. | Akihiro Taguchi, Satoshi Taoka, Toshimasa Watanabe |
| 2003 | ISCAS | 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 |
| 2002 | ISCAS | Efficient approximation algorithms for the maximum weight matching problem. | Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe |
| 2001 | ISCAS | Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem. | Tsutomu Yamaoki, Satoshi Taoka, Toshimasa Watanabe |
| 2001 | SMC | Two efficient methods for computing Petri net invariants. | Katsishi Takano, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe |
| 2000 | ISCAS | k-edge-connectivity augmentation problem with upper bounds on edge multiplicity. | Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe |
| 2000 | SMC | A new heuristic method for solving the minimum initial marking problem of Petri nets. | Shin'ichiro Nishi, Satoshi Taoka, Toshimasa Watanabe |
| 1994 | ISAAC | Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. | Satoshi Taoka, Toshimasa Watanabe |
| 1993 | ISCAS | Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. | Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka |
| 1993 | ISCAS | Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. | Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima |
| 1992 | ISAAC | The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. | Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka |