1. 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(4):38
2. Daligault J, Thomassé S (2009) On finding directed trees with many leaves. In: Chen J, Fomin FV (eds) Parameterized and exact computation, 4th international workshop, IWPEC, Copenhagen. LNCS, vol 5917. Springer, pp 86–97
3. Daligault J, Gutin G, Kim EJ, Yeo A (2010) FPT algorithms and kernels for the directed k-leaf problem. J Comput Syst Sci 76(2):144–152
4. Hermelin D, Kratsch S, Soltys K, Wahlström M, Wu X (2013) A completeness theory for polynomial (Turing) kernelization. In: Gutin G, Szeider S (eds) Parameterized and exact computation – 8th international symposium, IPEC, Sophia Antipolis. LNCS, vol 8246. Springer, pp 202–215
5. Jansen BMP (2014) Turing kernelization for finding long paths and cycles in restricted graph classes. Tech. Rep. 1402.4718v1, arXiv.CS.DS