Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. Proving NP-hardness for clique-width I: non-approximability of sequential clique-width. Electronic Colloquium on Computational Complexity (ECCC), (080), 2005. [doi]
@article{ECCC-TR05-080,
title = {Proving NP-hardness for clique-width I: non-approximability of sequential clique-width},
author = {Michael R. Fellows and Frances A. Rosamond and Udi Rotics and Stefan Szeider},
year = {2005},
url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-080/index.html},
researchr = {https://researchr.org/publication/ECCC-TR05-080},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {080},
}