|
|
|
|
|
|
|
|
|
|
FOREWORD Takao ASANO
|
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/04/20
Vol. E76-A
No. 4
pp. 495-495
Type of Manuscript: FOREWORD
Category: Keyword:
|
| |
Summary |
Full Text:PDF
(79.3KB)
|
|
|
FOREWORD Takao ASANO
|
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/12/20
Vol. E75-A
No. 12
pp. 1727-1727
Type of Manuscript: FOREWORD
Category: Keyword:
|
| |
Summary |
Full Text:PDF
(81.5KB)
|
|
|
Finding a Maximum Weight Independent Set of a Circle Graph Takao ASANO
Hiroshi IMAI
Akira MUKAIYAMA
|
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/04/20
Vol. E74-A
No. 4
pp. 681-683
Type of Manuscript: Special Section LETTER (Special Issue on Discrete Mathematics and Its Applications)
Category: Keyword:
|
| |
Summary |
Full Text:PDF
(211.5KB)
|
|
|
Partitioning a Polygonal Region into a Minimum Number of Triangles Tetsuo ASANO
Takao ASANO
Yoshikazu OHSUGA
|
Publication: IEICE TRANSACTIONS (1976-1990)
Publication Date: 1984/04/20
Vol. E67-E
No. 4
pp. 232-233
Type of Manuscript: LETTER
Category: Computational Complexity Keyword:
|
| |
Summary |
Full Text:PDF
(143KB)
|
|
|
Necessary and Sufficient Conditions for a Property on Graphs to be Characterizable in Terms of k-Connected (k 1, 2, 3) Forbidden Graphs Takao ASANO
|
Publication: IEICE TRANSACTIONS (1976-1990)
Publication Date: 1983/11/20
Vol. E66-E
No. 11
pp. 666-670
Type of Manuscript: PAPER
Category: Circuit Theory Keyword:
|
| |
Summary |
Full Text:PDF
(355.1KB)
|
|
|