2 citations · 3 across the 11 of their papers we have counts for
4 papers · 1 filter
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{}) for several parameterizations. Let be a…
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)…
Parameterized Algorithms for Conflict-free Colorings of Graphs
I. Vinod Reddy
In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its n…
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…