Ajinkya Gaikwad

According to our database, Ajinkya Gaikwad authored at least 20 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On Structural Parameterizations of the Harmless Set Problem.

Ajinkya Gaikwad, Soumen Maity

Algorithmica, May, 2024

2023

Parameterized Complexity of the <i>T</i>_h+1-Free Edge Deletion Problem.

Ajinkya Gaikwad, Soumen Maity

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Parameterized complexity of satisfactory partition problem.

Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

Theor. Comput. Sci., 2022

Further parameterized algorithms for the F-free edge deletion problem.

Ajinkya Gaikwad, Soumen Maity

Theor. Comput. Sci., 2022

Defensive alliances in graphs.

Ajinkya Gaikwad, Soumen Maity

Theor. Comput. Sci., 2022

Globally minimal defensive alliances.

Ajinkya Gaikwad, Soumen Maity

Inf. Process. Lett., 2022

Parameterized Algorithms for Locally Minimal Defensive Alliance.

Ajinkya Gaikwad, Soumen Maity, Saket Saurabh

CoRR, 2022

Offensive Alliances in Graphs.

Ajinkya Gaikwad, Soumen Maity

CoRR, 2022

Parameterized Complexity of Upper Edge Domination.

Ajinkya Gaikwad, Soumen Maity

CoRR, 2022

Maximum Minimal Feedback Vertex Set: A Parameterized Perspective.

Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi

CoRR, 2022

Globally Minimal Defensive Alliances: A Parameterized Perspective.

Ajinkya Gaikwad, Soumen Maity

CoRR, 2022

On the Harmless Set Problem Parameterized by Treewidth.

Ajinkya Gaikwad, Soumen Maity

Proceedings of the WALCOM: Algorithms and Computation, 2022

Parameterized Intractability of Defensive Alliance Problem.

Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

The Harmless Set Problem.

Ajinkya Gaikwad, Soumen Maity

CoRR, 2021

Edge Deletion to Restrict the Size of an Epidemic.

Ajinkya Gaikwad, Soumen Maity

CoRR, 2021

The Balanced Satisfactory Partition Problem.

Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Parameterized Complexity of Defensive and Offensive Alliances in Graphs.

Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

Proceedings of the Distributed Computing and Internet Technology, 2021

On Structural Parameterizations of the Offensive Alliance Problem.

Ajinkya Gaikwad, Soumen Maity

Proceedings of the Combinatorial Optimization and Applications, 2021

Parameterized Complexity of Locally Minimal Defensive Alliances.

Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

The Satisfactory Partition Problem.

Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

CoRR, 2020