{"total":14,"rows":[{"id":"2102.07945","title":"Local Hyper-Flow Diffusion","created":"2021-02-16","cited_by_count":8,"area":null},{"id":"2106.05245","title":"Local Algorithms for Finding Densely Connected Clusters","created":"2021-06-09","cited_by_count":6,"area":null},{"id":"2205.02771","title":"Finding Bipartite Components in Hypergraphs","created":"2022-05-05","cited_by_count":4,"area":null},{"id":"2412.03008","title":"Local Clustering on Complex Graphs and Complex Hypergraphs","created":"2024-12-04","cited_by_count":4,"area":null},{"id":"2211.11114","title":"Graph-based Semi-supervised Local Clustering with Few Labeled Nodes","created":"2022-11-20","cited_by_count":3,"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":"2211.12511","title":"Scalable and Effective Conductance-based Graph Clustering","created":"2022-11-22","cited_by_count":2,"area":null},{"id":"2306.08617","title":"Multi-class Graph Clustering via Approximated Effective $p$-Resistance","created":"2023-06-14","cited_by_count":2,"area":null},{"id":"2310.08031","title":"Local Graph Clustering with Noisy Labels","created":"2023-10-12","cited_by_count":2,"area":null},{"id":"2503.20488","title":"Adaptive Local Clustering over Attributed Graphs","created":"2025-03-26","cited_by_count":2,"area":null},{"id":"2504.19419","title":"Advancing Local Clustering on Graphs via Compressive Sensing: Semi-supervised and Unsupervised Methods","created":"2025-04-28","cited_by_count":1,"area":null},{"id":"2105.14629","title":"$\\ell_2$-norm Flow Diffusion in Near-Linear Time","created":"2021-05-30","cited_by_count":0,"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":"2510.08010","title":"Accelerated Evolving Set Processes for Local PageRank Computation","created":"2025-10-09","cited_by_count":0,"area":null}],"next_cursor":null}