The following publications are possibly variants of this publication:
- Proving NP-hardness for clique-width I: non-approximability of sequential clique-widthMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. eccc, (080), 2005. [doi]
- Clique-Width is NP-CompleteMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. siamdm, 23(2):909-939, 2009. [doi]
- Clique-width minimization is NP-hardMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. stoc 2006: 354-362 [doi]
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-WidthPinar Heggernes, Daniel Meister, Udi Rotics. tamc 2010: 284-295 [doi]