22 citations · 73 across the 32 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
On Structural Parameterizations of Firefighting
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra +1
The Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step , a firefighter permanently defends (protects)…
cs.DS2017★ 2 cited
The Parameterized Complexity of Happy Colorings
Neeldhara Misra, I. Vinod Reddy
Consider a graph and a coloring of vertices with colors from . A vertex is said to be happy with respect to if for all neighbors o…
cs.DS2017
Saving Critical Nodes with Firefighters is FPT
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra +1
We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a br…