11 citations · 32 across the 20 of their papers we have counts for
Showing 2015 · cs.DSShow all
3 papers · 2 filters
cs.DS2015
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of -free Edge Modification Problems
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
For a graph , the -free Edge Deletion problem asks whether there exist at most edges whose deletion from the input graph results in a graph without any induced copy o…
cs.DS2015
A cubic vertex kernel for Diamond-free Edge Deletion and more
R. B. Sandeep, Naveen Sivadasan
A diamond is a graph obtained by removing an edge from a complete graph on four vertices. A graph is diamond-free if it does not contain an induced diamond. The Diamond-free Edge D…
cs.DS2015★ 1 cited
Parameterized lower bound and NP-completeness of some -free Edge Deletion problems
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
For a graph , the -free Edge Deletion problem asks whether there exist at most edges whose deletion from the input graph results in a graph without any induced copy o…