{"total":13,"rows":[{"id":"2306.09950","title":"Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs","created":"2023-06-16","cited_by_count":7,"area":null},{"id":"2310.10939","title":"Fast and Simple Spectral Clustering in Theory and Practice","created":"2023-10-17","cited_by_count":5,"area":null},{"id":"2503.20505","title":"Riemannian Optimization on Relaxed Indicator Matrix Manifold","created":"2025-03-26","cited_by_count":5,"area":null},{"id":"2304.03170","title":"Spectral Toolkit of Algorithms for Graphs: Technical Report (1)","created":"2023-04-05","cited_by_count":3,"area":null},{"id":"2310.13870","title":"Fast Approximation of Similarity Graphs with Kernel Density Estimation","created":"2023-10-21","cited_by_count":3,"area":null},{"id":"2304.14531","title":"High-dimensional Clustering onto Hamiltonian Cycle","created":"2023-04-27","cited_by_count":2,"area":null},{"id":"2308.00504","title":"Explainable Graph Spectral Clustering of Text Documents","created":"2023-08-01","cited_by_count":2,"area":null},{"id":"2408.10084","title":"TANGO: Clustering with Typicality-Aware Nonlocal Mode-Seeking and Graph-Cut Optimization","created":"2024-08-19","cited_by_count":1,"area":null},{"id":"2510.12669","title":"Structure-Aware Spectral Sparsification via Uniform Edge Sampling","created":"2025-10-14","cited_by_count":1,"area":null},{"id":"2212.14345","title":"On Learning the Structure of Clusters in Graphs","created":"2022-12-29","cited_by_count":0,"area":null},{"id":"2305.06541","title":"Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser","created":"2023-05-11","cited_by_count":0,"area":null},{"id":"2406.03152","title":"Dynamic Spectral Clustering with Provable Approximation Guarantee","created":"2024-06-05","cited_by_count":0,"area":null},{"id":"2511.23261","title":"An Improved and Generalised Analysis for Spectral Clustering","created":"2025-11-28","cited_by_count":0,"area":null}],"next_cursor":null}