Toshimasa Watanabe

65 papers A 1B 6C 9Misc 2Journal 30Unranked 17
YearRankTypeTitle / Venue / Authors
2019 J jnl
Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Toshimasa Watanabe
2018 J jnl
Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Tadachika Oki, Toshiya Mashima, Toshimasa Watanabe
2013 J jnl
Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe
2013 J jnl
Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
2012 J jnl
A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints.
IEICE Trans. Inf. Syst.
Tadachika Oki, Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe
2012 Misc conf
Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems.
ICNC
Toshimasa Watanabe
2012 C conf
Performance comparison of approximation algorithms for the minimum weight vertex cover problem.
ISCAS
Satoshi Taoka, Toshimasa Watanabe
2011 J jnl
The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Toshimasa Watanabe
2010 Misc conf
A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints.
ICNC
Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe
2010 C conf
Heuristic algorithms for the marking construction problem of Petri nets.
ISCAS
Satoshi Taoka, Toshimasa Watanabe
2009 J jnl
Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Toshimasa Watanabe, Satoshi Taoka
2009 C conf
Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree.
ISCAS
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
2009 J jnl
Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
2008 J jnl
Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Daisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, Toshimasa Watanabe
2008 J jnl
Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe
2007 J jnl
Performance Comparison of Algorithms for the Dynamic Shortest Path Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Daisuke Takafuji, Takashi Iguchi, Toshimasa Watanabe
2006 C conf
An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets.
ISCAS
Satoru Shimada, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
2006 J jnl
Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase.
IEICE Trans. Inf. Syst.
Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe
2006 J jnl
Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Kazuya Watanabe, Toshimasa Watanabe
2006 J jnl
On Minimum
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
2006 J jnl
Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Toshimasa Watanabe
2005 J jnl
A 2-Approximation Algorithm to (
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
2005 J jnl
A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Takanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe
2005 — conf
Approximation algorithms for the rectilinear Steiner tree problem with obstacles.
ISCAS (2)
Makoto Fujimoto, Daisuke Takafuji, Toshimasa Watanabe
2005 — conf
Hierarchical extraction of a spanning planar subgraph maintaining clockwise directedness of cycles.
ISCAS (1)
Daisuke Takafuji, Toshimasa Watanabe
2005 J jnl
Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
2005 — conf
Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph.
ISCAS (3)
Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima
2005 — conf
Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree.
ISCAS (1)
Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe
2005 J jnl
Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Akihiro Taguchi, Atsushi Iriboshi, Satoshi Taoka, Toshimasa Watanabe
2005 J jnl
Special Section on Recent Advances in Circuits and Systems - Part 1.
IEICE Trans. Inf. Syst.
Takao Hinamoto, Toshimasa Watanabe
2005 J jnl
Special Section on Recent Advances in Circuits and Systems - Part 2.
IEICE Trans. Inf. Syst.
Takao Hinamoto, Toshimasa Watanabe
2003 J jnl
A 2-Approximation Algorithm 2-
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Makoto Tamura, Satoshi Taoka, Toshimasa Watanabe
2003 — conf
A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph.
ISCAS (3)
Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe
2003 — conf
A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets.
ICATPN
Satoshi Taoka, Shinji Furusato, Toshimasa Watanabe
2003 — conf
An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants.
ISCAS (3)
Akihiro Taguchi, Satoshi Taoka, Toshimasa Watanabe
2002 — conf
Efficient approximation algorithms for the maximum weight matching problem.
ISCAS (4)
Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe
2002 J jnl
Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Taoka, Katsushi Takano, Toshimasa Watanabe
2001 — conf
Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem.
ISCAS (5)
Tsutomu Yamaoki, Satoshi Taoka, Toshimasa Watanabe
2001 B conf
Two efficient methods for computing Petri net invariants.
SMC
Katsishi Takano, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
2000 B conf
A new heuristic method for solving the minimum initial marking problem of Petri nets.
SMC
Shin'ichiro Nishi, Satoshi Taoka, Toshimasa Watanabe
2000 — conf
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph.
IFIP TCS
Satoshi Taoka, Toshimasa Watanabe
2000 C conf
k-edge-connectivity augmentation problem with upper bounds on edge multiplicity.
ISCAS
Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe
1999 — conf
A heuristic algorithm SDS for scheduling with timed Petri nets.
ISCAS (6)
Masahiro Yamauchi, Toshimasa Watanabe
1999 — conf
Extracting nonplanar connections in a terminal-vertex graph.
ISCAS (6)
Miuno Toshihiro, Toshimasa Watanabe
1998 B conf
A heuristic algorithm FSD for the legal firing sequence problem of Petri nets.
SMC
Masahiro Yamauchi, Toshimasa Watanabe
1998 B conf
Extracting siphons containing a specified set of places in a Petri net.
SMC
Masahiro Yamauchi, Shinji Tanimoto, Toshimasa Watanabe
1997 — conf
MULTI-PRIDE: a system for supporting multi-layered printed wiring board design.
ASP-DAC
Toshimasa Watanabe
1995 C conf
Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem.
ISCAS
Toshiya Mashima, Toshimasa Watanabe
1994 C conf
An Approximation Algorithm for the Legal Firing Sequence Problem of Petri Nets.
ISCAS
Masahiro Yamauchi, Toshimasa Watanabe
1994 B conf
Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph.
ISAAC
Satoshi Taoka, Toshimasa Watanabe
1993 J jnl
A Minimum 3-Connectivity Augmentation of a Graph.
J. Comput. Syst. Sci.
Toshimasa Watanabe, Akira Nakamura
1993 C conf
Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph.
ISCAS
Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka
1993 C conf
Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph.
ISCAS
Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima
1993 — conf
New Priority-Lists for Scheduling in Timed Petri Nets.
Application and Theory of Petri Nets
Toshimasa Watanabe, Masahiro Yamauchi
1992 B conf
The k-Edge-Connectivity Augmentation Problem of Weighted Graphs.
ISAAC
Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka
1991 — conf
On Periodic Schedules for Deterministically Timed Petri Net Systems.
PNPM
Kenji Onaga, Manuel Silva, Toshimasa Watanabe
1990 J jnl
A smallest augmentation to 3-connect a graph.
Discret. Appl. Math.
Toshimasa Watanabe, Akira Nakamura
1990 — conf
Graph Augmentation Problems for a Specified Set of Vertices.
SIGAL International Symposium on Algorithms
Toshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura
1989 A conf
FEM-TORUS: token driven processor torus array functional simulation and performance evaluation - for processing of finite-element-method matrices.
ICS
Kenji Onaga, Yoshiki Fushimi, Toshimasa Watanabe
1989 — conf
Legal Firing Sequence and Related Problems of Petri Nets.
PNPM
Toshimasa Watanabe, Yukata Mizobata, Kenji Onaga
1987 J jnl
Edge-Connectivity Augmentation Problems.
J. Comput. Syst. Sci.
Toshimasa Watanabe, Akira Nakamura
1983 J jnl
On the NP-hardness of edge-deletion and -contraction problems.
Discret. Appl. Math.
Toshimasa Watanabe, Tadashi Ae, Akira Nakamura
1983 J jnl
On the Transformation Semigroups of Finite Automata.
J. Comput. Syst. Sci.
Toshimasa Watanabe, Akira Nakamura
1981 J jnl
On the removal of forbidden graphs by edge-deletion or by edge-contraction.
Discret. Appl. Math.
Toshimasa Watanabe, Tadashi Ae, Akira Nakamura
1977 J jnl
The Amalgamation of Automata.
J. Comput. Syst. Sci.
Toshimasa Watanabe, Shoichi Noguchi