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:

A survey on mining and analysis of uncertain graphs
Suman Banerjee
Knowledge and Information Systems (2022) Vol. 64, Iss. 7, pp. 1653-1689
Closed Access | Times Cited: 4

Showing 4 citing articles:

Periodic frequent subgraph mining in dynamic graphs
Jiayu Cai, Zhaoming Chen, Guoting Chen, et al.
International Journal of Machine Learning and Cybernetics (2025)
Closed Access
Efficient Maximal Biclique Enumeration on Large Uncertain Bipartite Graphs
Jianhua Wang, Jianye Yang, Ziyi Ma, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 35, Iss. 12, pp. 12634-12648
Closed Access | Times Cited: 4
Dominance Maximization in Uncertain Graphs
Atharva Tekawade, Suman Banerjee
Lecture notes in computer science (2023), pp. 231-246
Closed Access | Times Cited: 1
An Efficient Embedding Framework for Uncertain Attribute Graph
Ting Jiang, Ting Yu, Xueting Qiao, et al.
Lecture notes in computer science (2023), pp. 219-229
Closed Access
Page 1

Scroll to top