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:

Graph Summarization Methods and Applications: A Survey
Yike Liu, Tara Safavi, Abhilash Dighe, et al.
arXiv (Cornell University) (2016)
Open Access | Times Cited: 63

Showing 26-50 of 63 citing articles:

Discovering Representative Attribute-stars via Minimum Description Length
Jiahong Liu, Min Zhou, Philippe Fournier‐Viger, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 68-80
Open Access | Times Cited: 6
CSPM: Discovering compressing stars in attributed graphs
Jiahong Liu, Philippe Fournier‐Viger, Min Zhou, et al.
Information Sciences (2022) Vol. 611, pp. 126-158
Closed Access | Times Cited: 6
A supervised approach to time scale detection in dynamic networks
Benjamin Fish, Rajmonda S. Caceres
arXiv (Cornell University) (2017)
Open Access | Times Cited: 9
IoT Crawler with Behavior Analyzer at Fog layer for Detecting Malicious Nodes
Layla Albdour, Saher Manaseer, Ahmad Sharieh
International Journal of Communication Networks and Information Security (IJCNIS) (2022) Vol. 12, Iss. 1
Open Access | Times Cited: 5
CAPER: Coarsen, Align, Project, Refine - A General Multilevel Framework for Network Alignment
Jing Zhu, Danai Koutra, Mark Heimann
Proceedings of the 31st ACM International Conference on Information & Knowledge Management (2022), pp. 4747-4751
Open Access | Times Cited: 5
Approximate Evaluation of Label-Constrained Reachability Queries
Stefania Dumbrava, Angela Bonifati, Amaia Nazabal Ruiz Diaz, et al.
arXiv (Cornell University) (2018)
Open Access | Times Cited: 5
Cash flow prediction of a bank deposit using scalable graph analysis and machine learning
Ryo Kawahara, Mikio Takeuchi
2021 IEEE International Conference on Big Data (Big Data) (2021), pp. 1647-1656
Closed Access | Times Cited: 5
Optimizing collaborative computations for scalable distributed inference in large graphs
Georgiy Levchuk, John Colonna‐Romano
(2018), pp. 23-23
Closed Access | Times Cited: 4
Differentially Describing Groups of Graphs
Corinna Coupette, Sebastian Dalleiger, Jilles Vreeken
Proceedings of the AAAI Conference on Artificial Intelligence (2022) Vol. 36, Iss. 4, pp. 3959-3967
Open Access | Times Cited: 3
Large-Scale Multi-objective Influence Maximisation with Network Downscaling
Elia Cunegatti, Giovanni Iacca, Doina Bucur
Lecture notes in computer science (2022), pp. 207-220
Open Access | Times Cited: 3
Extending the Foresight of Phillip Ein-Dor: Causal Knowledge Analytics
Richard T. Watson, Yuanyuan Song, Xia Zhao, et al.
Journal of the Association for Information Systems (2024) Vol. 25, Iss. 1, pp. 145-157
Open Access
A Methodology for Knowledge Discovery in Labeled and Heterogeneous Graphs
Víctor H. Ortega‐Guzmán, Luis Fernando Gutiérrez-Preciado, Francisco Cervantes, et al.
Applied Sciences (2024) Vol. 14, Iss. 2, pp. 838-838
Open Access
SsAG : Summarization and Sparsification of Attributed Graphs
Sarwan Ali, Muhammad Ahmad, Maham Anwer Beg, et al.
ACM Transactions on Knowledge Discovery from Data (2024) Vol. 18, Iss. 6, pp. 1-22
Closed Access
Finding meaningful paths in heterogeneous graphs with PathWays
Nelly Barret, Antoine Gauquier, Jia-Jean Law, et al.
Information Systems (2024) Vol. 127, pp. 102463-102463
Open Access
Graph Embedding for Citation Recommendation
Haofeng Jia, Érik Saule
arXiv (Cornell University) (2018)
Open Access | Times Cited: 3
A Hierarchical Parallel Graph Summarization Approach Based on Ranking Nodes
Qiang Liu, Jiaxing Wei, Hao Liu, et al.
Applied Sciences (2023) Vol. 13, Iss. 8, pp. 4664-4664
Open Access | Times Cited: 1
A Provable Framework of Learning Graph Embeddings via Summarization
Houquan Zhou, Shenghua Liu, Danai Koutra, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2023) Vol. 37, Iss. 4, pp. 4946-4953
Open Access | Times Cited: 1
Fair Group Summarization with Graph Patterns
Hanchao Ma, Sheng Guan, Mengying Wang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 1982-1994
Closed Access | Times Cited: 1
Enhanced subgraph matching for large graphs using candidate region-based decomposition and ordering
Zubair Ali Ansari, Md. Aslam Parwez, Irfan Rashid Thoker, et al.
Journal of King Saud University - Computer and Information Sciences (2023) Vol. 35, Iss. 8, pp. 101694-101694
Open Access | Times Cited: 1
Semantic enrichment and exploration of open dataset tags
Bruno Portes Costa de Castro, Henrique Fernandes Rodrigues, Giseli Rabello Lopes, et al.
(2019), pp. 417-424
Closed Access | Times Cited: 2
Visualization of path patterns in semantic graphs
José Paulo Leal
Computer Science and Information Systems (2019) Vol. 17, Iss. 1, pp. 229-252
Open Access | Times Cited: 2
Graph Abstraction Based on Node Betweenness Centrality
Arwa M. Aldabobi, Riad Jabri
International Journal of Image Graphics and Signal Processing (2019) Vol. 11, Iss. 11, pp. 10-17
Open Access | Times Cited: 2
Dynamic Diverse Summarisation in Heterogeneous Graph Streams: a Comparison between Thesaurus/Ontology-based and Embeddings-based Approaches
Niki Pavlopoulou
International Journal of Graph Computing (2020) Vol. 1, Iss. 1, pp. 70-94
Open Access | Times Cited: 2
Entity Summarization: State of the Art and Future Challenges
Qingxia Liu, Gong Cheng, Kalpa Gunaratna, et al.
SSRN Electronic Journal (2021)
Open Access | Times Cited: 2
Cosine similarity for multiplex network summarization
Athanasia Polychronopoulou, Fang Zhou, Zoran Obradović
(2021), pp. 56-63
Closed Access | Times Cited: 2

Scroll to top