On January 21, 2025, Laure Morelle from the LIRMM gave a talk at the Discrete Math Seminar on the parameterized complexity of modifying a graph into a minor-closed class of graphs. The title of her talk was “Bounded size modifications in time $2^{poly(k)} n^2$“.