1 citations · 1 across the 17 of their papers we have counts for
5 papers · 1 filter
Offensive Alliances in Graphs
Ajinkya Gaikwad, Soumen Maity
A set of vertices is an offensive alliance in an undirected graph if each has at least as many neighbours in as it has neighbours (includin…
Parameterized Complexity of Upper Edge Domination
Ajinkya Gaikwad, Soumen Maity
In this paper we study a maximization version of the classical Edge Dominating Set (EDS) problem, namely, the Upper EDS problem, in the realm of Parameterized Complexity. In this p…
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity +2
In this paper we study a maximization version of the classical Feedback Vertex Set (FVS) problem, namely, the Max Min FVS problem, in the realm of parameterized complexity. In this…
Parameterized Algorithms for Locally Minimal Defensive Alliance
Ajinkya Gaikwad, Soumen Maity, Saket Saurabh
A set of vertices of a graph is a \emph{defensive alliance} if, for each element of , the majority of its neighbours are in . We consider the notion of local minimality i…
Globally Minimal Defensive Alliances: A Parameterized Perspective
Ajinkya Gaikwad, Soumen Maity
A defensive alliance in an undirected graph is a non-empty set of vertices satisfying the condition that every vertex has at least as many neighbours (includ…