framework and present an explicit protrusion replacer for packing-certifiable problems. Since many definitions and proofs in this section are quite similar to the ones we presented in [@KviaDP], for better readability we moved the proofs of the results marked with ‘$[\star]$’ to Appendix \[ap:framework\]. Before moving to the details of each particular problem, in Section \[sec:applications\] we summarize the main ingredients that we use in our applications. The next sections are devoted to showing how to apply our methodology to various families of problems. More precisely, we start in Section \[sec: FPack\] with the linear kernel for <span style="font-variant:small-caps;">Connected-Planar-${\mathcal}{F}$-Packing</span>. This problem is illustrative, as it contains most of the technical ingredients of our approach, and will be generalized later in the two orthogonal directions mentioned above. Namely, in Section \[sec: rFPack\] we deal with the variant in which the minor-models are pairwise at distance at least $\ell$, and in Section \[sec: FMemb\] with the version in which each vertex can belong to at most $\ell$ minor-models. In Section \[sec: FSub\] we adapt the machinery developed for packing minors to packing subgraphs, considering both variants of the problem. For the sake of completeness, each of the considered problems will be redefined 