I am a lecturer in the Algorithms and Complexity group at the School of Computing, University of Leeds, since Aug 2023. Before that I was an Assistant Professor in the department of Computer Science and Engineering, IIT Hyderabad, India. Prior to joining IITH, I was a PostDoc in the department of Informatics, University of Bergen, Norway, hosted by Prof. Fedor V. Fomin. I obtained PhD in Theoretical Computer Science from The Institute of mathematical sciences, Chennai, India under the supervision of Prof. Saket Saurabh in 2015.


Research Interests

  1. Parameterized Algorithms and Complexity (a.k.a Multivariate analysis of algorithms)
  2. Graph theory and graph algorithms
  3. Approximation algorithms
  4. Streaming algorithms

News

  • Crossing Number in Slightly Superexponential Time coauthored with Daniel Lokshtanov (UCSB), Saket Saurabh (IMSc), Roohani Sharma (University of Bergen), Jie Xue (NYU Shanghai), and Meirav Zehavi (Ben-Gurion University) is accepted at SODA 2025
  • Packing Short Cycles coauthored with Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen (University of Bergen), William Lochet (CNRS, LIRMM), M. S. Ramanujan (University of Warwick), Saket Saurabh (IMSc), and Kirill Simonov (University of Potsdam) is accepted at SODA 2025
  • Inviting research articles for the topical issue on algorithms and combinatorial optimization for the journal Acta Informatica. More details can be found here.

Events

  1. PC member for IPEC 2023 , ESA 2022, IPEC 2021, AAAI 2021
  2. Speaker at Recent Trends on Algorithms (Mar 2022)
  3. Speaker at ACM Winter School on Algorithms and Lower Bounds (Dec 2021-Jan 2022)

Selected Publications

  1. Hitting Topological Minors is FPT.
    with Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi.
    Proc. Symposium on Theory of Computing(STOC) 2020: 1317-1326 [ ArXiv]
  2. Approximation Schemes for Low-Rank Binary Matrix Approximation Problems.
    with Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, and Saket Saurabh.
    In ACM Transactions on Algorithms (TALG) ACM Transactions on Algorithms (TALG) 12:1-12:39 (2020) [ ArXiv]
  3. Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.
    with Fedor V. Fomin, Daniel Lokshtanov, and Saket Saurabh.
    Journal of the ACM(JACM) : 63(4),29(2016)
  4. Representative Sets of Product Families.
    with Fedor V. Fomin, Daniel Lokshtanov, and Saket Saurabh.
    ACM Transactions on Algorithms (TALG) 13(3): 36:1-36:29 (2017).
  5. Deterministic truncation of linear matroids.
    with Daniel Lokshtanov, Pranabendu Misra, and Saket Saurabh.
    ACM Transactions on Algorithms (TALG) 14(2): 14:1-14:20 (2018)
  6. Lossy Kernelization.
    with Daniel Lokshtanov, M. S. Ramanujan, and Saket Saurabh.
    Proc. Symposium on Theory of Computing(STOC) 2017 : 224-237 [Full version]
  7. Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.
    with Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, and Meirav Zehavi.
    Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA) 2018 : 2785-2800
  8. Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.
    with Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, and Saket Saurabh.
    Proc. Symposium on Computational Geometry(SoCG) 2016 : 39:1-39:15
  9. Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.
    with Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi.
    Discrete and Computational Geometry (DCG) 1-33 (2019)