Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett. Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada. pages 449-458, ACM, 1994. [doi]
@inproceedings{BodlaenderFH94,
title = {Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy},
author = {Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett},
year = {1994},
doi = {10.1145/195058.195229},
url = {http://doi.acm.org/10.1145/195058.195229},
researchr = {https://researchr.org/publication/BodlaenderFH94},
cites = {0},
citedby = {0},
pages = {449-458},
booktitle = {Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada},
publisher = {ACM},
}