1 citations · 1 across the 17 of their papers we have counts for
5 papers · 1 filter
Defensive Alliances in Graphs
Ajinkya Gaikwad, Soumen Maity
A set of vertices of a graph is a defensive alliance if, for each element of , the majority of its neighbours are in . We study the parameterized complexity of the Defens…
The Harmless Set Problem
Ajinkya Gaikwad, Soumen Maity
Given a graph , a threshold function and an integer , we study the Harmless Set problem, where the goal is to find a subset of vertic…
On Structural Parameterizations of the Offensive Alliance Problem
Ajinkya Gaikwad, Soumen Maity
The Offensive Alliance problem has been studied extensively during the last twenty years. A set of vertices is an offensive alliance in an undirected graph …
Parameterized Complexity of Locally Minimal Defensive Alliances
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
A set of vertices of a graph is a defensive alliance if, for each element of , the majority of its neighbours is in . We consider the notion of local minimality in this p…
Edge Deletion to Restrict the Size of an Epidemic
Ajinkya Gaikwad, Soumen Maity
Given a graph , a set of forbidden subgraphs, we study -Free Edge Deletion, where the goal is to remove minimum number of edges such that the re…