Roohani Sharma, Uniform and Constructive Polynomial Kernel for Deletion to $K_{2,p}$ Minor-Free Graphs
Room B332 IBS (기초과학연구원)Let $\mathcal F$ be a fixed, finite family of graphs. In the $\mathcal F$-Deletion problem, the input is a graph G and a positive integer k, and the goal is to determine if there exists a set of at most k vertices whose deletion results in a graph that does not contain any graph of …