The Amalgamation of Automata. - Toshimasa Watanabe; Shoichi Noguchi (J. Comput. Syst. Sci., 1977)

On the removal of forbidden graphs by edge-deletion or by edge-contraction. - Toshimasa Watanabe; Tadashi Ae; Akira Nakamura (Discret. Appl. Math., 1981)

On the NP-hardness of edge-deletion and -contraction problems. - Toshimasa Watanabe; Tadashi Ae; Akira Nakamura (Discret. Appl. Math., 1983)

On the Transformation Semigroups of Finite Automata. - Toshimasa Watanabe; Akira Nakamura (J. Comput. Syst. Sci., 1983)

Edge-Connectivity Augmentation Problems. - Toshimasa Watanabe; Akira Nakamura (J. Comput. Syst. Sci., 1987)

FEM-TORUS: token driven processor torus array functional simulation and performance evaluation - for processing of finite-element-method matrices. - Kenji Onaga; Yoshiki Fushimi; Toshimasa Watanabe (ICS, 1989)

Legal Firing Sequence and Related Problems of Petri Nets. - Toshimasa Watanabe; Yukata Mizobata; Kenji Onaga (PNPM, 1989)

Graph Augmentation Problems for a Specified Set of Vertices. - Toshimasa Watanabe; Yasuhiko Higashi; Akira Nakamura (SIGAL International Symposium on Algorithms, 1990)

A smallest augmentation to 3-connect a graph. - Toshimasa Watanabe; Akira Nakamura (Discret. Appl. Math., 1990)

On Periodic Schedules for Deterministically Timed Petri Net Systems. - Kenji Onaga; Manuel Silva; Toshimasa Watanabe (PNPM, 1991)

The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. - Toshimasa Watanabe; Toshiya Mashima; Satoshi Taoka (ISAAC, 1992)

New Priority-Lists for Scheduling in Timed Petri Nets. - Toshimasa Watanabe; Masahiro Yamauchi (Application and Theory of Petri Nets, 1993)

Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. - Toshimasa Watanabe; Toshiya Mashima; Satoshi Taoka (ISCAS, 1993)

Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. - Toshimasa Watanabe; Satoshi Taoka; Toshiya Mashima (ISCAS, 1993)

A Minimum 3-Connectivity Augmentation of a Graph. - Toshimasa Watanabe; Akira Nakamura (J. Comput. Syst. Sci., 1993)

Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. - Satoshi Taoka; Toshimasa Watanabe (ISAAC, 1994)

An Approximation Algorithm for the Legal Firing Sequence Problem of Petri Nets. - Masahiro Yamauchi; Toshimasa Watanabe (ISCAS, 1994)

Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem. - Toshiya Mashima; Toshimasa Watanabe (ISCAS, 1995)

MULTI-PRIDE: a system for supporting multi-layered printed wiring board design. - Toshimasa Watanabe (ASP-DAC, 1997)

Extracting siphons containing a specified set of places in a Petri net. - Masahiro Yamauchi; Shinji Tanimoto; Toshimasa Watanabe (SMC, 1998)

A heuristic algorithm FSD for the legal firing sequence problem of Petri nets. - Masahiro Yamauchi; Toshimasa Watanabe (SMC, 1998)

Extracting nonplanar connections in a terminal-vertex graph. - Miuno Toshihiro; Toshimasa Watanabe (ISCAS (6), 1999)

A heuristic algorithm SDS for scheduling with timed Petri nets. - Masahiro Yamauchi; Toshimasa Watanabe (ISCAS (6), 1999)

The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph. - Satoshi Taoka; Toshimasa Watanabe (IFIP TCS, 2000)

k-edge-connectivity augmentation problem with upper bounds on edge multiplicity. - Daisuke Takafuji; Satoshi Taoka; Toshimasa Watanabe (ISCAS, 2000)

