A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Hitting Forbidden Minors: Approximation and Kernelization

2016
*
SIAM Journal on Discrete Mathematics
*

We study a general class of problems called p-F-Deletion problems. In an p-F-Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors. We obtain a number of algorithmic results on the p-F-Deletion problem when F contains a planar graph. We give a linear vertex kernel on graphs excluding t-claw K 1,t , the star with t leves, as an induced subgraph,

doi:10.1137/140997889
fatcat:ibdw3u7a6vel3hfat3j5rjhjom