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

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)

Parameterized Intractability of Defensive Alliance Problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (CALDAM, 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 satisfactory partition problem. - Ajinkya Gaikwad; Soumen Maity; Shuvam Kant Tripathi (Theor. Comput. Sci., 2022)

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