- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j23 |      | Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe: Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets. IEICE Transactions 96-A(2): 540-553 (2013) |
| 2012 | ||
| j22 | | Tadachika Oki, Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe: A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints. IEICE Transactions 95-D(3): 769-777 (2012) |
| c29 | | Toshimasa Watanabe: Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems. ICNC 2012: 19-20 |
| c28 | | Satoshi Taoka, Toshimasa Watanabe: Performance comparison of approximation algorithms for the minimum weight vertex cover problem. ISCAS 2012: 632-635 |
| 2011 | ||
| j21 | | Satoshi Taoka, Toshimasa Watanabe: The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms. IEICE Transactions 94-A(9): 1833-1841 (2011) |
| 2010 | ||
| c27 | | Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe: A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints. ICNC 2010: 227-231 |
| c26 | | Satoshi Taoka, Toshimasa Watanabe: Heuristic algorithms for the marking construction problem of Petri nets. ISCAS 2010: 1344-1347 |
| 2009 | ||
| j20 | | Toshimasa Watanabe, Satoshi Taoka: Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets. IEICE Transactions 92-A(11): 2707-2716 (2009) |
| j19 | | Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe: Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets. IEICE Transactions 92-A(11): 2732-2744 (2009) |
| c25 | | Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe: Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree. ISCAS 2009: 2934-2937 |
| 2008 | ||
| j18 | | 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) |
| j17 | | 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 | ||
| j16 | | 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 | ||
| j15 | | 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) |
| j14 | | 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) |
| j13 | | 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) |
| j12 | | 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) |
| c24 | | 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 |
| 2005 | ||
| j11 | | 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) |
| j10 | | 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) |
| j9 | | 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) |
| j8 | | Takao Hinamoto, Toshimasa Watanabe: Special Section on Recent Advances in Circuits and Systems - Part 1. IEICE Transactions 88-D(7): 1321-1322 (2005) |
| j7 | | Takao Hinamoto, Toshimasa Watanabe: Special Section on Recent Advances in Circuits and Systems - Part 2. IEICE Transactions 88-D(8): 1861-1862 (2005) |
| j6 | | Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe: Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets. IEICE Transactions 88-A(11): 3051-3061 (2005) |
| c23 | | Daisuke Takafuji, Toshimasa Watanabe: Hierarchical extraction of a spanning planar subgraph maintaining clockwise directedness of cycles. ISCAS (1) 2005: 172-175 |
| c22 | | 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 |
| c21 | | Makoto Fujimoto, Daisuke Takafuji, Toshimasa Watanabe: Approximation algorithms for the rectilinear Steiner tree problem with obstacles. ISCAS (2) 2005: 1362-1365 |
| c20 | | Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima: Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. ISCAS (3) 2005: 2231-2234 |
| 2003 | ||
| c19 | | 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 |
| c18 | | 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 |
| c17 | | 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 | ||
| c16 | | Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe: Efficient approximation algorithms for the maximum weight matching problem. ISCAS (4) 2002: 457-460 |
| 2001 | ||
| c15 | | 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 | ||
| c14 | | Satoshi Taoka, Toshimasa Watanabe: The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph. IFIP TCS 2000: 169-185 |
| 1999 | ||
| c13 | | Masahiro Yamauchi, Toshimasa Watanabe: A heuristic algorithm SDS for scheduling with timed Petri nets. ISCAS (6) 1999: 81-84 |
| 1997 | ||
| c12 | | Toshimasa Watanabe: MULTI-PRIDE: a system for supporting multi-layered printed wiring board design. ASP-DAC 1997: 221-226 |
| 1995 | ||
| c11 |  | Toshiya Mashima, Toshimasa Watanabe: Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem. ISCAS 1995: 155-158 |
| 1994 | ||
| c10 | | Satoshi Taoka, Toshimasa Watanabe: Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. ISAAC 1994: 217-225 |
| c9 | | Masahiro Yamauchi, Toshimasa Watanabe: An Approximation Algorithm for the Legal Firing Sequence Problem of Petri Nets. ISCAS 1994: 181-184 |
| 1993 | ||
| j5 | | Toshimasa Watanabe, Akira Nakamura: A Minimum 3-Connectivity Augmentation of a Graph. J. Comput. Syst. Sci. 46(1): 91-127 (1993) |
| c8 | | Toshimasa Watanabe, Masahiro Yamauchi: New Priority-Lists for Scheduling in Timed Petri Nets. Application and Theory of Petri Nets 1993: 493-512 |
| c7 | | Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima: Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. ISCAS 1993: 2311-2314 |
| c6 | | Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka: Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. ISCAS 1993: 2556-2559 |
| 1992 | ||
| c5 | | Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka: The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. ISAAC 1992: 31-40 |
| 1991 | ||
| c4 | | Kenji Onaga, Manuel Silva, Toshimasa Watanabe: On Periodic Schedules for Deterministically Timed Petri Net Systems. PNPM 1991: 210-215 |
| 1990 | ||
| j4 | | Toshimasa Watanabe, Akira Nakamura: A smallest augmentation to 3-connect a graph. Discrete Applied Mathematics 28(2): 183-186 (1990) |
| c3 | | Toshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura: Graph Augmentation Problems for a Specified Set of Vertices. SIGAL International Symposium on Algorithms 1990: 378-387 |
| 1989 | ||
| c2 | | 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 |
| c1 | | Toshimasa Watanabe, Yukata Mizobata, Kenji Onaga: Legal Firing Sequence and Related Problems of Petri Nets. PNPM 1989: 277-286 |
| 1987 | ||
| j3 | | Toshimasa Watanabe, Akira Nakamura: Edge-Connectivity Augmentation Problems. J. Comput. Syst. Sci. 35(1): 96-144 (1987) |
| 1983 | ||
| j2 | | Toshimasa Watanabe, Akira Nakamura: On the Transformation Semigroups of Finite Automata. J. Comput. Syst. Sci. 26(1): 107-138 (1983) |
| 1977 | ||
| j1 | | Toshimasa Watanabe, Shoichi Noguchi: The Amalgamation of Automata. J. Comput. Syst. Sci. 15(1): 1-16 (1977) |
Colors in the list of coauthors
Last update Sun May 26 00:37:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page