14 citations · 21 across the 10 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
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.DM2011
Parameterized Complexity of Firefighting Revisited
Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen
The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a fire…