1. LNCS;K. Abrahamson,1993
2. K. Abrahamson, R. Downey, M. Fellows, Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues. Ann. Pure Appl. Log. 73(3), 235–276 (1995)
3. K. Abrahamson, M. Fellows, J. Ellis, M. Mata, On the complexity of fixed parameter problems, in Proceedings of 30th Annual Symposium on Foundations of Computer Science, FOCS 1989, Research Triangle Park, North Carolina, USA, 30 October–1 November 1989 (IEEE Comput. Soc., Los Alamitos, 1989), pp. 210–215
4. M. Cesati, The Turing way to parameterized complexity. J. Comput. Syst. Sci. 67(4), 654–685 (2003)
5. Monographs in Computer Science;R. Downey,1999