I am a third year Ph.D. student of the Department of Computer Science at Dartmouth College. I am advised by Deeparnab Chakrabarty. My interests lie broadly in Theoretical Computer Science, especially in algorithm design. My current projects seek to develop approximation algorithms for certain clustering problems and covering problems. Generally, I enjoy thinking about algorithms and mathematical structures related to optimization problems, especially those that arise from operations research, social issues, and puzzles.
Before Dartmouth, I spent five enriching years at Chennai Mathematical Institute, India, where I earned an M.Sc. in Computer Science in 2020 and a B.Sc. in Mathematics and Computer Science in 2018. My Master's thesis was supervised by Prajakta Nimbhorkar.
I am currently seeking research internships for Summer 2024, in both industry and academia.
Research"with" indicates that authors are listed per the CS Theory norm of alphabetical ordering.
Popular Critical Matchings in the Many-to-Many Setting [arXiv]
with Meghana Nasre, Prajakta Nimbhorkar, and Keshav Ranjan
to appear in Theoretical Computer Science, 982:114281 (2024)
Preliminary version in FSTTCS 2021
Surveys and Reports
November 10. Speaking remotely at Purdue's Theory Seminar. [slides]
October 26. Observing a graduate workers' contract bargaining session.
October 20. Speaking at the Dartmouth Theory Reading Group.
September 26. Speaking remotely at the UMass Amherst Theory Seminar.
May 12. Visiting and giving a talk at TTI Chicago. [slides]
Spring quarter. Working as TA for COSC 34/234: Randomized Algorithms taught by Prof. Deeparnab Chakrabarty.
I have worked as Head TA for:
I have also worked as TA for: