Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy.

Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett

Browse the full STOC paper archive.