1. Amini, O., Sau, I., Saurabh, S.: Parameterized complexity of finding small degree-constrained subgraphs. Journal of Discrete Algorithms (to appear)
2. Asano, T., Hirata, T.: Edge-contraction problems. J. Comput. Syst. Sci. 26, 197–208 (1983)
3. Lecture Notes in Computer Science;R. Belmonte,2011
4. Belmonte, R., Golovach, P.A., Heggernes, P., van ’t Hof, P., Kamiński, M., Paulusma, D.: Finding contractions and induced minors in chordal graphs via disjoint paths. In: Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011). LNCS, Springer, Heidelberg (to appear, 2011)
5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)