5 citations · 5 across the 3 of their papers we have counts for
3 papers · 1 filter
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
Alexander Langer, Peter Rossmanith, Somnath Sikdar
We present an alternative proof of a theorem by Courcelle, Makowski and Rotics which states that problems expressible in MSO are solvable in linear time for graphs of bounded rankw…
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…