Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems