375 citations · 494 across the 29 of their papers we have counts for
3 papers · 1 filter
Faster Algorithms for Finding and Counting Subgraphs
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman +2
In this paper we study a natural generalization of both {\sc -Path} and {\sc -Tree} problems, namely, the {\sc Subgraph Isomorphism} problem. In the {\sc Subgraph Isomorphism…
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…
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of graphs that exclude K_{i,j} as a subgraph, for any fixed i…