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
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.Preprints
Fault-tolerant k-Supplier with Outliers [arXiv]
with Deeparnab Chakrabarty and Luc Cote
Publications
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 2021Approximation Algorithms for Continuous Clustering and Facility Location Problems [pdf] [arXiv]
with Deeparnab Chakrabarty and Maryam Negahbani
ESA 2022 [slides from my talk]Popular Matchings in the Hospital-Residents Problem with Two-sided Lower Quotas [pdf]
with Meghana Nasre, Prajakta Nimbhorkar, and Keshav Ranjan
FSTTCS 2021 [talk by Keshav]
Multimapper: Data Density Sensitive Topological Visualization [arXiv] [full text]
Bishal Deb, Ankita Sarkar, Nupur Kumari, Akash Rupela, Piyush Gupta, and Balaji Krishnamurthy
ICDMW 2018
Patents
Generating varied-scale topological visualizations of multi-dimensional data [Google Patents]
Akash Rupela, Piyush Gupta, Nupur Kumari, Bishal Deb, Balaji Krishnamurthy, Ankita Sarkar
US 11,100,127
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]
News
2023
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.
Teaching
I have worked as Head TA for:
(Spring 2022) COSC 31: Algorithms [anonymized student feedback]
(Summer 2021) COSC 30: Discrete Mathematics in Computer Science
I have also worked as TA for:
(Spring 2023) COSC 34/234: Randomized Algorithms
(Fall 2021) COSC 30: Discrete Mathematics in Computer Science
(Spring 2021) COSC 31: Algorithms [anonymized student feedback]