I am a Postdoctoral Fellow in the G²OAT (Graphs, Geometry, Optimization, Algorithms, and Topology) Group at the Department of Computer Science, Faculty of Information Technology, Czech Technical University in Prague (CTU Prague), currently under the supervision of Tomáš Valla.

My research interests lie broadly in graph algorithms, parameterized complexity, structural graph theory, and algorithmic game theory.

Previously, I completed my Ph.D. in Theoretical Computer Science at the Indian Institute of Science Education and Research (IISER), Pune, under the supervision of Soumen Maity, with Saket Saurabh as co-supervisor. During my Ph.D., I worked on a variety of problems in graph algorithms and parameterized complexity.

Recent Preprints

• Hardness and Tractability of $T_{h+1}$-Free Edge Deletion,
  with Soumen Maity and Leeja R.
  arXiv:2602.00644

• Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms,
  with Hitendra Kumar, S. Padmapriya, Praneet Kumar Patra, Harsh Sanklecha, and Soumen Maity.
  arXiv:2510.26938

• Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
  arXiv:2510.07065

Contact

• 📍 Prague, Czech Republic
• ✉️ ajinkyag.iiser@gmail.com