15 citations · 20 across the 14 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
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.CC2015★ 3 cited
On the expressive power of read-once determinants
N. R. Aravind, Pushkar S. Joglekar
We introduce and study the notion of read- projections of the determinant: a polynomial is called a {\it read- projection of determinant}…
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…