Nearly-Tight and Oblivious Algorithms for Explainable Clustering. - Buddhima Gamlath; Xinrui Jia 001; Adam Polak 001; Ola Svensson (NeurIPS, 2021)

Towards Non-Uniform k-Center with Constant Types of Radii. - Xinrui Jia 001; Lars Rohwedder; Kshiteej Sheth; Ola Svensson (CoRR, 2021)

Towards Non-Uniform k-Center with Constant Types of Radii. - Xinrui Jia 001; Lars Rohwedder; Kshiteej Sheth; Ola Svensson (SOSA, 2022)

Fair colorful k-center clustering. - Xinrui Jia 001; Kshiteej Sheth; Ola Svensson (Math. Program., 2022)

The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. - Xinrui Jia 001; Ola Svensson; Weiqiang Yuan 002 (SODA, 2023)