| 2026 | SOFSEM | Parameterized Algorithms for Locally Minimal Defensive Alliance. | Ajinkya Gaikwad, Soumen Maity, Saket Saurabh |
| 2025 | FCT | Parameterized Algorithms for Editing to Uniform Cluster Graph. | Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity |
| 2025 | STACS | MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. | Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma |
| 2023 | FCT | Parameterized Complexity of the | Ajinkya Gaikwad, Soumen Maity |
| 2022 | WALCOM | On the Harmless Set Problem Parameterized by Treewidth. | Ajinkya Gaikwad, Soumen Maity |
| 2021 | COCOA | On Structural Parameterizations of the Offensive Alliance Problem. | Ajinkya Gaikwad, Soumen Maity |
| 2021 | ICDCIT | Parameterized Complexity of Defensive and Offensive Alliances in Graphs. | Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi |
| 2021 | SOFSEM | The Balanced Satisfactory Partition Problem. | Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi |
| 2020 | COCOA | Parameterized Complexity of Satisfactory Partition Problem. | Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi |