Sherry Sarkar

Sherry Sarkar

Algorithms, Combinatorics, and Optimization (ACO) PhD Student at Carnegie Mellon

Research

Publications

  1. Mahabadi, S., Sarkar, S., & Tarnawski, J. (2025). Improved Algorithms for Fair Matroid Submodular Maximization. Neural Information Processing Systems (NeurIPS).

  2. Braun, A., & Sarkar, S. (2024). The Secretary Problem with Predicted Additive Gap. Neural Information Processing Systems (NeurIPS).

  3. Hathcock, D., Jin, B., Patton, K., Sarkar, S., Zlatin, M. (2024). The Online Submodular Assignment Problem. Foundations of Computer Science (FOCS).

  4. Buchbinder, N., Gupta, A., Hathcock, D., Karlin, A., & Sarkar, S. (2024). Maintaining Matroid Intersections Online. Symposium on Discrete Algorithms (SODA).

  5. Gupta, A., Lee, E., Li, J., Mucha, M., Newman, H., & Sarkar, S. (2022). Matroid-based tsp rounding for half-integral solutions. Integer Programming and Combinatorial Optimization (IPCO).

  6. Sarkar, S., & Soberón, P. (2022). Tolerance for colorful tverberg partitions. European Journal of Combinatorics, 103, 103527. 

  7. Sarkar, S., Xue, A., & Soberón, P. (2021). Quantitative combinatorial geometry for concave functions. Journal of Combinatorial Theory, Series A, 182, 105465. 

  8. Rubinstein-Salzedo, S., & Sarkar, S. (2020). Stability for take-away games. Journal of Integer Sequences, 23.

In Submission

  1. Long, Y., Mahabadi, S., Sarkar, S., & Tarnawski, J. (2025). Online Steiner Forest with Recourse. (submitted)

Surveys

  1. A survey on sum of squares and pseudo-distributions used on the knapsack problem. Written by Pravesh Kothari and I.