---
abstract: 'During the last years, several algorithmic meta-theorems have appeared (Bodlaender *et al*. \[FOCS 2009\], Fomin *et al*. \[SODA 2010\], Kim *et al*. \[ICALP 2013\]) guaranteeing the [*existence*]{} of linear kernels on sparse graphs for problems satisfying some generic conditions. The drawback of such general results is that it is usually not clear how to derive from them [*constructive*]{} kernels with reasonably low [*explicit*]{} constants. To fill this gap, we recently presented \[STACS 2014\] a framework to obtain explicit linear kernels for some families of problems whose solutions can be certified by a subset of [*vertices*]{}. In this article we enhance our framework to deal with [*packing*]{} problems, that is, problems whose solutions can be certified by collections of [*subgraphs*]{} of the input graph satisfying certain properties. ${\mathcal F}$-<span style="font-variant:small-caps;">Packing</span> is a typical example: for a family ${\mathcal F}$ of connected graphs that we assume to contain at least one planar graph, the task is to decide whether a graph $G$ contains $k$ vertex-disjoint subgraphs such that each of them contains a graph in ${\mathcal F}$ as a minor. We provide explicit linear kernels on sparse graphs for the following two orthogonal generalizations of ${\mathcal F}$-<span style="font-variant:small-caps;">Packing</span>: for an 