![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 8 | Falk Schreiber, Konstantin Skodinis: NP-Completeness of Some Tree-Clustering Problems. Graph Drawing 1998: 288-301 |
Selection of 1 from 14 records - Konstantin Skodinis has 3 coauthors
Copyright © 2010-02-09 by Michael Ley (ley@uni-trier.de)