Beating (1−1/e)-Approximation for Weighted Stochastic Matching [SODA 2023]
Online Bipartite Matching with Reusable Resources [EC 2022]
Differentially Private Densest Subgraph [AISTATS 2022]
Generalized Stochastic Matching [AAAI 2022]
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence [ICALP 2021]
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings [AAAI 2021]
Approximate Maximum Matching in Random Streams [SODA 2020]
Stochastic Matching on Uniformly Sparse Graphs [SAGT 2019]
Lower Bounds for External Memory Integer Sorting via Network Coding [STOC 2019]
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs [SODA 2019]
Stochastic Matching with Few Queries: New Algorithms and Tools [SODA 2019]
On the Complexity of Chore Division [IJCAI 2018]
Envy-free Chore Division for An Arbitrary Number of Agents [SODA 2018]
Fair Allocation of Indivisible Goods to Asymmetric Agents [AAMAS 2017]
Journal version appeared in Journal of Artifial Intelligence Research (JAIR)


Research Intern at Google Research, New York - Summer 2020
Research Intern at Adobe Research, San Jose - Summer 2019
Research Visitor at Simons Institute, UC Berkeley - Fall 2018
Research Visitor at Simons Institute, UC Berkeley - Spring 2018