### Euiwoong Lee (이의웅), Parameterized Approximability of F-Deletion Problems

Room B332 IBS (기초과학연구원)For a family F of graphs, the F-Deletion Problem asks to remove the minimum number of vertices from a given graph G to ensure that G belongs to F. One of the most common ways to obtain an interesting family F is to fix another family H of graphs and let F be the set …