Teaching:
 Analysis and Design of Algorithms, Monsoon 2023, IIT Delhi.
 Theory of Computation, Monsoon 2023, IIT Delhi.
 Parameterized Algorithms for NPcomplete Problems, Spring 2023, IIT Delhi.
 Computing Laboratory, Spring 2023, IIT Delhi.
 Operating Systems, Monsoon 2022, IIT Delhi.
 Topics in Algorithms (Seminar Course), Monsoon 2022, IIT Delhi.
 Computing Laboratory, Spring 2022, IIT Delhi.
 Advanced Algorithms, Spring 2022, IIT Delhi, taught with Prof. Minati De.
 Analysis and Design of Algorithms, Monsoon 2021, IIT Delhi.
 Combinatorics, Monsoon 2021, IIT Delhi, taught with Prof. Minati De.
 Operating Systems, Spring 2021, IIT Delhi.
 Complexity Theory, Monsoon 2020, at IIIT, Delhi.
 Combinatorics and Graph Theory I, Spring 2019, at Charles University (assisted Prof. Andreas Emil Feldmann).
 Advanced Graph Algorithms, early 2014, at IMSc, Chennai (assisted Prof. Saket Saurabh).
Research:
In Journals
 A Polynomial Kernel for DiamondFree Editing
with Yixin Cao, R. B. Sandeep, and Junjie Ye
in Algorithmica, Volume 84(1), Pages 197215 (2022). [link] [preprint]
 Parameterized and exact algorithms for class domination coloring
with R. Krithika, Saket Saurabh, and Prafullkumar Tale
in Discrete Applied Mathematics, Volume 291, Pages 286299 (2021). [link] [preprint]
 Parameterized Algorithms for Max Colorable Induced Subgraph problem on Perfect Graphs
with Neeldhara Misra, Fahad Panolan, Venkatesh Raman, and Saket Saurabh
in Algorithmica, Volume 81(1), Pages 2646 (2019). [link] [preprint]
 Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
with Geevarghese Philip and Saket Saurabh in SIAM Journal on Discrete Mathematics (SIDMA), Volume 32(2), Pages 882901 (2018). [link] [preprint]
 On the Kernelization Complexity of String Problems
with Manu Basavaraju, Fahad Panolan, M. S. Ramanujan, and Saket Saurabh
in Theoretical Computer Science (2018), Volume 730, Pages 2131 (2018). [link] [preprint]
 Bivariate complexity analysis of Almost Forest Deletion
with Saket Saurabh
in Theoretical Computer Science, Volume 708, Pages 1833 (2018). [link] [preprint]
 Faster Parameterized Algorithms for Deletion to Split Graphs
with Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, and M. S. Ramanujan
in Algorithmica, Volume 71(4), Pages 9891006 (2015). [link] [preprint]
 Kernel lower bounds using conondeterminism: Finding induced hereditary subgraphs
with Stefan Kratsch, Marcin Pilipczuk, and Venkatesh Raman
in ACM Transactions on Computation Theory (TOCT), Volume 7(1), Pages 4:14:18 (2014). [link] [preprint]
In Conferences
 Parameterized complexity of untangling knots
with Clement LegrandDuchesne and Martin Tancer
[pdf]
in EATCS International Colloquium on Automata, Languages and Programming (ICALP), 2022.
 Parameterized Complexity of SetRestricted Disjoint Paths on Chordal Graphs
with Petr A. Golovach, Fahad Panolan, and Saket Saurabh
[pdf]
in International Computer Scinece Symposium in Russia (CSR), 2022.
 On Extended Formulations For Parameterized Steiner Trees
with Andreas Emil Feldmann
[pdf]
in International Symposium on Parameterized and Exact Computation (IPEC), 2021.
 FixedParameter Tractability of the Weighted Edge Clique Partition Problem
with Andreas Emil Feldmann and Davis Issac
[pdf]
in International Symposium on Parameterized and Exact Computation (IPEC), 2020.
 Quick Separation in Chordal and Split Graphs [pdf]
with Pranabendu Misra, Fahad Panolan, Saket Saurabh, and Roohani Sharma
in Mathematical Foundations of Computer Science (MFCS), 2020.
 Parameterized Inapproximability of Independent Sets in HFree Graphs [pdf]
with Pavel Dvořák, Andreas Emil Feldmann, and Paweł Rzążewski
in International Workshop on GraphTheoretic Concepts in Computer Science (WG), 2020.
 A Polynomial Kernel for DiamondFree Editing [pdf]
with Yixin Cao, R. B. Sandeep, and Junjie Ye
in European Symposium on Algorithms (ESA), 2018.
 Parameterized and Exact Algorithms for Class Domination Coloring [pdf]
with R. Krithika, Saket Saurabh, and Prafullkumar Tale
in International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2017.
 Lossy Kernels for Graph Contraction Problems [pdf]
with R. Krithika, Pranabendu Misra, and Prafullkumar Tale
in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2016.
 Strong Graph Deletion: Bipartite Graphs [pdf]
with M. S. Ramanujan
in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2016.
 A Parameterized Algorithm for MixedCut [pdf]
with M. S. Ramanujan and Saket Saurabh
in Latin American Theoretical Informatics Symposium (LATIN), 2016.
 Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel [pdf]
with Geevarghese Philip and Saket Saurabh
in Mathematical Foundations of Computer Science (MFCS), 2015.
 Bivariate Complexity Analysis of Almost Forest Deletion [pdf]
with Saket Saurabh
in Annual International Computing and Combinatorics Conference (COCOON), 2015.
 Kernel Lower Bounds on String Problems [pdf]
with Manu Basawaraju, Fahad Panolan, Saket Saurabh, and M. S. Ramanujan
in Annual International Computing and Combinatorics Conference (COCOON), 2014.
 Polynomial Kernels for $\lambda$extendible Properties Parameterized Above the PoljakTurzík Bound [pdf]
with Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, and Saket Saurabh
in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2013.
 Parameterized Algorithms for Max Colorable Induced Subgraph problem on Perfect Graphs[pdf]
with Neeldhara Misra, Fahad Panolan, Venkatesh Raman, and Saket Saurabh
in International Workshop on GraphTheoretic Concepts in Computer Science (WG), 2013.
 Kernel lower bounds using conondeterminism: Finding induced hereditary subgraphs [pdf]
with Stefan Kratsch, Marcin Pilipczuk, and Venkatesh Raman
in Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2012.
 Faster Parameterized Algorithms for Deletion to Split Graphs [pdf]
with Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, and M. S. Ramanujan
in Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2012.
 On the kernelization complexity of problems on graphs without long odd cycles [pdf]
with Fahad Panolan
in Annual International Computing and Combinatorics Conference (COCOON), 2012.
Theses
 Parameterized Algorithms for Graph Modification Problems [pdf]
PhD thesis
 Kernel Lower Bounds: A Survey [pdf]
Master's thesis
