1. K. Abrahamson, R. G. Downey and M. R. Fellows, Fixed-parameter intractability II, Lecture Notes in Computer Science (STACS'93), (1993), pp. 374–385.
2. K. R. Abrahamson, J. A. Ellis, M. R. Fellows, and M. E. Mata, On the complexity of fixed parameter problems, Proc. 30th Annual Symposium on Foundations of Computer Science, (1989), pp. 210–215.
3. S. Arnborg, J. Lagergren, and D. Seese, Problems easy for tree-decomposable graphs, Lecture Notes in Computer Science 317 (ICALP'88), (1988), pp. 38–51.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, Proc. 33rd Annual Symposium on Foundations of Computer Science, (1992), pp. 14–23.
5. J. Balcazar, J. Diaz, and J. Gabarro, Structural Complexity I, Springer-Verlag, 1988.