Abstract
In parameterized complexity, a {\em kernelization algorithm} can be seen as a reduction of a parameterized problem to itself, so that the produced equivalent instance has size depending exclusively on the parameter. If this size is polynomial, then then we say that the parameterized problem in question admits a polynomial kernelization algorithm. Kernelization can be seen as a formalization of the notion of preprocessingand has occupied a big part of the research on Multi-variate Algorithmics. The first algorithmic meta-theorem on kernelizationappeared in \href{https://arxiv.org/pdf/0904.0727}{\green{[{\sl H.~L. Bodlaender, F.~V. Fomin, D.~Lokshtanov, E.~Penninkx, S.~Saurabh, and D.~M. Thilikos. (Meta) kernelization. J. {ACM}, 63(5):44:1--44:69, 2016}\,]}} and unified a large family of previously known kernelization results on problems defined on topologically embeddable graphs.In this exposition we present the central results of this paper. During our presentation we pay attention to the abstractions on which the results where founded and take into account the subsequent advancements on this topic.