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: Proc. 6th ACM-SIAM ALENEX, pp. 62–69. ACM-SIAM (2004)
2. Alber, J., Betzler, N., Niedermeier, R.: Experiments in data reduction for optimal domination in networks. Ann. Oper. Res. 146, 105–117 (2006)
3. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating sets. J. ACM 51, 363–384 (2004)
4. Bar-Yehuda, R., Feldman, I., Rawitz, D.: Improved approximation algorithm for convex recoloring of trees. Theory Comput. Syst. 43, 3–18 (2008)
5. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 78, 160–174 (2009)