12 citations · 29 across the 11 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011
k-Gap Interval Graphs
Fedor V. Fomin, Serge Gaspers, Petr Golovach +5
We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real…
cs.DS2011★ 5 cited
Towards optimal kernel for connected vertex cover in planar graphs
Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan
We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does no…