Jakob Greilhuber gave a talk on the problem of deleting a small set of vertices to make every component small at the Discrete Math Seminar

On October 28, 2025, Jakob Greilhuber from the CISPA Helmholtz Center for Information Security gave a talk at the Discrete Math Seminar on the parameterized complexity of the problem of deleting k vertices to make every component small. The title of his talk was “A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth“.