
The Harmless Set Problem
Given a graph G = (V,E), a threshold function t : V →ℕ and an integer ...
read it

Defensive Alliances in Graphs
A set S of vertices of a graph is a defensive alliance if, for each elem...
read it

On Structural Parameterizations of the Offensive Alliance Problem
The Offensive Alliance problem has been studied extensively during the l...
read it

Parameterized Complexity of Locally Minimal Defensive Alliances
The Defensive Alliance problem has been studied extensively during the l...
read it

Edge Deletion to Restrict the Size of an Epidemic
Given a graph G=(V,E), a set ℱ of forbidden subgraphs, we study ℱFree E...
read it

The Satisfactory Partition Problem
The Satisfactory Partition problem consists in deciding if the set of ve...
read it
Ajinkya Gaikwad
is this you? claim profile