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:
Compact structure for sparse undirected graphs based on a clique graph partition
Felipe Glaria, C. Hernández, Susana Ladra, et al.
Information Sciences (2020) Vol. 544, pp. 485-499
Closed Access | Times Cited: 13
Felipe Glaria, C. Hernández, Susana Ladra, et al.
Information Sciences (2020) Vol. 544, pp. 485-499
Closed Access | Times Cited: 13
Showing 13 citing articles:
Mining structure overlaps for efficient graph compression
François Pitois, Hamida Seba, Mohammed Haddad
International Journal of Data Science and Analytics (2025)
Closed Access
François Pitois, Hamida Seba, Mohammed Haddad
International Journal of Data Science and Analytics (2025)
Closed Access
Parallel K-clique counting on GPUs
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, et al.
(2022), pp. 1-14
Open Access | Times Cited: 15
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, et al.
(2022), pp. 1-14
Open Access | Times Cited: 15
Parallelizing Maximal Clique Enumeration on GPUs
Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj, et al.
(2023), pp. 162-175
Open Access | Times Cited: 6
Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj, et al.
(2023), pp. 162-175
Open Access | Times Cited: 6
A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux
Annals of Operations Research (2023)
Closed Access | Times Cited: 5
Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux
Annals of Operations Research (2023)
Closed Access | Times Cited: 5
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study
Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux
Information Sciences (2022) Vol. 612, pp. 655-674
Closed Access | Times Cited: 5
Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux
Information Sciences (2022) Vol. 612, pp. 655-674
Closed Access | Times Cited: 5
Zuckerli: A New Compressed Representation for Graphs
Luca Versari, Iulia M. Comşa, Alessio Conte, et al.
IEEE Access (2020) Vol. 8, pp. 219233-219243
Open Access | Times Cited: 6
Luca Versari, Iulia M. Comşa, Alessio Conte, et al.
IEEE Access (2020) Vol. 8, pp. 219233-219243
Open Access | Times Cited: 6
MIP formulations for induced graph optimization problems: a tutorial
Rafael A. Melo, Celso C. Ribeiro
International Transactions in Operational Research (2023) Vol. 30, Iss. 6, pp. 3159-3200
Closed Access | Times Cited: 2
Rafael A. Melo, Celso C. Ribeiro
International Transactions in Operational Research (2023) Vol. 30, Iss. 6, pp. 3159-3200
Closed Access | Times Cited: 2
P2S distance induced locally conjugated orthogonal subspace learning for feature extraction
Bo Li, Zhao-Jie Yang, Anjie Guo
Expert Systems with Applications (2023) Vol. 238, pp. 122170-122170
Closed Access | Times Cited: 1
Bo Li, Zhao-Jie Yang, Anjie Guo
Expert Systems with Applications (2023) Vol. 238, pp. 122170-122170
Closed Access | Times Cited: 1
Iterated multilevel simulated annealing for large-scale graph conductance minimization
Zhi Lü, Jin‐Kao Hao, Una Benlic, et al.
Information Sciences (2021) Vol. 572, pp. 182-199
Open Access | Times Cited: 3
Zhi Lü, Jin‐Kao Hao, Una Benlic, et al.
Information Sciences (2021) Vol. 572, pp. 182-199
Open Access | Times Cited: 3
Graph compression based on transitivity for neighborhood query
Amin Emamzadeh Esmaeili Nejad, Mansoor Zolghadri Jahromi, Mohammad Taheri
Information Sciences (2021) Vol. 576, pp. 312-328
Closed Access | Times Cited: 3
Amin Emamzadeh Esmaeili Nejad, Mansoor Zolghadri Jahromi, Mohammad Taheri
Information Sciences (2021) Vol. 576, pp. 312-328
Closed Access | Times Cited: 3
Efficient game theoretic approach to dynamic graph partitioning
Yuanyuan Zeng, Yangfan Li, Xu Zhou, et al.
Information Sciences (2022) Vol. 606, pp. 892-909
Closed Access | Times Cited: 2
Yuanyuan Zeng, Yangfan Li, Xu Zhou, et al.
Information Sciences (2022) Vol. 606, pp. 892-909
Closed Access | Times Cited: 2
A Graph Partition-Based Large-Scale Distribution Network Reconfiguration Method
Sha Yuan-xia
Computational Intelligence and Neuroscience (2022) Vol. 2022, pp. 1-13
Open Access | Times Cited: 1
Sha Yuan-xia
Computational Intelligence and Neuroscience (2022) Vol. 2022, pp. 1-13
Open Access | Times Cited: 1
K-Clique Counting on GPUs.
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, et al.
arXiv (Cornell University) (2021)
Closed Access
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, et al.
arXiv (Cornell University) (2021)
Closed Access
