The Satisfactory Partition Problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (CoRR, 2020)

On Structural Parameterizations of the Offensive Alliance Problem. - Ajinkya Gaikwad; Soumen Maity (COCOA, 2021)

Parameterized Complexity of Defensive and Offensive Alliances in Graphs. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (ICDCIT, 2021)

The Balanced Satisfactory Partition Problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (SOFSEM, 2021)

Edge Deletion to Restrict the Size of an Epidemic. - Ajinkya Gaikwad; Soumen Maity (CoRR, 2021)

The Harmless Set Problem. - Ajinkya Gaikwad; Soumen Maity (CoRR, 2021)

Parameterized Intractability of Defensive Alliance Problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (CALDAM, 2022)

On the Harmless Set Problem Parameterized by Treewidth. - Ajinkya Gaikwad; Soumen Maity (WALCOM, 2022)

Globally Minimal Defensive Alliances: A Parameterized Perspective. - Ajinkya Gaikwad; Soumen Maity (CoRR, 2022)

Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity; Saket Saurabh 001; Shuvam Kant Tripathi (CoRR, 2022)

Parameterized Complexity of Upper Edge Domination. - Ajinkya Gaikwad; Soumen Maity (CoRR, 2022)

Parameterized Algorithms for Locally Minimal Defensive Alliance. - Ajinkya Gaikwad; Soumen Maity; Saket Saurabh 001 (CoRR, 2022)

Globally minimal defensive alliances. - Ajinkya Gaikwad; Soumen Maity (Inf. Process. Lett., 2022)

Defensive alliances in graphs. - Ajinkya Gaikwad; Soumen Maity (Theor. Comput. Sci., 2022)

Further parameterized algorithms for the F-free edge deletion problem. - Ajinkya Gaikwad; Soumen Maity (Theor. Comput. Sci., 2022)

Parameterized complexity of satisfactory partition problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (Theor. Comput. Sci., 2022)

Parameterized Complexity of the Th+1-Free Edge Deletion Problem. - Ajinkya Gaikwad; Soumen Maity (FCT, 2023)

Kernelization Algorithms for the Eigenvalue Deletion Problems. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity (CoRR, 2024)

Offensive alliances in graphs. - Ajinkya Gaikwad; Soumen Maity (Theor. Comput. Sci., 2024)

On Structural Parameterizations of the Harmless Set Problem. - Ajinkya Gaikwad; Soumen Maity (Algorithmica, 2024)

MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity; Saket Saurabh 001; Roohani Sharma (STACS, 2025)

Parameterized complexity of locally minimal defensive alliances. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (Discret. Appl. Math., 2025)

MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity; Saket Saurabh 001; Roohani Sharma (CoRR, 2025)