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:

Growing a graph matching from a handful of seeds
Ehsan Kazemi, S. Hamed Hassani, Matthias Grossglauser
Proceedings of the VLDB Endowment (2015) Vol. 8, Iss. 10, pp. 1010-1021
Open Access | Times Cited: 114

Showing 1-25 of 114 citing articles:

Linking Users Across Domains with Location Data
Christopher Riederer, Yunsung Kim, Augustin Chaintreau, et al.
(2016), pp. 707-719
Closed Access | Times Cited: 158
REGAL
Mark Heimann, Haoming Shen, Tara Safavi, et al.
(2018)
Open Access | Times Cited: 116
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
Daniel Cullina, Negar Kiyavash
(2016), pp. 63-72
Open Access | Times Cited: 76
Seeded graph matching
Donniell E. Fishkind, Sancar Adali, Heather G. Patsolic, et al.
Pattern Recognition (2018) Vol. 87, pp. 203-215
Open Access | Times Cited: 71
When can two unlabeled networks be aligned under partial overlap?
Ehsan Kazemi, Lyudmila Yartseva, Matthias Grossglauser
(2015), pp. 33-42
Open Access | Times Cited: 50
Efficient random graph matching via degree profiles
Jian Ding, Zongming Ma, Yihong Wu, et al.
Probability Theory and Related Fields (2020) Vol. 179, Iss. 1-2, pp. 29-115
Closed Access | Times Cited: 49
Spectral Alignment of Graphs
Soheil Feizi, Gerald Quon, Mariana Recamonde‐Mendoza, et al.
IEEE Transactions on Network Science and Engineering (2019) Vol. 7, Iss. 3, pp. 1182-1197
Open Access | Times Cited: 47
Partial Recovery in the Graph Alignment Problem
Georgina Hall, Laurent Massoulié
Operations Research (2022) Vol. 71, Iss. 1, pp. 259-272
Open Access | Times Cited: 23
Exact matching of random graphs with constant correlation
Cheng Mao, Mark Rudelson, Konstantin Tikhomirov
Probability Theory and Related Fields (2023) Vol. 186, Iss. 1-2, pp. 327-389
Open Access | Times Cited: 15
The algorithmic phase transition of random graph alignment problem
Hang Du, Shuyang Gong, Rundong Huang
Probability Theory and Related Fields (2025)
Closed Access
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
Daniel Cullina, Negar Kiyavash
ACM SIGMETRICS Performance Evaluation Review (2016) Vol. 44, Iss. 1, pp. 63-72
Open Access | Times Cited: 44
Social Network De-Anonymization Under Scale-Free User Relations
Carla Fabiana Chiasserini, Michele Garetto, Emilio Leonardi
IEEE/ACM Transactions on Networking (2016) Vol. 24, Iss. 6, pp. 3756-3769
Open Access | Times Cited: 43
PROPER: global protein interaction network alignment through percolation matching
Ehsan Kazemi, Hamed Hassani, Matthias Grossglauser, et al.
BMC Bioinformatics (2016) Vol. 17, Iss. 1
Open Access | Times Cited: 39
Seeded graph matching: Efficient algorithms and theoretical guarantees
Farhad Shirani, Siddharth Garg, Elza Erkip
(2017) Vol. 44, pp. 253-257
Open Access | Times Cited: 39
Exact alignment recovery for correlated Erdos Renyi graphs.
Daniel Cullina, Negar Kiyavash
arXiv (Cornell University) (2017)
Closed Access | Times Cited: 37
Fast De-anonymization of Social Networks with Structural Information
Yingxia Shao, Jialin Liu, Shuyang Shi, et al.
Data Science and Engineering (2019) Vol. 4, Iss. 1, pp. 76-92
Open Access | Times Cited: 35
Seeded graph matching via large neighborhood statistics
Elchanan Mossel, Jiaming Xu
Random Structures and Algorithms (2020) Vol. 57, Iss. 3, pp. 570-611
Open Access | Times Cited: 31
Detection Threshold for Correlated Erdős-Rényi Graphs via Densest Subgraph
Jian Ding, Hang Du
IEEE Transactions on Information Theory (2023) Vol. 69, Iss. 8, pp. 5289-5298
Closed Access | Times Cited: 10
Matching recovery threshold for correlated random graphs
Jian Ding, Hang Du
The Annals of Statistics (2023) Vol. 51, Iss. 4
Open Access | Times Cited: 9
Correlated randomly growing graphs
Miklós Z. Rácz, Anirudh Sridhar
The Annals of Applied Probability (2022) Vol. 32, Iss. 2
Open Access | Times Cited: 14
Identifying the same person across two similar social networks in a unified way: Globally and locally
Zhongbao Zhang, Qihang Gu, Yue Tong, et al.
Information Sciences (2017) Vol. 394-395, pp. 53-67
Closed Access | Times Cited: 27
Efficient random graph matching via degree profiles
Jian Ding, Zongming Ma, Yihong Wu, et al.
arXiv (Cornell University) (2018)
Open Access | Times Cited: 27
De-anonymizing Clustered Social Networks by Percolation Graph Matching
Carla Fabiana Chiasserini, Michel Garetto, Emili Leonardi
ACM Transactions on Knowledge Discovery from Data (2018) Vol. 12, Iss. 2, pp. 1-39
Open Access | Times Cited: 24
De-Anonymizing Social Networks With Random Forest Classifier
Jiangtao Ma, Yaqiong Qiao, Guangwu Hu, et al.
IEEE Access (2017) Vol. 6, pp. 10139-10150
Open Access | Times Cited: 24
Blind De-anonymization Attacks using Social Networks
Wei‐Han Lee, Changchang Liu, Shouling Ji, et al.
(2017) Vol. 200, pp. 1-4
Open Access | Times Cited: 22
Page 1 - Next Page

Scroll to top