1. Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving MAX-$$r$$-SAT above a tight lower bound. Algorithmica 61(3), 638–655 (2011)
2. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. J. ACM 63(5), 44:1–44:69 (2016). https://doi.org/10.1145/2973749
3. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discret. Math. 28(1), 277–305 (2014). https://doi.org/10.1137/120880240
4. Brooks, L.R.: On colouring the nodes of a network. Proc. Camb. Philos. Soc. 37, 194–197 (1941)
5. Crowston, R., Jones, M., Muciaccia, G., Philip, G., Rai, A., Saurabh, S.: Polynomial kernels for lambda-extendible properties parameterized above the Poljak-Turzik bound. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 24, pp. 43–54. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2013)