1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)
2. Bodlaender, H., Fomin, F., Lokshtanov, D., Penninkx, S.S.E., Thilikos, D.: (Meta) kernelization. In: FOCS (2009)
3. Lecture Notes in Computer Science;J. Chen,2006
4. Chen, J., Huang, X., Kanj, I.A., Xia, G.: Linear FPT reductions and computational lower bounds. In: Babai, L. (ed.) STOC, pp. 212–221. ACM, New York (2004)
5. Cosmadakis, S.S., Papadimitriou, C.H.: The traveling salesman problem with many visits to few cities. SIAM J. Comput. 13, 99 (1984)