{"total":24,"rows":[{"id":"2106.05610","title":"Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time","created":"2021-06-10","cited_by_count":8,"area":null},{"id":"2112.09055","title":"Hierarchical Clustering: $O(1)$-Approximation for Well-Clustered Graphs","created":"2021-12-16","cited_by_count":8,"area":null},{"id":"2306.09950","title":"Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs","created":"2023-06-16","cited_by_count":7,"area":null},{"id":"2108.06036","title":"An Information-theoretic Perspective of Hierarchical Clustering","created":"2021-08-13","cited_by_count":6,"area":null},{"id":"2302.00037","title":"Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees","created":"2023-01-31","cited_by_count":5,"area":null},{"id":"2205.14198","title":"Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost","created":"2022-05-27","cited_by_count":4,"area":null},{"id":"2205.09721","title":"HyperAid: Denoising in hyperbolic spaces for tree-fitting and hierarchical clustering","created":"2022-05-19","cited_by_count":3,"area":null},{"id":"2206.07633","title":"Sublinear Algorithms for Hierarchical Clustering","created":"2022-06-15","cited_by_count":2,"area":null},{"id":"2305.15022","title":"Hierarchical clustering with dot products recovers hidden tree structure","created":"2023-05-24","cited_by_count":2,"area":null},{"id":"2311.12501","title":"Fair Polylog-Approximate Low-Cost Hierarchical Clustering","created":"2023-11-21","cited_by_count":2,"area":null},{"id":"2401.07091","title":"Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints","created":"2024-01-13","cited_by_count":2,"area":null},{"id":"2104.07061","title":"Exact and Approximate Hierarchical Clustering Using A*","created":"2021-04-14","cited_by_count":1,"area":null},{"id":"2111.06863","title":"Hierarchical Clustering: New Bounds and Objective","created":"2021-11-12","cited_by_count":1,"area":null},{"id":"2107.14442","title":"Distribution free optimality intervals for clustering","created":"2021-07-30","cited_by_count":0,"area":null},{"id":"2109.04266","title":"An objective function for order preserving hierarchical clustering","created":"2021-09-09","cited_by_count":0,"area":null},{"id":"2207.14375","title":"Expanding the class of global objective functions for dissimilarity-based hierarchical clustering","created":"2022-07-28","cited_by_count":0,"area":null},{"id":"2405.15983","title":"Hierarchical Clustering via Local Search","created":"2024-05-24","cited_by_count":0,"area":null},{"id":"2412.20035","title":"A Greedy Strategy for Graph Cut","created":"2024-12-28","cited_by_count":0,"area":null},{"id":"2504.15580","title":"On the Price of Differential Privacy for Hierarchical Clustering","created":"2025-04-22","cited_by_count":0,"area":null},{"id":"2604.23628","title":"Characterizing Admissible Objective Functions for Hierarchical Clustering","created":"2026-04-26","cited_by_count":0,"area":null},{"id":"2606.09051","title":"Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2607.09909","title":"Learning Partition Trees for Nearest Neighbor Search","created":"2026-07-10","cited_by_count":0,"area":null},{"id":"2607.13217","title":"Hierarchical $\\mathcal{F}$-Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs","created":"2026-07-14","cited_by_count":0,"area":null},{"id":"2607.13218","title":"Graph Partitioning with Demands: Generalized Conductance and its Applications","created":"2026-07-14","cited_by_count":0,"area":null}],"next_cursor":null}