![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 2 | K. Takamizawa, Takao Nishizeki, Nobuji Saito: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3): 623-641 (1982) | |
| 1 | K. Takamizawa, Takao Nishizeki, Nobuji Saito: Combinatorial problems on series-parallel graphs. Graph Theory and Algorithms 1980: 79-94 |
Selection of 2 from 2 records - K. Takamizawa has 2 coauthors
Last update 2012-02-17 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page