{"total":27,"rows":[{"id":"2106.08448","title":"Correlation Clustering in Constant Many Parallel Rounds","created":"2021-06-15","cited_by_count":15,"area":null},{"id":"2102.08885","title":"Differentially Private Correlation Clustering","created":"2021-02-17","cited_by_count":13,"area":null},{"id":"2111.10699","title":"Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds","created":"2021-11-20","cited_by_count":12,"area":null},{"id":"2305.13560","title":"Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!","created":"2023-05-23","cited_by_count":8,"area":null},{"id":"2108.05697","title":"Local Correlation Clustering with Asymmetric Classification Errors","created":"2021-08-11","cited_by_count":7,"area":null},{"id":"2402.01400","title":"Query-Efficient Correlation Clustering with Noisy Oracle","created":"2024-02-02","cited_by_count":7,"area":null},{"id":"2108.05696","title":"Correlation Clustering with Asymmetric Classification Errors","created":"2021-08-11","cited_by_count":6,"area":null},{"id":"2203.01440","title":"Near-Optimal Correlation Clustering with Privacy","created":"2022-03-02","cited_by_count":6,"area":null},{"id":"2202.08068","title":"A Polyhedral Study of Lifted Multicuts","created":"2022-02-16","cited_by_count":3,"area":null},{"id":"2202.10747","title":"Better Private Algorithms for Correlation Clustering","created":"2022-02-22","cited_by_count":3,"area":null},{"id":"2307.06723","title":"Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds","created":"2023-07-13","cited_by_count":3,"area":null},{"id":"2409.10908","title":"Clustering with Non-adaptive Subset Queries","created":"2024-09-17","cited_by_count":3,"area":null},{"id":"2108.04729","title":"Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models","created":"2021-08-10","cited_by_count":2,"area":null},{"id":"2306.04884","title":"Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling","created":"2023-06-08","cited_by_count":2,"area":null},{"id":"2406.09137","title":"Dynamic Correlation Clustering in Sublinear Update Time","created":"2024-06-13","cited_by_count":2,"area":null},{"id":"2505.05009","title":"Learning Partitions with Optimal Query and Round Complexities","created":"2025-05-08","cited_by_count":2,"area":null},{"id":"2601.16091","title":"Delayed Assignments in Online Non-Centroid Clustering with Stochastic Arrivals","created":"2026-01-22","cited_by_count":2,"area":null},{"id":"2211.07000","title":"Online Correlation Clustering for Dynamic Complete Signed Graphs","created":"2022-11-13","cited_by_count":1,"area":null},{"id":"2502.14536","title":"Algorithms for the preordering problem and their application to the task of jointly clustering and ordering the accounts of a social network","created":"2025-02-20","cited_by_count":1,"area":null},{"id":"2510.10705","title":"Learning-Augmented Streaming Algorithms for Correlation Clustering","created":"2025-10-12","cited_by_count":1,"area":null},{"id":"2208.12636","title":"Four Algorithms for Correlation Clustering: A Survey","created":"2022-08-24","cited_by_count":0,"area":null},{"id":"2302.11295","title":"Fair Correlation Clustering in Forests","created":"2023-02-22","cited_by_count":0,"area":null},{"id":"2404.16131","title":"Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better","created":"2024-04-24","cited_by_count":0,"area":null},{"id":"2404.16676","title":"Multilayer Correlation Clustering","created":"2024-04-25","cited_by_count":0,"area":null},{"id":"2510.15076","title":"Online Correlation Clustering: Simultaneously Optimizing All $\\ell_p$-norms","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2604.15738","title":"Why Colors Make Clustering Harder:Global Integrality Gaps, the Price of Fairness, and Color-Coupled Algorithms in Chromatic Correlation Clustering","created":"2026-04-17","cited_by_count":0,"area":null},{"id":"2608.16315","title":"Correlation Clustering with Random Partial Information","created":"2026-08-17","cited_by_count":0,"area":null}],"next_cursor":null}