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 fourth 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. 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.
Research
Publications in Theoretical CS
(authors listed per the CS Theory custom of alphabetical ordering)Fault-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 Publications
(authors listed in order of contribution)Scalable underwater assembly with reconfigurable visual fiducials [arXiv]
Samuel Lensgraf, A.S., Adithya Pediredla, Devin Balkcom, Alberto Quattrini Li
to appear in 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
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
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
2024
March 27. Speaking at Walkout for a Living Wage II by Graduate Organized Laborers of Dartmouth. At noon on the Dartmouth Green!
March 12-14. Attending STACS 2024 and presenting Fault-tolerant k-Supplier with Outliers.
January 29. Scalable underwater assembly with reconfigurable visual fiducials accepted to ICRA 2024.
Winter quarter. Working as TA for COSC 31: Algorithms taught by Prof. Deeparnab Chakrabarty.
2023
December 13. Fault-tolerant k-Supplier with Outliers accepted to STACS 2024.
November 10. Speaking remotely at Purdue's Theory Seminar. [slides]
October 26. Observing a graduate workers' contract bargaining session.
Teaching
In Spring 2024, I am Head TA for COSC 30: Discrete Mathematics in Computer Science taught by Hsien-Chih Chang.
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:
(Fall 2021) COSC 30: Discrete Mathematics in Computer Science
(Spring 2021) COSC 31: Algorithms [anonymized student feedback]