Ajinkya Gaikwad

dblp:271/4472 · DBLP profile ↗
← Back
17ranked-venue papers
17as first author
16since 2021 · last 2026
0000-0002-7514-0708ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 13 · 13 first-author · 13 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Parameterized Algorithms for Locally Minimal Defensive Alliance
Ajinkya Gaikwad, Soumen Maity, Saket Saurabh 0001
SOFSEM1
2026 Globally minimal defensive alliances: A parameterized perspective
Ajinkya Gaikwad, Soumen Maity
Discret. Appl. Math.1
2026 On the parameterized complexity of s-club cluster edge deletion
Ajinkya Gaikwad
J. Comput. Syst. Sci.1
2026 Parameterized algorithms for editing to uniform cluster graph
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
Theor. Comput. Sci.1
2025 Parameterized Algorithms for Editing to Uniform Cluster Graph
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
FCT1
2025 MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh 0001, Roohani Sharma
STACS1
2025 Parameterized complexity of locally minimal defensive alliances
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Discret. Appl. Math.1
2024 On Structural Parameterizations of the Harmless Set Problem
Ajinkya Gaikwad, Soumen Maity
Algorithmica1
2024 Offensive alliances in graphs
Ajinkya Gaikwad, Soumen Maity
Theor. Comput. Sci.1
2023 Parameterized Complexity of the Th+1-Free Edge Deletion Problem
Ajinkya Gaikwad, Soumen Maity
FCT1
2022 Globally minimal defensive alliances
Ajinkya Gaikwad, Soumen Maity
Inf. Process. Lett.1
2022 Defensive alliances in graphs
Ajinkya Gaikwad, Soumen Maity
Theor. Comput. Sci.1
2022 Further parameterized algorithms for the F-free edge deletion problem
Ajinkya Gaikwad, Soumen Maity
Theor. Comput. Sci.1
2022 Parameterized complexity of satisfactory partition problem
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Theor. Comput. Sci.1
2021 On Structural Parameterizations of the Offensive Alliance Problem
Ajinkya Gaikwad, Soumen Maity
COCOA1
2021 The Balanced Satisfactory Partition Problem
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
SOFSEM1
2020 Parameterized Complexity of Satisfactory Partition Problem
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
COCOA1