1 citations · 1 across the 4 of their papers we have counts for
4 papers
An Improved Exact Algorithm for Knot-Free Vertex Deletion
Ajaykrishnan E S, Soumen Maity, Abhishek Sahu +1
A knot in a directed graph is a strongly connected component of size at least two such that there is no arc with and . Given a directed g…
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…