CV

Education

B.S. in Mathematics, Indian Institute of Science Education and Research Pune, 2019
M.S. in Mathematics, Indian Institute of Science Education and Research Pune, 2019
Ph.D in Mathematics, Indian Institute of Science Education and Research Pune, 2019-

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

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

Ajinkya Gaikwad, Soumen Maity and Saket Saurabh, Parameterized Algorithms for Locally Minimal Defensive Alliance. arXiv link
Ajinkya Gaikwad and Soumen Maity, Globally Minimal Defensive Alliances: A Parameterized Perspective, (Manuscript). arXiv link
Ajinkya Gaikwad and Soumen Maity, The Harmless Set Problem, (revised version submitted) , 2023. arXiv link
Ajinkya Gaikwad and Soumen Maity, Offensive Alliances in Graphs. arXiv link.

Teaching Assistant for:
- Graph theory (Spring 2021), Course coordinator: Dr. Soumen Maity
- Graph theory (Fall 2021), Course coordinator: Dr. Krishna Kaipa
Lecturer:
Combinatorics (Spring 2023), Design and Anaylsis of Algorithms (Spring 2023)
Graph theory (Fall 2022)
Graph theoretic algorithms (Spring 2021, Summer 2021), at Ferguson College, Pune

Received the prestigious Prime Minister’s Research Fellowship, September 2020.
Received the CSIR NET fellowship. (August, 2019 - August, 2020)
Secured an All India Rank 133 in the Graduate Aptitude Test Engineering (GATE 2019 Mathematics) exam
Eligible for Junior Research Fellowship after securing an All India Rank 69 in the National Eligibility Test (NET 2018) exam
Received the Innovation in Science Pursuit for Inspires Research (INSPIRE) fellowship, given by the Department of Science and Technology, Government of India for the five years (August 2014 - May 2019)
Top 1% in Higher Secondary Education (HSC) Examination conducted by State Board