3 papers
cs.CC2021
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 …
cs.DS2021
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…
cs.DS2020
The Satisfactory Partition Problem
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at l…