$\ell$ minors-models (<span style="font-variant:small-caps;">${\mathcal}{F}$-Packing with $\ell$-Membership</span>). While only the [*existence*]{} of linear kernels for <span style="font-variant:small-caps;">${\mathcal F}$-Packing</span> was known [@BFL+09], to the best of our knowledge no kernels were known for <span style="font-variant:small-caps;">$\ell$-${\mathcal}{F}$-Packing</span> and <span style="font-variant:small-caps;">${\mathcal}{F}$-Packing with $\ell$-Membership</span>, except for <span style="font-variant:small-caps;">$\ell$-${\mathcal}{F}$-Packing</span> when $\mathcal{F}$ consists only of a triangle and the maximum degree is also considered as a parameter [@AtminasKR14]. We would like to note that the kernels for <span style="font-variant:small-caps;">${\mathcal F}$-Packing</span> and for <span style="font-variant:small-caps;">${\mathcal}{F}$-Packing with $\ell$-Membership</span> apply to minor-free graphs, while those for <span style="font-variant:small-caps;">$\ell$-${\mathcal}{F}$-Packing</span> for $\ell {\geqslant}2$ apply to the smaller class of apex-minor-free graphs. We also provide linear kernels for the versions of the above problems where one wants to pack [*subgraphs*]{} instead of minors (as one could expect, the kernels for subgraphs are considerably simpler than those for minors). We call the respective problems <span style="font-variant:small-caps;">$\ell$-${\cal F}$-Subgraph-Packing</span> and <span style="font-variant:small-caps;">${\mathcal}{F}$-Subgraph-Packing with $\ell$-Membership</span>. While the first problem can be seen as a broad generalization of $\ell$-<span style="font-variant:small-caps;">Scattered Set</span> (see for instance [@BFL+09; @KviaDP]), the second one was recently defined by Fernau *et al*. [@FernauLR15], motivated by the problem of discovering overlapping communities (see also [@RomeroL14-WALCOM; @RomeroL14-CSR] for related problems about detecting overlapping communities): the parameter $\ell$ 