1. Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving Max-r-SAT above a tight lower bound. Algorithmica 61, 638–655 (2011)
2. Bodlaender, H.L., Cai, L., Chen, J., Fellows, M.R., Telle, J.A., Marx, D.: Open problems in parameterized and exact computation — IWPEC 2006. Utrecht University Technical Report UU-CS-2006-052 (2006)
3. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. Journal of Computer and System Sciences 75(8), 423–434 (2009)
4. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds. arXiv:1011.4224v2 (2012),
http://arxiv.org/abs/1011.4224
5. Bodlaender, H.L., Thomassé, S., Yeo, A.: Analysis of data reduction: transformations give evidence for non-existence of polynomial kernels. Utrecht University Technical Report UU-CS-2008-030 (2008)