Showing cs.DSShow all
2 papers · 1 filter
cs.DS2010
Hitting forbidden minors: Approximation and Kernelization
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra +2
We study a general class of problems called F-deletion problems. In an F-deletion problem, we are asked whether a subset of at most vertices can be deleted from a graph suc…
cs.DS2009
FPT Algorithms for Connected Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman +2
We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of the classical Feedba…