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:

The Graph Structure in the Web – Analyzed on Different Aggregation Levels
Robert Meusel
The Journal of Web Science (2015) Vol. 1, Iss. 1, pp. 33-47
Open Access | Times Cited: 99

Showing 1-25 of 99 citing articles:

Tranco: A Research-Oriented Top Sites Ranking Hardened Against Manipulation
Victor Le Pochat, Tom Van Goethem, Samaneh Tajalizadehkhoob, et al.
(2019)
Open Access | Times Cited: 387
Google matrix analysis of directed networks
Leonardo Ermann, Klaus M. Frahm, Dima L. Shepelyansky
Reviews of Modern Physics (2015) Vol. 87, Iss. 4, pp. 1261-1310
Open Access | Times Cited: 146
Julienne
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
(2017)
Closed Access | Times Cited: 112
Low-latency graph streaming using compressed purely-functional trees
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
(2019)
Open Access | Times Cited: 81
A large database of hypernymy relations extracted from the Web
Julian Seitner, Christian Bizer, Kai Eckert, et al.
Language Resources and Evaluation (2016), pp. 360-367
Closed Access | Times Cited: 85
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
(2018), pp. 393-404
Open Access | Times Cited: 67
GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding
Zhaocheng Zhu, Shizhen Xu, Jian Tang, et al.
(2019)
Open Access | Times Cited: 57
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
ACM Transactions on Parallel Computing (2021) Vol. 8, Iss. 1, pp. 1-70
Open Access | Times Cited: 43
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
Amir Abboud, Keren Censor-Hillel, Seri Khoury
Lecture notes in computer science (2016), pp. 29-42
Closed Access | Times Cited: 56
SSumM: Sparse Summarization of Massive Graphs
Kyuhan Lee, Hyeonsoo Jo, Jihoon Ko, et al.
(2020)
Open Access | Times Cited: 38
Wikipedia mining of hidden links between political leaders
Klaus M. Frahm, Katia Jaffrès‐Runser, Dima L. Shepelyansky
The European Physical Journal B (2016) Vol. 89, Iss. 12
Open Access | Times Cited: 37
GPOP
Kartik Lakhotia, Rajgopal Kannan, Sourav Pati, et al.
ACM Transactions on Parallel Computing (2020) Vol. 7, Iss. 1, pp. 1-24
Closed Access | Times Cited: 31
The Representativeness of Automated Web Crawls as a Surrogate for Human Browsing
David Zeber, Sarah Bird, C.J.S. Oliveira, et al.
(2020), pp. 167-178
Open Access | Times Cited: 30
The Graph Based Benchmark Suite (GBBS)
Laxman Dhulipala, Jessica Shi, Tom Tseng, et al.
(2020)
Open Access | Times Cited: 27
Parallel Clique Counting and Peeling Algorithms
Jessica Shi, Laxman Dhulipala, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2021), pp. 135-146
Open Access | Times Cited: 23
Inferring hidden causal relations between pathway members using reduced Google matrix of directed biological networks
José Lages, Dima L. Shepelyansky, Andreï Zinovyev
PLoS ONE (2018) Vol. 13, Iss. 1, pp. e0190812-e0190812
Open Access | Times Cited: 31
Revisiting Power-law Distributions in Spectra of Real World Networks
Nicole Eikmeier, David F. Gleich
(2017), pp. 817-826
Closed Access | Times Cited: 29
BUbiNG
Paolo Boldi, Andrea Marino, Massimo Santini, et al.
ACM Transactions on the Web (2018) Vol. 12, Iss. 2, pp. 1-26
Closed Access | Times Cited: 29
A Case Study of Complex Graph Analysis in Distributed Memory: Implementation and Optimization
George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2016), pp. 293-302
Closed Access | Times Cited: 28
ConnectIt
Laxman Dhulipala, Changwan Hong, Julian Shun
Proceedings of the VLDB Endowment (2020) Vol. 14, Iss. 4, pp. 653-667
Open Access | Times Cited: 24
Exploring the Topological Properties of the Tor Dark Web
Abdullah Alharbi, Mohd Faizan, Wael Alosaimi, et al.
IEEE Access (2021) Vol. 9, pp. 21746-21758
Open Access | Times Cited: 20
Spiders like Onions: on the Network of Tor Hidden Services
Massimo Bernaschi, Alessandro Celestini, Stefano Guarino, et al.
(2019), pp. 105-115
Closed Access | Times Cited: 23
Sage
Laxman Dhulipala, Charles McGuffey, Hongbo Kang, et al.
Proceedings of the VLDB Endowment (2020) Vol. 13, Iss. 9, pp. 1598-1613
Open Access | Times Cited: 21
SketchNE: Embedding Billion-Scale Networks Accurately in One Hour
Yuyang Xie, Yuxiao Dong, Jiezhong Qiu, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 35, Iss. 10, pp. 10666-10680
Open Access | Times Cited: 6
GOSH: Embedding Big Graphs on Small Hardware
Taha Atahan Akyıldız, Amro Alabsi Aljundi, Kamer Kaya
(2020)
Open Access | Times Cited: 16
Page 1 - Next Page

Scroll to top