Pranabendu Misra

Pranabendu Misra is an Assistant Professor in the Department of Computer Science at Chennai Mathematical Institute (CMI), India. He previously held postdoctoral positions at the Max Planck Institute for Informatics, Germany, and the University of Bergen, Norway. His research is centered in theoretical computer science with strong contributions to algorithms and complexity.

• Current Affiliation: Assistant Professor, Department of Computer Science, Chennai Mathematical Institute, India
• Previous Positions: Postdoctoral Fellow, Max Planck Institute for Informatics; Researcher, University of Bergen
• Education: PhD from Institute of Mathematical Sciences (IMSc), Chennai, advised by Prof. Saket Saurabh; M.Sc. and B.Sc. from CMI in Computer Science and Mathematics

Pranabendu's research interests span a broad spectrum of algorithmic theory, including Graph Theory, Parameterized Complexity, Approximation Algorithms, Matroids, Algebraic Methods, Derandomization, Algorithmic Game Theory, Streaming and Dynamic Graphs, and increasingly, AI/ML and Deep Learning. His work combines deep theoretical analysis with practical algorithmic insights.

His recent publications in top-tier venues like SODA, STOC, ICALP, and EC reveal a strong trend toward developing meta-theorems, kernelization techniques, and FPT approximation algorithms for fundamental graph problems such as vertex cover, feedback vertex set, connectivity augmentation, and disjoint paths. He also explores fair division in algorithmic game theory and fault-tolerant network design.

His scientific honors include:

• Google India Research Award (2022)
• SERB Startup Research Grant (2022)
• Fujitsu Research Grant (2023)

Pranabendu actively contributes to academic advising and teaching, offering courses such as Advanced Machine Learning, Approximation Algorithms, and Parameterized Algorithms. He has collaborated extensively with leading researchers including Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi, and Kurt Mehlhorn. While specific grant details are limited, his funded projects suggest strong support for research in algorithms and AI/ML. He teaches at CMI and has previously taught at the Max Planck Institute.

He is affiliated with a vibrant research group focusing on algorithms and complexity, working on both foundational and applied algorithmic problems. His recent interest in AI/ML indicates an expanding research scope bridging theoretical guarantees with modern machine learning applications.