Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
MaxMin Separation Problems: FPT Algorithms for -Separator and Odd Cycle Transversal
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity +2
In this paper, we study the parameterized complexity of the MaxMin versions of two fundamental separation problems: Maximum Minimal -Separator and Maximum Minimal Odd Cycle Tra…
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 …