• Scientific co-ordinator of the workshop Parameterized Complexity 201 at IISER Pune, India, during 6-8 March 2020.
  • The paper Hitting Topological Minors is FPT coauthored with Fedor V. Fomin (UiB), Daniel Lokshtanov (UCSB), Saket Saurabh (IMSc), and Meirav Zehavi (BGU) is accepted at the 52nd ACM Symposium on Theory of Computing (STOC 2020) (SoCG 2020).
  • The paper ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs coauthored with Fedor V. Fomin (UiB), Daniel Lokshtanov (UCSB), Saket Saurabh (IMSc), and Meirav Zehavi (BGU) is accepted at the 36th International Symposium on Computational Geometry (SoCG 2020).
  • The paper Manipulating Districts to Win Elections: Fine-Grained Complexity coauthored with Fedor Fomin(UiB), Eduard Eiben (Royal Holloway), and Kirill Simonov (UiB) is accepted at the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020).
  • The paper Parameterization Above a Multiplicative Guarantee coauthored with Fedor Fomin(UiB), Petr Golovach (UiB), Daniel Lokshtanov (UCSB), Saket Saurabh (IMSc), and Meirav Zehavi (BGU), is accepted at the 11th Innovations in Theoretical Computer Science (ITCS 2020) conference.
  • The paper 2-Approximating Feedback Vertex Set in Tournaments coauthored with Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, and Saket Saurabh, is accepted at the ACM-SIAM Symposium on Discrete Algorithms 2020 (SODA'20).
  • The paper Approximation Schemes for Low-Rank Binary Matrix Approximation Problems coauthored with Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, and Saket Saurabh, is accepted in the journal TALG.
  • The paper Rank Vertex Cover as a Natural Problem for Algebraic Compression coauthored with Syed M. Meesum, Saket Saurabh, Meirav Zehavi, is accepted in the journal SIDMA.
  • Talk in The summer school on Algorithmic Tractability via Sparsifiers at Leh, Ladakh, India, during 9-12 August 2019.
  • The paper Going Far From Degeneracy coauthored with Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi, is accepted to ESA 2019.
  • The paper Refined Complexity of PCA with Outliers coauthored with Fedor Fomin, Petr Golovach, and Kirill Simonov, is accepted to ICML 2019.
  • The paper Decomposition of Map Graphs with Applications coauthored with Fedor Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi, is accepted to ICALP 2019.
  • The paper On the Complexity of Mixed Dominating Set coauthored with Jayakrishnan Madathil, Abhishek Sahu, and Saket Saurabh, is accepted to CSR 2019.
  • The paper On the Parameterized Complexity of Edge-Linked Paths coauthored with Neeldhara Misra and Saket Saurabh, is accepted to CSR 2019.
  • The paper Complexity of the Steiner Network Problem with Respect to the Number of Terminals coauthored with Eduard Eiben, Dusan Knop, and Ondrej Suchy, is accepted to STACS 2019.
  • The paper Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity coauthored with Saket Saurabh and Meirav Zehavi, is accepted to SODA 2019.
  • The paper On the parameterized complexity of [1,j]-domination problems coauthored with Mohsen Alambardar Meybodi, Fedor V. Fomin, and Amer E. Mouawad is accepted to FSTTCS 2018.
  • The paper On the Optimality of Pseudo-polynomial Algorithms for Integer Programming coauthored with Fedor V. Fomin, M. S. Ramanujan, and Saket Saurabh is accepted to ESA 2018.
  • The paper Parameterized Low-Rank Binary Matrix Approximation coauthored with Fedor V. Fomin and Petr A. Golovach, is accepted to ICALP 2018.
  • The paper Stability in Barter Exchange Markets coauthored with Sushmita Gupta, Saket Saurabh, and Meirav Zehavi, is accepted to AAMAS 2018.
  • The paper Lossy Kernels for Connected Dominating Set coauthored with Eduard Eiben, Mithilesh Kumar, Amer Mouawad, and Sebastian Siebertz, is accepted to STACS 2018.
  • The paper Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity coauthored with Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and Meirav Zehavi, is accepted to ITCS 2018.
  • The paper Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms coauthored with Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, and Meirav Zehavi, is accepted to SODA 2018.
  • Talk in The Parameterized Complexity Summer School (Workshop co-located with ALGO 2017)
  • Presenting a paper in STOC 2017
  • Presenting a paper in WG 2017
  • Attending SODA 2017