Author:
Downey Rodney G.,Fellows Michael R.
Reference33 articles.
1. K. Abrahamson, M. Fellows, Cutset regularity beats well-quasi-ordering for bounded treewidth, Preprint (1989)
2. Contemporary Mathematics;K. Abrahamson,1993
3. J. Blasiok, M. Kaminski, Chain minors are FPT, in Proceedings of IPEC 2013 (2013)
4. LNCS;K. Cattell,1994
5. K. Cattell, M. Dinneen, R. Downey, M. Fellows, M. Langston, On computing graph minor obstruction sets. Theor. Comput. Sci. 233, 107–127 (2000)