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:

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

Showing 23 citing articles:

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: 59

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

High-Performance Graph Storage and Mutation for Graph Processing and Streaming
Soukaina Firmli, Dalila Chiadmi
International journal of electrical and computer engineering systems (2025) Vol. 16, Iss. 1, pp. 19-30
Open Access

Distributed temporal graph analytics with GRADOOP
Christopher Rost, Kevin Gómez, Matthias Täschner, et al.
The VLDB Journal (2021) Vol. 31, Iss. 2, pp. 375-401
Open Access | Times Cited: 25

Construction of Knowledge Graphs: State and Challenges
Marvin Hofer, Daniel Obraczka, Alieh Saeedi, et al.
arXiv (Cornell University) (2023)
Open Access | Times Cited: 7

Construction of Knowledge Graphs: Current State and Challenges
Marvin Hofer, Daniel Obraczka, Alieh Saeedi, et al.
(2023)
Closed Access | Times Cited: 7

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

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

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

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

Streaming Sparse Graphs using Efficient Dynamic Sets
Brian Wheatman, Randal Burns
2021 IEEE International Conference on Big Data (Big Data) (2021), pp. 284-294
Closed Access | Times Cited: 8

Towards Testing ACID Compliance in the LDBC Social Network Benchmark
Jack Waudby, Benjamin A. Steer, Karim Karimov, et al.
Lecture notes in computer science (2021), pp. 1-17
Closed Access | Times Cited: 5

Improving query performance on dynamic graphs
Gala Barquero, Javier Troya, Antonio Vallecillo
Software & Systems Modeling (2020) Vol. 20, Iss. 4, pp. 1011-1041
Open Access | Times Cited: 4

Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking
Seunghwan Min, Ji-Hoon Jang, Kunsoo Park, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 3257-3269
Open Access

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

PDG: A Prefetcher for Dynamic Graph Updating
X. L. Zhang, Cheng Liu, Jiacheng Ni, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2023) Vol. 43, Iss. 4, pp. 1246-1259
Closed Access | Times Cited: 1

An analysis of the graph processing landscape
Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
Journal Of Big Data (2021) Vol. 8, Iss. 1
Open Access | Times Cited: 3

Position paper
Hassan H. Halawa, Matei Ripeanu
(2021), pp. 1-12
Closed Access | Times Cited: 1

Substream-Centric Maximum Matchings on FPGA
Maciej Besta, Marc Fischer, Tal Ben‐Nun, et al.
arXiv (Cornell University) (2020)
Closed Access

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks
Maciej Besta, Jens Domke, Marcel Schneider, et al.
arXiv (Cornell University) (2020)
Closed Access

Semantic Foundations of Seraph Continuous Graph Query Language
Emanuele Falzone, Riccardo Tommasini, Emanuele Della Valle, et al.
(2021)
Closed Access

Bitemporal Property Graphs to Organize Evolving Systems
Christopher Rost, Philip Fritzsche, Lucas Schons, et al.
arXiv (Cornell University) (2021)
Closed Access

Page 1

Scroll to top