Conference Publications

• Ajinkya Gaikwad, Hitendra Kumar and Soumen Maity, Parameterized Algorithms for Editing to Uniform Cluster Graph, FCT 2025, (Accepted).

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

• Ajinkya Gaikwad and Soumen Maity, Parameterized complexity of the T_{h+1}-Free Edge Deletion Problem, FCT 2023, Lecture Notes in Computer Science, Vol. 14292, 2023. Link

• Ajinkya Gaikwad and Soumen Maity, On the Harmless Set Problem Parameterized by Treewidth, WALCOM 2022, Lecture Notes in Computer Science, Vol. 13174, 227-238, 2022.Link

• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized intractability of defensive alliance problem, CALDAM 2022, Lecture Notes in Computer Science, Vol. 13179, 279-291, 2022.Link

• Ajinkya Gaikwad and Soumen Maity, On Structural Parameterizations of the Offensive Alliance Problem, COCOA 2021, Lecture Notes in Computer Science, Vol. 13135, 579-586, 2021.Link

• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, The Balanced Satisfactory Partition Problem, SOFSEM 2021, Lecture Notes in Computer Science, Vol. 12607, 322-336, 2021. Link

• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Locally Minimal Defensive Alliance, CALDAM 2021, Lecture Notes in Computer Science, Vol. 12601, 135-148, 2021.Link

• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Defensive and Offensive Alliances in Graphs, ICDCIT 2021, Lecture Notes in Computer Science, Vol. 12582, 175-187, 2021.Link

• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Satisfactory Partition Problem, COCOA 2020, Lecture Notes in Computer Science, Vol. 12577, 76-90, 2020.Link

Journal Publications

• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Locally Minimal Defensive Alliances, Discrete Applied Mathematics, 2025 (Accepted).

• Ajinkya Gaikwad and Soumen Maity, Globally Minimal Defensive Alliances: A Parameterized Perspective, Discrete Applied Mathematics, 2025 Accepted.

• Ajinkya Gaikwad and Soumen Maity, Structural Parameterizations of the Harmless Set Problem, Algorithmica, 2024.Link

• Ajinkya Gaikwad and Soumen Maity, Offensive Alliances in Graphs, Theoretical Computer Science, Vol. 989, 114401, 2024.Link

• Ajinkya Gaikwad and Soumen Maity, Defensive Alliances in Graphs, Theoretical Computer Science, Vol. 928, 136 -150, 2022.Link

• Ajinkya Gaikwad and Soumen Maity, Further parameterized algorithms for the F-free edge deletion problem, Theoretical Computer Science, Vol. 933, 125-137, 2022.Link

• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Satisfactory Partition Problem, Theoretical Computer Science, Vol. 907, 113-127, 2022. Link

• Ajinkya Gaikwad, Soumen Maity, Globally Minimal Defensive Alliances, Information Processing Letters, Vol. 177, 106253, 2022.Link