1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Arge, L., Italiano, G., Sedgewick, R. (eds.) Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, ACM/SIAM, Proc. Applied Mathematics 115 (January 2004)
2. Alber, J., Fellows, M., Niedermeier, R.: Polynomial time data reduction for dominating set. Journal of the ACM 51, 363–384 (2004)
3. Lecture Notes in Computer Science;J. Alber,2002
4. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308–340 (1991)
5. Bodlaender, H.L., Koster, A.M.: Combinatorial optimisation on graphs of bounded treewidth. The Computer Journal (to appear 2007)