Ankita Sarkar
Department of Computer Science, Dartmouth College, Hanover, NH 03755, USA
Lab: 115, ECSC (Class of 1982 Engineering and Computer Science Center)
Email: ankita.cs.gr@dartmouth.edu
Embedded Files
I am on the job market, looking for research positions primarily in algorithms and AI. Here is my CV :)
I am on the job market, looking for research positions primarily in algorithms and AI. Here is my CV :)
I am a fifth year Ph.D. student in 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. I am currently working on approximation algorithms for clustering problems, under variations of and/or limited information about the ambient metrics. Generally, I enjoy thinking about optimization problems, especially those arising from operations research and social issues.
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.
Research
Research
Theoretical CS Research
(authors listed per the CS Theory custom of alphabetical ordering)Theoretical CS Research
Clustering in Varying Metrics [arXiv]
Deeparnab Chakrabarty, Jonathan Conroy, A.S.
To appear in FSTTCS 2025Fault-tolerant k-Supplier with Outliers [pdf] [arXiv]
Deeparnab Chakrabarty, Luc Cote, A.S.
STACS 2024 [slides from my talk]Popular Critical Matchings in the Many-to-Many Setting [journal] [arXiv]
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, A.S.
Theoretical Computer Science, 982:114281 (2024)
Preliminary version in FSTTCS 2021Approximation Algorithms for Continuous Clustering and Facility Location Problems [pdf] [arXiv]
Deeparnab Chakrabarty, Maryam Negahbani, A.S.
ESA 2022 [slides from my talk]Popular Matchings in the Hospital-Residents Problem with Two-sided Lower Quotas [pdf]
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, A.S.
FSTTCS 2021 [talk by Keshav]
Other CS Research
(authors listed in order of contribution)Other CS Research
Discrete Riemannian Metrics for Vocabulary Manifolds
A.S., Lisa Samoylov, Soroush Vosoughi
In submissionScalable underwater assembly with reconfigurable visual fiducials [arXiv]
Samuel Lensgraf, A.S., Adithya Pediredla, Devin Balkcom, Alberto Quattrini Li
ICRA 2024Multimapper: Data Density Sensitive Topological Visualization [arXiv] [full text]
Bishal Deb, A.S., Nupur Kumari, Akash Rupela, Piyush Gupta, and Balaji Krishnamurthy
ICDMW 2018
Patents
Patents
Generating varied-scale topological visualizations of multi-dimensional data [Google Patents]
Akash Rupela, Piyush Gupta, Nupur Kumari, Bishal Deb, Balaji Krishnamurthy, A.S.
US 11,100,127
Surveys and Reports
Surveys and Reports
Randomization and Logspace [pdf]
Coursework, Dartmouth College, Spring 2022Popular Matchings under Lower Quotas and their relationship to Stability under Classifications [pdf]
Master's thesis, Chennai Mathematical Institute, 2020 [defense slides]
Teaching
Teaching
In the Fall 2025 term, I am working as TA for COSC 40/240: Computational Complexity. I also delivered two guest lectures in this course.
I have worked as Head TA for:
(Spring 2024) COSC 30: Discrete Mathematics in Computer Science
(Spring 2022) COSC 31: Algorithms [anonymized student feedback]
(Summer 2021) COSC 30: Discrete Mathematics in Computer Science
I have also worked as TA for:
Service
Service
Reviewer for SODA 2022, SoCG 2023, SOSA 2023, ICALP 2024, ITCS 2025, ISAAC 2025.
Organizer for Dartmouth's Theory Reading Group in Summer 2021. Co-organizer in Fall 2022.
Page updated
Report abuse