A new heuristic method for solving the minimum initial marking problem of Petri nets. - Shin'ichiro Nishi; Satoshi Taoka; Toshimasa Watanabe (SMC, 2000)

Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem. - Tsutomu Yamaoki; Satoshi Taoka; Toshimasa Watanabe (ISCAS (5), 2001)

Two efficient methods for computing Petri net invariants. - Katsishi Takano; Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (SMC, 2001)

Efficient approximation algorithms for the maximum weight matching problem. - Daisuke Takafuji; Satoshi Taoka; Toshimasa Watanabe (ISCAS (4), 2002)

Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants. - Satoshi Taoka; Katsushi Takano; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets. - Satoshi Taoka; Shinji Furusato; Toshimasa Watanabe (ICATPN, 2003)

An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants. - Akihiro Taguchi; Satoshi Taoka; Toshimasa Watanabe (ISCAS (3), 2003)

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 (ISCAS (3), 2003)

A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph. - Makoto Tamura; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Approximation algorithms for the rectilinear Steiner tree problem with obstacles. - Makoto Fujimoto; Daisuke Takafuji; Toshimasa Watanabe (ISCAS (2), 2005)

Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. - Toshiya Mashima; Takanori Fukuoka; Satoshi Taoka; Toshimasa Watanabe (ISCAS (1), 2005)

Hierarchical extraction of a spanning planar subgraph maintaining clockwise directedness of cycles. - Daisuke Takafuji; Toshimasa Watanabe (ISCAS (1), 2005)

Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. - Toshimasa Watanabe; Satoshi Taoka; Toshiya Mashima (ISCAS (3), 2005)

A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase. - Takanori Fukuoka; Toshiya Mashima; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Special Section on Recent Advances in Circuits and Systems - Part 1. - Takao Hinamoto; Toshimasa Watanabe (IEICE Trans. Inf. Syst., 2005)

Special Section on Recent Advances in Circuits and Systems - Part 2. - Takao Hinamoto; Toshimasa Watanabe (IEICE Trans. Inf. Syst., 2005)

A 2-Approximation Algorithm to (k + 1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph. - Toshiya Mashima; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants. - Akihiro Taguchi; Atsushi Iriboshi; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets. - Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets. - Satoru Shimada; Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (ISCAS, 2006)

Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase. - Toshiya Mashima; Takanori Fukuoka; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Inf. Syst., 2006)

On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree. - Toshiya Mashima; Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs. - Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs. - Satoshi Taoka; Kazuya Watanabe; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Performance Comparison of Algorithms for the Dynamic Shortest Path Problem. - Satoshi Taoka; Daisuke Takafuji; Takashi Iguchi; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs. - Daisuke Takafuji; Satoshi Taoka; Yasunori Nishikawa; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem. - Satoshi Taoka; Daisuke Takafuji; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree. - Toshiya Mashima; Satoshi Taoka; Toshimasa Watanabe (ISCAS, 2009)

Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets. - Satoru Ochiiwa; Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets. - Toshimasa Watanabe; Satoshi Taoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints. - Tadachika Oki; Satoshi Taoka; Toshimasa Watanabe (ICNC, 2010)

Heuristic algorithms for the marking construction problem of Petri nets. - Satoshi Taoka; Toshimasa Watanabe (ISCAS, 2010)

The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms. - Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems. - Toshimasa Watanabe (ICNC, 2012)

Performance comparison of approximation algorithms for the minimum weight vertex cover problem. - Satoshi Taoka; Toshimasa Watanabe (ISCAS, 2012)

A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints. - Tadachika Oki; Satoshi Taoka; Toshiya Mashima; Toshimasa Watanabe (IEICE Trans. Inf. Syst., 2012)

Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets. - Satoru Ochiiwa; Satoshi Taoka; Masahiro Yamauchi; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs. - Satoshi Taoka; Daisuke Takafuji; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One. - Satoshi Taoka; Tadachika Oki; Toshiya Mashima; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph. - Satoshi Taoka; Toshimasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)