Fair k-Centers via Maximum Matching. - Matthew Jones; Huy L. Nguyen; Thy Dinh Nguyen (ICML, 2020)

Differentially Private Clustering via Maximum Coverage. - Matthew Jones; Huy L. Nguyen; Thy Dinh Nguyen (AAAI, 2021)

Fair Range k-center. - Huy Le Nguyen; Thy Dinh Nguyen; Matthew Jones (CoRR, 2022)

An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret. - Matthew Jones; Huy L. Nguyen; Thy Dinh Nguyen (AAAI, 2023)

Improved Learning-augmented Algorithms for k-means and k-medians Clustering. - Thy Dinh Nguyen; Anamay Chaturvedi; Huy L. Nguyen (ICLR, 2023)

Streaming Submodular Maximization with Differential Privacy. - Anamay Chaturvedi; Huy L. Nguyen; Thy Dinh Nguyen (ICML, 2023)