| Fair colorful k-center clustering X Jia, K Sheth, O Svensson Mathematical Programming, 1-22, 2021 | 58 | 2021 |
| Nearly-tight and oblivious algorithms for explainable clustering B Gamlath, X Jia, A Polak, O Svensson Advances in Neural Information Processing Systems 34, 28929-28939, 2021 | 27 | 2021 |
| The exact bipartite matching polytope has exponential extension complexity X Jia, O Svensson, W Yuan Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 10 | 2023 |
| Towards Non-Uniform k-Center with Constant Types of Radii X Jia, L Rohwedder, K Sheth, O Svensson Symposium on Simplicity in Algorithms (SOSA), 228-237, 2022 | 7 | 2022 |
| Fairness and Explainability in Clustering Problems X Jia EPFL, 2023 | | 2023 |
| Nearly-Tight and Oblivious Algorithms for Explainable Clustering: Full Version B Gamlath, X Jia, A Polak, O Svensson | | |
