1. Minimal identifying codes in trees and planar graphs with large girth;Auger;European Journal of Combinatorics,2010
2. On problems without polynomial kernels;Bodlaender;Journal of Computer and System Sciences,2009
3. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S., 2011. Cross-composition: A new technique for kernelization lower bounds, in: Proc. of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 165–176.
4. A faster fpt algorithm for finding spanning trees with many leaves;Bonsma,2003
5. Parameterized complexity of vertex colouring;Cai;Discrete Applied Mathematics,2003