Fellows, M. R., Rosamond, F. A., Rotics, U., & Szeider, S. (2006, May). Clique-width minimization is NP-hard. Presented at 38th Annual ACM Symposium on Theory of Computing, Seattle, Washington, USA