Jungho Ahn (안정호) gave a talk at the Discrete Math Seminar on the almost linear kernel for packing and covering problems on nowhere dense classes of graphs

On November 8, 2022, Jungho Ahn (안정호) from KAIST and the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on a unified framework to create a polynomial-time preprocessing algorithm (kernel) for various packing and covering problems reducing the input instance to an equivalent instance of almost linear size on nowhere dense classes of graphs. The title of his talk was “Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes“.