1. Mutual exclusion scheduling;Baker;Theoretical Computer Science,1996
2. On problems without polynomial kernels;Bodlaender;Journal of Computer and System Sciences,2009
3. Equitable colorings of bounded treewidth graphs;Bodlaender;Theoretical Computer Science,2005
4. 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.
5. Restrictions of graph partition problems;Bodlaender;part I. Theoretical Computer Science,1995