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 1-25 of 68 citing articles:

Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries
Maciej Besta, Robert Gerstenberger, Emanuel Peter, et al.
ACM Computing Surveys (2023) Vol. 56, Iss. 2, pp. 1-40
Open Access | Times Cited: 70
Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons
Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, et al.
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2020), pp. 1122-1132
Closed Access | Times Cited: 60
Towards goal-oriented semantic signal processing: Applications and future challenges
Mert Kalfa, Mehmetcan Gok, Arda Atalık, et al.
Digital Signal Processing (2021) Vol. 119, pp. 103134-103134
Open Access | Times Cited: 51
Graph Processing on FPGAs: Taxonomy, Survey, Challenges
Maciej Besta, Dimitri Stanojevic, Johannes de Fine Licht, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 45
SWeG: Lossless and Lossy Summarization of Web-Scale Graphs
Kijung Shin, Amol Ghoting, Myunghwan Kim, et al.
(2019), pp. 1679-1690
Open Access | Times Cited: 43
Motif Prediction with Graph Neural Networks
Maciej Besta, Raphael Grob, Cesare Miglioli, et al.
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2022), pp. 35-45
Open Access | Times Cited: 26
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks
Maciej Besta, Jens Domke, Marcel Schneider, et al.
IEEE Transactions on Parallel and Distributed Systems (2020) Vol. 32, Iss. 4, pp. 943-959
Open Access | Times Cited: 33
Slim graph
Maciej Besta, Simon Weber, Lukas Gianinazzi, et al.
(2019), pp. 1-25
Closed Access | Times Cited: 33
Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism.
Maciej Besta, Marc Fischer, Vasiliki Kalavri, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 23
Multi-relation Graph Summarization
Xiangyu Ke, Arijit Khan, Francesco Bonchi
ACM Transactions on Knowledge Discovery from Data (2022) Vol. 16, Iss. 5, pp. 1-30
Open Access | Times Cited: 14
FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short
Maciej Besta, Marcel Schneider, Marek Konieczny, et al.
(2020), pp. 1-18
Open Access | Times Cited: 20
Functional network analysis reveals an immune tolerance mechanism in cancer
James C. Mathews, Saad Nadeem, Maryam Pouryahya, et al.
Proceedings of the National Academy of Sciences (2020) Vol. 117, Iss. 28, pp. 16339-16345
Open Access | Times Cited: 17
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
Maciej Besta, Armon Carigiet, Kacper Janda, et al.
(2020), pp. 1-17
Open Access | Times Cited: 17
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, et al.
(2021), pp. 243-253
Open Access | Times Cited: 14
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
Maciej Besta, Marc Fischer, Vasiliki Kalavri, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 11
Substream-Centric Maximum Matchings on FPGA
Maciej Besta, Marc Fischer, Tal Ben‐Nun, et al.
ACM Transactions on Reconfigurable Technology and Systems (2020) Vol. 13, Iss. 2, pp. 1-33
Open Access | Times Cited: 10
StarZIP: Streaming Graph Compression Technique for Data Archiving
Batjargal Dolgorsuren, Kifayat Ullah Khan, Mostofa Kamal Rasel, et al.
IEEE Access (2019) Vol. 7, pp. 38020-38034
Open Access | Times Cited: 9
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
Maciej Besta, Armon Carigiet, Zur Vonarburg-Shmaria, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 9
EASC: An exception-aware semantic compression framework for real-world knowledge graphs
Sihang Jiang, Feng Jian-chuan, Chao Wang, et al.
Knowledge-Based Systems (2023) Vol. 278, pp. 110900-110900
Closed Access | Times Cited: 3
Universal Graph Compression: Stochastic Block Models
Alankrita Bhatt, Ziao Wang, Chi Wang, et al.
IEEE Transactions on Information Theory (2023) Vol. 70, Iss. 2, pp. 1473-1497
Open Access | Times Cited: 3
Compression of Dynamic Graphs Generated by a Duplication Model
Krzysztof Turowski, Abram Magner, Wojciech Szpankowski
(2018), pp. 1089-1096
Closed Access | Times Cited: 8
Compression of Biological Networks using a Genetic Algorithm with Localized Merge
Sheridan Houghten, Angelo Romualdo, Tyler K. Collins, et al.
(2019), pp. 1-8
Open Access | Times Cited: 7
Getting Rid of Data
Tova Milo
Journal of Data and Information Quality (2019) Vol. 12, Iss. 1, pp. 1-7
Closed Access | Times Cited: 7
Evolutionary Graph Compression and Diffusion Methods for City Discovery in Role Playing Games
Joseph Alexander Brown, Daniel Ashlock, Sheridan Houghten, et al.
2022 IEEE Congress on Evolutionary Computation (CEC) (2020), pp. 1-8
Open Access | Times Cited: 6
Log(Graph): A Near-Optimal High-Performance Graph Representation
Maciej Besta, Dimitri Stanojevic, Tijana Zivic, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 6
Page 1 - Next Page

Scroll to top