1. Mutual exclusion scheduling;Baker;Theoretical Computer Science,1996
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. Graph theory with applications. volume 290 of Graduate Texts in Mathematics;Bondy,1976
5. Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M., 2013. Fast branching algorithm for cluster vertex deletion. CoRR abs/1306.3877. arXiv:1306.3877.