1. Arnborg S, Corneil DG, Proskurowski A (1987) Complexity of finding embeddings in a k-tree. SIAM J Algebr Discret Methods 8:277–284
2. Binkele-Raible D, Fernau H, Fomin FV, Lokshtanov D, Saurabh S, Villanger Y (2012) Kernel(s) for problems with no kernel: on out-trees with many leaves. ACM Trans Algorithms 8(5):38
3. Bodlaender HL, Downey RG, Fellows MR, Hermelin D (2009) On problems without polynomial kernels. J Comput Syst Sci 75:423–434
4. Bodlaender HL, Jansen BMP, Kratsch S (2011) Cross-composition: a new technique for kernelization lower bounds. In: Schwentick T, Dürr C (eds) Proceedings 28th international symposium on theoretical aspects of computer science, STACS 2011, Dortmund. Schloss Dagstuhl – Leibnitz-Zentrum fuer Informatik, Leibniz International Proceedings in Informatics (LIPIcs), vol 9, pp 165–176
5. Bodlaender HL, Thomassé S, Yeo A (2011) Kernel bounds for disjoint cycles and disjoint paths. Theor Comput Sci 412:4570–4578