The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Toshimasa Watanabe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Satoshi Taoka, Shinji Furusato, Toshimasa Watanabe
    A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2003, pp:417-439 [Conf]
  2. Toshimasa Watanabe, Masahiro Yamauchi
    New Priority-Lists for Scheduling in Timed Petri Nets. [Citation Graph (0, 0)][DBLP]
    Application and Theory of Petri Nets, 1993, pp:493-512 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    ICS, 1989, pp:361-370 [Conf]
  4. Satoshi Taoka, Toshimasa Watanabe
    The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:169-185 [Conf]
  5. Satoshi Taoka, Toshimasa Watanabe
    Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:217-225 [Conf]
  6. Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka
    The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:31-40 [Conf]
  7. Makoto Fujimoto, Daisuke Takafuji, Toshimasa Watanabe
    Approximation algorithms for the rectilinear Steiner tree problem with obstacles. [Citation Graph (0, 0)][DBLP]
    ISCAS (2), 2005, pp:1362-1365 [Conf]
  8. Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe
    Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. [Citation Graph (0, 0)][DBLP]
    ISCAS (1), 2005, pp:752-755 [Conf]
  9. Toshiya Mashima, Toshimasa Watanabe
    Approximation Algorithms for the k-Edge-Connectivity Augmentation Problem. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1995, pp:155-158 [Conf]
  10. A. Taguchi, Satoshi Taoka, Toshimasa Watanabe
    An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants. [Citation Graph (0, 0)][DBLP]
    ISCAS (3), 2003, pp:172-175 [Conf]
  11. Daisuke Takafuji, Toshimasa Watanabe
    Hierarchical extraction of a spanning planar subgraph maintaining clockwise directedness of cycles. [Citation Graph (0, 0)][DBLP]
    ISCAS (1), 2005, pp:172-175 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    ISCAS (3), 2003, pp:236-239 [Conf]
  13. Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka
    Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1993, pp:2556-2559 [Conf]
  14. Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima
    Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph. [Citation Graph (0, 0)][DBLP]
    ISCAS (3), 2005, pp:2231-2234 [Conf]
  15. Toshimasa Watanabe, Satoshi Taoka, Toshiya Mashima
    Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1993, pp:2311-2314 [Conf]
  16. Masahiro Yamauchi, Toshimasa Watanabe
    An Approximation Algorithm for the Legal Firing Sequence Problem of Petri Nets. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1994, pp:181-184 [Conf]
  17. T. Yamaoki, S. Taoka, T. Watanabe
    Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem. [Citation Graph (0, 0)][DBLP]
    ISCAS (5), 2001, pp:153-156 [Conf]
  18. D. Takafuji, S. Taoka, T. Watanabe
    Efficient approximation algorithms for the maximum weight matching problem. [Citation Graph (0, 0)][DBLP]
    ISCAS (4), 2002, pp:457-460 [Conf]
  19. Kenji Onaga, Manuel Silva, Toshimasa Watanabe
    On Periodic Schedules for Deterministically Timed Petri Net Systems. [Citation Graph (0, 0)][DBLP]
    PNPM, 1991, pp:210-215 [Conf]
  20. Toshimasa Watanabe, Yukata Mizobata, Kenji Onaga
    Legal Firing Sequence and Related Problems of Petri Nets. [Citation Graph (0, 0)][DBLP]
    PNPM, 1989, pp:277-286 [Conf]
  21. Toshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura
    Graph Augmentation Problems for a Specified Set of Vertices. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:378-387 [Conf]
  22. Toshimasa Watanabe, Shoichi Noguchi
    The Amalgamation of Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1977, v:15, n:1, pp:1-16 [Journal]
  23. Toshimasa Watanabe, Akira Nakamura
    On the Transformation Semigroups of Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:1, pp:107-138 [Journal]
  24. Toshimasa Watanabe, Akira Nakamura
    Edge-Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:1, pp:96-144 [Journal]
  25. Toshimasa Watanabe, Akira Nakamura
    A Minimum 3-Connectivity Augmentation of a Graph. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:1, pp:91-127 [Journal]
  26. S. Shimada, S. Taoka, M. Yamauchi, T. Watanabe
    An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets. [Citation Graph (0, 0)][DBLP]
    ISCAS, 2006, pp:- [Conf]

  27. A smallest augmentation to 3-connect a graph. [Citation Graph (, )][DBLP]


Search in 0.125secs, Finished in 0.127secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002