Paper 'Testing Forbidden Order Pattern Properties on Hypergrids' accepted to SODA'26; Paper 'EFX for Three Types of Agents' accepted to ACM EC'25; Paper 'Towards Better-Than-2 Approximation for Constrained Correlation Clustering' accepted as a Spotlight Poster to ICML'25.
Research Experience
Junior Professor at Department of Mathematics and Computer Science, University of Cologne (2024-current); Researcher at Max Planck Institute for Informatics, Saarbrücken (2023-2024); Assistant Professor (on leave in the last year) at Chennai Mathematical Institute (2021-2024); Researcher at University of Haifa, Israel (2019-2021), hosted by Dr. Ilan Newman and Dr. Noga Ron-Zewi.
Education
PhD from Boston University in 2019, advised by Dr. Sofya Raskhodnikova; MSc from TIFR Mumbai in 2014, advised by Dr. Kavitha Telikepalli; BTech from National Institute of Technology, Calicut in 2011, advised by Dr. K. Muralikrishnan.
Background
Research interests: Algorithms, with a focus on Sublinear-time algorithms and Approximation algorithms. Interested in the design and analysis of efficient algorithms that work on large high-dimensional datasets, detect and exploit long range structure in the data, and are robust to perturbations, noise, and erasures in the input.
Miscellany
Current PhD student: Harish Chandramouleeswaran, co-advised with Prof. Prajakta Nimbhorkar; Past students: Harish Chandramouleeswaran (MSc, 2023, CMI), Iván Soto (Research Immersion Lab 2023-24, MPII Saarbruecken), Diptaksho Palit (Undergraduate Research Intern, 2022, CMI, now a PhD student at BU), Bhaskar Pandey (Research Intern, 2022, CMI).