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. J. Alber, H. Bodlaender, H. Fernau, T. Kloks, R. Niedermeier, Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33(4), 461–493 (2002)
5. LNCS;J. Alber,2000