5 citations · 8 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012★ 5 cited
A single-exponential FPT algorithm for the -minor cover problem
Eun Jung Kim, Christophe Paul, Geevarghese Philip
Given an input graph G and an integer k, the parameterized K_4-minor cover problem asks whether there is a set S of at most k vertices whose deletion results in a K_4-minor-free gr…
cs.DS2010★ 3 cited
A Quartic Kernel for Pathwidth-One Vertex Deletion
Geevarghese Philip, Venkatesh Raman, Yngve Villanger
The pathwidth of a graph is a measure of how path-like the graph is. Given a graph G and an integer k, the problem of finding whether there exist at most k vertices in G whose dele…