1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2022
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…
cs.DS2022
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…
cs.DS2022★ 1 cited
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…