PhD Students (Past) Srinivasa Rao Satti
Thesis : Succinct Data Structures (2002) Saket Saurabh
Thesis: Exact Algorithms for Optimization and Parameterized Versions of some graph theoretic problems (2008)
Somnath Sikdar
Thesis: Parameterizing from the extremes -- feasible parameterizations of some NP hard Optimization Problems (June 2010) Geevarghese Philip
Thesis: The kernelization complexity of some domination and covering problems (September 2011) Neeldhara Misra (jointly supervised with Saket Saurabh)
Thesis: Kernels for the F-Deletion problem (September 2011) Varun Kumar Jayapaul (Chennai Mathematical Institute)
Thesis: Sorting and Selection in Restricted Models of Computation (defended December 26, 2017) Sankardeep Chakraborty
Thesis: Space Efficient Graph Algorithms (defended on March 16, 2018) Diptapriyo Majumdar
Thesis: Classical and Approximate Kernels for structural parameterizations of some graph parameters (defended on October 1, 2018) Pratibha Choudhary (IIT Jodhpur) (jointly supervised with Aritra Banik)
Thesis: Parameterized Complexity of Tracking Paths (defended on March 18, 2021) Niranka Banerjee
Thesis:Dynamizing Graph Classes and Output Sensitive Fault Tolerant Subgraph Problems (defended on October 28, 2021) Arindam Biswas
Thesis:Algorithms for NP-hard problems in the Sublinear Space Regime (defended on March 29, 2022) Ashwin Jacob
Thesis: New Directions in Parameterized Deletion Problems (defended on August 10, 2022) Master's Students