Ajinkya Gaikwad

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 26

Top Topics

Subgraph Isomorphism

Parameterized Complexity

Global Constraints

Top Venues

Theor. Comput. Sci.

Publications

Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity
Kernelization Algorithms for the Eigenvalue Deletion Problems. CoRR (2024)
Ajinkya Gaikwad, Soumen Maity
On Structural Parameterizations of the Harmless Set Problem. Algorithmica 86 (5) (2024)
Ajinkya Gaikwad, Soumen Maity
Offensive alliances in graphs. Theor. Comput. Sci. 989 (2024)
Ajinkya Gaikwad, Soumen Maity
-Free Edge Deletion Problem. FCT (2023)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized complexity of satisfactory partition problem. Theor. Comput. Sci. 907 (2022)
Ajinkya Gaikwad, Soumen Maity
On the Harmless Set Problem Parameterized by Treewidth. WALCOM (2022)
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity
Offensive Alliances in Graphs. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity
Defensive alliances in graphs. Theor. Comput. Sci. 928 (2022)
Ajinkya Gaikwad, Soumen Maity
Parameterized Complexity of Upper Edge Domination. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity, Saket Saurabh
Parameterized Algorithms for Locally Minimal Defensive Alliance. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity
Globally minimal defensive alliances. Inf. Process. Lett. 177 (2022)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Intractability of Defensive Alliance Problem. CALDAM (2022)
Ajinkya Gaikwad, Soumen Maity
Globally Minimal Defensive Alliances: A Parameterized Perspective. CoRR (2022)
Ajinkya Gaikwad, Soumen Maity
Further parameterized algorithms for the F-free edge deletion problem. Theor. Comput. Sci. 933 (2022)
Ajinkya Gaikwad, Soumen Maity
Edge Deletion to Restrict the Size of an Epidemic. CoRR (2021)
Ajinkya Gaikwad, Soumen Maity
On Structural Parameterizations of the Offensive Alliance Problem. COCOA (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
The Balanced Satisfactory Partition Problem. SOFSEM (2021)
Ajinkya Gaikwad, Soumen Maity
On Structural Parameterizations of the Offensive Alliance Problem. CoRR (2021)
Ajinkya Gaikwad, Soumen Maity
Defensive Alliances in Graphs. CoRR (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Complexity of Locally Minimal Defensive Alliances. CALDAM (2021)
Ajinkya Gaikwad, Soumen Maity
The Harmless Set Problem. CoRR (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Complexity of Locally Minimal Defensive Alliances. CoRR (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Complexity of Defensive and Offensive Alliances in Graphs. ICDCIT (2021)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
Parameterized Complexity of Satisfactory Partition Problem. COCOA (2020)
Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
The Satisfactory Partition Problem. CoRR (2020)