Euiwoong Lee (이의웅) gave a talk on the parameterized complexity of approximating the minimum size of a deletion set to make a graph belong to a fixed class

On July 30, 2024, Euiwoong Lee (이의웅) from the University of Michigan gave a talk at the Discrete Math Seminar on the parameterized complexity of approximating the minimum size of a deletion set to make a graph belong to a fixed class. The title of his talk was “Parameterized Approximability of F-Deletion Problems“.