Publisher
Springer International Publishing
Reference13 articles.
1. Abrahamson, K., Ellis, J., Fellows, M., Mata, M.: On the complexity of fixed-parameter problems. In: Proceedings of 13th FOCS, pp. 210–215 (1989)
2. Lecture Notes in Computer Science;HL Bodlaender,2008
3. Bodlaender, H., Fellows, M.R., Hallett, M.T.: Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 449–458 (1994)
4. Cai, L., Chen, J., Downey, R., Fellows, M.: Advice classes of parameterized tractability. Ann. Pure Appl. Logic 84, 119–138 (1997)
5. Dinneen, M.: Too many minor order obstructions (for parameterized lower ideals). J. Univers. Comput. Sci. 3, 1199–1206 (1997)