Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Watanabe, Toshimasa"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A heuristic algorithm FSDC based on avoidance of deadlock components in finding legal firing sequences of Petri nets
Satoshi Taoka
,
Shinji Furusato
,
Toshimasa Watanabe
Lecture Notes in Computer Science
2679
, 2003, pp. 417-439
The
(\sigma+1)
-edge-connectivity augmentation problem without creating multiple edges of a graph
Satoshi Taoka
,
Toshimasa Watanabe
Lecture Notes in Computer Science
1872
, 2000, pp. 169-185
Minimum augmentation to
k
-edge-connect specified vertices of a graph
Satoshi Taoka
,
Toshimasa Watanabe
Lecture Notes in Computer Science
834
, 1994, pp. 217-225
A minimum 3-connectivity augmentation of a graph
Toshimasa Watanabe
,
Akira Nakamura
Journal of Computer and System Sciences
46
(1), 1993, pp. 91-128
New priority-lists for scheduling in timed Petri nets
Toshimasa Watanabe
,
Masahiro Yamauchi
Lecture Notes in Computer Science
691
, 1993, pp. 493-512
The
k
-edge-connectivity augmentation problem of weighted graphs
Toshimasa Watanabe
,
Toshiya Mashita
,
Satoshi Taoka
Lecture Notes in Computer Science
650
, 1992, pp. 31-40
Graph augmentation problems for a specified set of vertices
Toshimasa Watanabe
,
Yasuhiko Higashi
,
Akira Nakamura
Lecture Notes in Computer Science
450
, 1990, pp. 378-387
A smallest augmentation to 3-connect a graph
Toshimasa Watanabe
,
Akira Nakamura
Discrete Applied Mathematics
28
, 1990, pp. 183-186
Time complexity of legal firing sequence and related problems of Petri nets
Toshimasa Watanabe
,
Yutaka Mizobata
,
Kenji Onaga
The Transactions of the IEICE
E 72
(12), 1989, December, pp. 1400-1409
Minimal initial marking problems of Petri nets
Toshimasa Watanabe
,
Yutaka Mizobata
,
Kenji Onaga
The Transactions of the IEICE
E 72
(12), 1989, December, pp. 1390-1399
On the NP-hardness of edge-deletion and -contraction problems
Toshimasa Watanabe
,
Tadashi Ae
,
Akira Nakamura
Discrete Applied Mathematics
6
, 1983, pp. 63-78
On the
NP
-hardness of edge-deletion and -contraction problems
Toshimasa Watanabe
,
Tadashi Ae
,
Akira Nakamura
Technical Report (C-12), 1981, December
On the removal of forbidden graphs by edge-deletion or by edge-contraction
Toshimasa Watanabe
,
Tadashi Ae
,
Akira Nakamura
Discrete Applied Mathematics
3
, 1981, pp. 151-153