{"total":17,"rows":[{"id":"2106.07239","title":"Fair Clustering Under a Bounded Cost","created":"2021-06-14","cited_by_count":21,"area":null},{"id":"2106.05423","title":"A New Notion of Individually Fair Clustering: $\\alpha$-Equitable $k$-Center","created":"2021-06-09","cited_by_count":18,"area":null},{"id":"2306.06778","title":"Approximation Algorithms for Fair Range Clustering","created":"2023-06-11","cited_by_count":10,"area":null},{"id":"2207.03600","title":"Individual Preference Stability for Clustering","created":"2022-07-07","cited_by_count":8,"area":null},{"id":"2209.12756","title":"FAL-CUR: Fair Active Learning using Uncertainty and Representativeness on Fair Clustering","created":"2022-09-21","cited_by_count":6,"area":null},{"id":"2109.00708","title":"Efficient Algorithms For Fair Clustering with a New Fairness Notion","created":"2021-09-02","cited_by_count":5,"area":null},{"id":"2204.00536","title":"Semi-FairVAE: Semi-supervised Fair Representation Learning with Adversarial Variational Autoencoder","created":"2022-04-01","cited_by_count":5,"area":null},{"id":"2309.16840","title":"Constant Approximation for Individual Preference Stable Clustering","created":"2023-09-28","cited_by_count":3,"area":null},{"id":"2401.12533","title":"Near-Optimal Algorithms for Constrained k-Center Clustering with Instance-level Background Knowledge","created":"2024-01-23","cited_by_count":2,"area":null},{"id":"2312.09061","title":"Fair Clustering: A Causal Perspective","created":"2023-12-14","cited_by_count":1,"area":null},{"id":"2403.10365","title":"Scalable Algorithms for Individual Preference Stable Clustering","created":"2024-03-15","cited_by_count":1,"area":null},{"id":"2406.15960","title":"Fair Clustering: Critique, Caveats, and Future Directions","created":"2024-06-22","cited_by_count":1,"area":null},{"id":"2601.11883","title":"Approximation Algorithm for Constrained $k$-Center Clustering: A Local Search Approach","created":"2026-01-17","cited_by_count":1,"area":null},{"id":"2405.10378","title":"A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering","created":"2024-05-16","cited_by_count":0,"area":null},{"id":"2510.27136","title":"FairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance","created":"2025-10-31","cited_by_count":0,"area":null},{"id":"2602.17330","title":"SubQuad: Near-Quadratic-Free Structure Inference with Distribution-Balanced Objectives in Adaptive Receptor framework","created":"2026-02-19","cited_by_count":0,"area":null},{"id":"2605.16446","title":"Avoiding Structural Failure Modes in Tabular Fair SSL: Online Primal-Dual Allocation under Confidence Gating","created":"2026-05-15","cited_by_count":0,"area":null}],"next_cursor":null}