Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Hypergraph Cuts with General Splitting Functions
Nate Veldt, Austin R. Benson, Jon Kleinberg
SIAM Review (2022) Vol. 64, Iss. 3, pp. 650-685
Open Access | Times Cited: 36

Showing 1-25 of 36 citing articles:

A Survey on the Densest Subgraph Problem and its Variants
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, et al.
ACM Computing Surveys (2024) Vol. 56, Iss. 8, pp. 1-40
Open Access | Times Cited: 17
Learning the effective order of a hypergraph dynamical system
Leonie Neuhäuser, Michael Scholkemper, Francesco Tudisco, et al.
Science Advances (2024) Vol. 10, Iss. 19
Open Access | Times Cited: 7
Core-Periphery Detection in Hypergraphs
Francesco Tudisco, Desmond J. Higham
SIAM Journal on Mathematics of Data Science (2023) Vol. 5, Iss. 1, pp. 1-21
Open Access | Times Cited: 16
Hypergraph clustering by iteratively reweighted modularity maximization
Tarun Kumar, Sankaran Vaidyanathan, Harini Ananthapadmanabhan, et al.
Applied Network Science (2020) Vol. 5, Iss. 1
Open Access | Times Cited: 33
A Survey on Hypergraph Mining: Patterns, Tools, and Generators
Geon Lee, Fanchen Bu, Tina Eliassi‐Rad, et al.
ACM Computing Surveys (2025)
Open Access
Hypergraph Change Point Detection Using Adapted Cardinality-Based Gadgets: Applications in Dynamic Legal Structures
Hiroki Matsumoto, Takahiro Yoshida, Ryoma Kondo, et al.
Studies in computational intelligence (2025), pp. 3-15
Closed Access
Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation
Yiran Li, Renchi Yang, J. Y. Shi
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 2, pp. 1-23
Closed Access | Times Cited: 10
Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning
Meng Liu, Nate Veldt, Haoyu Song, et al.
(2021), pp. 2092-2103
Open Access | Times Cited: 20
The energy-balance method for optimal control in renewable energy applications
Chris Guiver, Mark R. Opmeer
Renewable energy focus (2024) Vol. 50, pp. 100582-100582
Open Access | Times Cited: 2
Nonlinear Higher-Order Label Spreading
Francesco Tudisco, Austin R. Benson, Konstantin Prokopchik
(2021), pp. 2402-2413
Open Access | Times Cited: 12
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
Kimon Fountoulakis, Meng Liu, David F. Gleich, et al.
SIAM Review (2023) Vol. 65, Iss. 1, pp. 59-143
Open Access | Times Cited: 4
Comparing the principal eigenvector of a hypergraph and its shadows
G. J. Clark, Felipe Thomaz, Andrew T. Stephen
Linear Algebra and its Applications (2023) Vol. 673, pp. 46-68
Open Access | Times Cited: 4
Penalized Flow Hypergraph Local Clustering
Hao Zhong, Yubo Zhang, Chenggang Yan, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 36, Iss. 5, pp. 2110-2125
Closed Access | Times Cited: 4
Community detection in hypergraphs via mutual information maximization
Jürgen Kritschgau, Daniel Kaiser, Oliver Alvarado Rodriguez, et al.
Scientific Reports (2024) Vol. 14, Iss. 1
Open Access | Times Cited: 1
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs
Nate Veldt, Anthony Wirth, David F. Gleich
(2020)
Open Access | Times Cited: 9
Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data.
Austin R. Benson, David F. Gleich, Desmond J. Higham
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 6
A Survey on the Densest Subgraph Problem and its Variants
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, et al.
arXiv (Cornell University) (2023)
Open Access | Times Cited: 2
Localized Flow-Based Clustering in Hypergraphs
Nate Veldt, Austin R. Benson, Jon Kleinberg
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 5
Local hypergraph clustering using capacity releasing diffusion
Rania Ibrahim, David F. Gleich
PLoS ONE (2020) Vol. 15, Iss. 12, pp. e0243485-e0243485
Open Access | Times Cited: 5
Nonlinear Higher-Order Label Spreading
Francesco Tudisco, Austin R. Benson, Konstantin Prokopchik
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 4
HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering
Ali Aghdaei, Zhiqiang Zhao, Zhuo Feng
2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) (2021), pp. 1-9
Open Access | Times Cited: 4
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs
Nate Veldt, Anthony Wirth, David F. Gleich
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 3
Augmented Sparsifiers for Generalized Hypergraph Cuts.
Austin R. Benson, Jon Kleinberg, Nate Veldt
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 3
Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning
Meng Liu, Nate Veldt, Haoyu Song, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 3
Cut-matching Games for Generalized Hypergraph Ratio Cuts
Nate Veldt
Proceedings of the ACM Web Conference 2022 (2023), pp. 694-704
Open Access | Times Cited: 1
Page 1 - Next Page

Scroll to top