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:

Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
Maciej Besta, Torsten Hoefler
arXiv (Cornell University) (2018)
Open Access | Times Cited: 68

Showing 26-50 of 68 citing articles:

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
Symmetry and the Entropy of Small-World Structures and Graphs
Ioannis Kontoyiannis, Yeon-sup Lim, Katia Papakonstantinopoulou, et al.
2022 IEEE International Symposium on Information Theory (ISIT) (2021), pp. 3026-3031
Closed Access | Times Cited: 6
Optimal Representation for Web and Social Network Graphs Based on ${K}^{2}$ -Tree
Fengying Li, Qi Zhang, Tianlong Gu, et al.
IEEE Access (2019) Vol. 7, pp. 52945-52954
Open Access | Times Cited: 5
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra
Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 5
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems
Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwaśniewski, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 5
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons
Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 4
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics
Maciej Besta, Simon Weber, Lukas Gianinazzi, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 4
The Read-Only Semi-External Model
Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, et al.
Society for Industrial and Applied Mathematics eBooks (2021), pp. 70-84
Closed Access | Times Cited: 4
Optimising Queries for Pattern Detection Over Large Scale Temporally Evolving Graphs
Hassan Nazeer Chaudhry, Matteo Rossi
IEEE Access (2024) Vol. 12, pp. 86790-86808
Open Access
Structural Indexing for Conjunctive Path Queries.
Yuya Sasaki, George Fletcher, Makoto Onizuka
(2020)
Closed Access | Times Cited: 3
Compression of Dynamic Graphs Generated by a Duplication Model
Krzysztof Turowski, Abram Magner, Wojciech Szpankowski
Algorithmica (2020) Vol. 82, Iss. 9, pp. 2687-2707
Open Access | Times Cited: 3
FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short
Maciej Besta, Marcel Schneider, Karolina Cynk, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 3
Traversing Large Compressed Graphs on GPUs
Prasun Gera, Hyesoon Kim
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2023), pp. 25-35
Closed Access | Times Cited: 1
DomainNet: Homograph Detection and Understanding in Data Lake Disambiguation
Aristotelis Leventidis, Laura Rocco, Wolfgang Gatterbauer, et al.
ACM Transactions on Database Systems (2023) Vol. 48, Iss. 3, pp. 1-40
Open Access | Times Cited: 1
Scene Graph Lossless Compression with Adaptive Prediction for Objects and Relations
Weiyao Lin, Yufeng Zhang, Wenrui Dai, et al.
ACM Transactions on Multimedia Computing Communications and Applications (2024) Vol. 20, Iss. 7, pp. 1-23
Open Access
Lossy Compression of Adjacency Matrices by Graph Filter Banks
Kenta Yanagiya, Junya Hara, Hiroshi Higashi, et al.
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2024), pp. 9386-9390
Open Access
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
Algorithms on Compressed Time-Evolving Graphs
Michael L. Nelson, Sridhar Radhakrishnan, Chandra N. Sekharan
2021 IEEE International Conference on Big Data (Big Data) (2019), pp. 227-232
Closed Access | Times Cited: 2
Compression and symmetry of small-world graphs and structures
Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, et al.
Communications in Information and Systems (2022) Vol. 22, Iss. 2, pp. 275-302
Closed Access | Times Cited: 2
Universal Graph Compression: Stochastic Block Models
Alankrita Bhatt, Chi Wang, Lele Wang, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 2
Graph automorphisms for compression
Uroš Čibej, Jurij Mihelič
Open Computer Science (2020) Vol. 11, Iss. 1, pp. 51-59
Open Access | Times Cited: 2
Slim Fly: A Cost Effective Low-Diameter Network Topology
Maciej Besta, Torsten Hoefler
(2019)
Closed Access | Times Cited: 1
High-Performance Routing with Multipathing and Path Diversity in Supercomputers and Data Centers.
Maciej Besta, Jens Domke, Marcel Schneider, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 1
An analysis of the SIGMOD 2014 Programming Contest: Complex queries on the LDBC social network graph.
Márton Elekes, János Benjamin Antal, Gábor Szárnyas
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 1
A GraphBLAS solution to the SIGMOD 2014 Programming Contest using multi-source BFS
Márton Elekes, Attila Nagy, David Sandor, et al.
(2020), pp. 1-7
Open Access | Times Cited: 1

Scroll to top