Prafullkumar Tale

Prafullkumar Tale is an Assistant Professor in the Department of Mathematics at the Indian Institute of Science Education and Research (IISER) Pune, India. He previously served as an Assistant Professor in the Electrical Engineering and Computer Science department at IISER Bhopal from January 2024 to April 2025, and was an INSPIRE Faculty Fellow at IISER Pune. He conducted postdoctoral research at the Max-Planck Institute for Informatics and CISPA Helmholtz Center for Information Security under Prof. Daniel Marx.

• Ph.D.: IMSc Chennai, supervised by Prof. Saket Saurabh
• Integrated M.Sc. in Applied Mathematics: IIT Roorkee

His research focuses on the design and analysis of algorithms, particularly parameterized algorithms for NP-hard graph problems and conditional lower bounds. His work lies at the intersection of theoretical computer science and discrete mathematics, contributing to foundational understanding in computational complexity and algorithmic tractability.

The available articles in his profile (not listed here) would reflect strong contributions in theoretical computer science, especially in parameterized complexity and graph algorithms, suggesting consistent work in top-tier theoretical venues.

• INSPIRE Faculty Fellowship

Prafullkumar Tale has mentored researchers during his postdoctoral and faculty roles, though no formal advisees are listed. He has secured competitive research funding through the INSPIRE Faculty Fellowship, supporting independent research at IISER Pune. His academic trajectory reflects a strong foundation in theoretical computer science with sustained research output and institutional affiliations at premier research institutes in India and Germany.

He has been associated with leading research groups, including those led by Prof. Daniel Marx at Max-Planck Institute and CISPA, and Prof. Saket Saurabh at IMSc Chennai. These collaborations place him within a prominent network in the global parameterized complexity community.