Rolf Fagerberg

1.7k total citations
58 papers, 604 citations indexed

About

Rolf Fagerberg is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Rolf Fagerberg has authored 58 papers receiving a total of 604 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Artificial Intelligence, 25 papers in Computer Networks and Communications and 20 papers in Computational Theory and Mathematics. Recurrent topics in Rolf Fagerberg's work include Algorithms and Data Compression (22 papers), Optimization and Search Problems (12 papers) and Interconnection Networks and Systems (8 papers). Rolf Fagerberg is often cited by papers focused on Algorithms and Data Compression (22 papers), Optimization and Search Problems (12 papers) and Interconnection Networks and Systems (8 papers). Rolf Fagerberg collaborates with scholars based in Denmark, Germany and Canada. Rolf Fagerberg's co-authors include Gerth Stølting Brodal, Riko Jacob, Thomas Mailund, Kim S. Larsen, Christian N. S. Pedersen, Michael A. Bender, Elias Vicari, Marco Chiarandini, Joan Boyar and Stefano Gualandi and has published in prestigious journals such as The Journal of Pediatrics, BMC Bioinformatics and Cell Reports.

In The Last Decade

Rolf Fagerberg

49 papers receiving 553 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Rolf Fagerberg Denmark 15 293 272 141 113 110 58 604
Martin Dietzfelbinger Germany 13 302 1.0× 369 1.4× 93 0.7× 259 2.3× 66 0.6× 56 629
Ramesh Hariharan India 17 172 0.6× 447 1.6× 147 1.0× 343 3.0× 187 1.7× 48 728
Wing-Kai Hon Taiwan 18 228 0.8× 519 1.9× 229 1.6× 160 1.4× 266 2.4× 91 854
Oren Weimann Israel 11 131 0.4× 234 0.9× 45 0.3× 177 1.6× 95 0.9× 40 423
Irene Finocchi Italy 15 323 1.1× 186 0.7× 127 0.9× 131 1.2× 36 0.3× 63 658
Stephen Alstrup Denmark 14 194 0.7× 281 1.0× 94 0.7× 300 2.7× 50 0.5× 43 604
Omer Berkman United States 9 119 0.4× 253 0.9× 79 0.6× 194 1.7× 88 0.8× 17 396
Karl Abrahamson Canada 10 192 0.7× 327 1.2× 120 0.9× 294 2.6× 90 0.8× 23 553
Rüdiger Reischuk Germany 10 326 1.1× 372 1.4× 83 0.6× 396 3.5× 66 0.6× 53 723
Travis Gagie Chile 15 98 0.3× 494 1.8× 97 0.7× 95 0.8× 371 3.4× 85 656

Countries citing papers authored by Rolf Fagerberg

Since Specialization
Citations

This map shows the geographic impact of Rolf Fagerberg's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rolf Fagerberg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rolf Fagerberg more than expected).

Fields of papers citing papers by Rolf Fagerberg

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rolf Fagerberg. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rolf Fagerberg. The network helps show where Rolf Fagerberg may publish in the future.

Co-authorship network of co-authors of Rolf Fagerberg

This figure shows the co-authorship network connecting the top 25 collaborators of Rolf Fagerberg. A scholar is included among the top collaborators of Rolf Fagerberg based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rolf Fagerberg. Rolf Fagerberg is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Fagerberg, Rolf, et al.. (2025). KGG : Knowledge-Guided Graph Self-Supervised Learning to Enhance Molecular Property Predictions. Journal of Chemical Information and Modeling. 65(18). 9443–9458.
2.
Andersen, Jakob L., et al.. (2025). Pathway Realizability in Chemical Networks. Journal of Computational Biology. 32(2). 164–187.
3.
Yingjie, Pan, Daniel Merkle, Jakob L. Andersen, et al.. (2025). SynTemp : Efficient Extraction of Graph-Based Reaction Rules from Large-Scale Reaction Databases. Journal of Chemical Information and Modeling. 65(6). 2882–2896. 1 indexed citations
4.
Andersen, Jakob L., et al.. (2024). Toward the Reconciliation of Inconsistent Molecular Structures from Biochemical Databases. Journal of Computational Biology. 31(6). 498–512. 2 indexed citations
5.
Fagerberg, Rolf, et al.. (2022). Fragile complexity of adaptive algorithms. IT University Of Copenhagen (IT University of Copenhagen).
6.
Andersen, Jakob L., Rolf Fagerberg, Christoph Flamm, et al.. (2022). Representing Catalytic Mechanisms with Rule Composition. Journal of Chemical Information and Modeling. 62(22). 5513–5524. 2 indexed citations
7.
Brodal, Gerth Stølting, et al.. (2021). An Experimental Study of External Memory Algorithms for Connected Components. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 23. 1 indexed citations
8.
Fagerberg, Rolf, et al.. (2019). On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16.
9.
Andersen, Jakob L., et al.. (2018). Towards mechanistic prediction of mass spectra using graph transformation. University of Southern Denmark Research Portal (University of Southern Denmark). 80(3). 705–731. 2 indexed citations
10.
Bose, Prosenjit, et al.. (2018). On Plane Constrained Bounded-Degree Spanners. Algorithmica. 81(4). 1392–1415. 2 indexed citations
11.
Bose, Prosenjit, et al.. (2012). Competitive Routing on a Bounded-Degree Plane Spanner. University of Southern Denmark Research Portal (University of Southern Denmark). 285–290. 1 indexed citations
12.
Bose, Prosenjit, et al.. (2012). Competitive routing in the half-θ6-graph. Symposium on Discrete Algorithms. 1319–1328. 5 indexed citations
13.
Bender, Michael A., Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, & Elias Vicari. (2010). Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. Theory of Computing Systems. 47(4). 934–962. 24 indexed citations
14.
Brodal, Gerth Stølting, et al.. (2009). Speeding Up Neighbour-Joining Tree Construction.
15.
Brodal, Gerth Stølting & Rolf Fagerberg. (2006). Cache-oblivious string dictionaries. Symposium on Discrete Algorithms. 581–590. 23 indexed citations
16.
Arge, Lars, et al.. (2005). Cache-oblivious planar orthogonal range searching and counting. University of Southern Denmark Research Portal (University of Southern Denmark). 160–169. 15 indexed citations
17.
Brodal, Gerth Stølting & Rolf Fagerberg. (2003). Lower bounds for external memory dictionaries. Symposium on Discrete Algorithms. 546–554. 50 indexed citations
18.
Brodal, Gerth Stølting, Rolf Fagerberg, & Riko Jacob. (2002). Cache oblivious search trees via binary trees of small height. Symposium on Discrete Algorithms. 39–48. 70 indexed citations
19.
Boyar, Joan, Rolf Fagerberg, & Kim S. Larsen. (1997). Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. Journal of Computer and System Sciences. 55(3). 504–521. 14 indexed citations
20.
Boyar, Joan, Rolf Fagerberg, & Kim S. Larsen. (1994). Chromatic Priority Queues. The Journal of Pediatrics. 105(6). 868–73. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026