B-trees with relaxed balance. - Kim S. Larsen; Rolf Fagerberg (IPPS, 1995)

Binary Search Trees: How Low Can You Go? - Rolf Fagerberg (SWAT, 1996)

Efficient Rebalancing of B-Trees with Relaxed Balance. - Kim S. Larsen; Rolf Fagerberg (Int. J. Found. Comput. Sci., 1996)

A Generalization of Binomial Queues. - Rolf Fagerberg (Inf. Process. Lett., 1996)

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. - Joan Boyar; Rolf Fagerberg; Kim S. Larsen (J. Comput. Syst. Sci., 1997)

The Complexity of Rebalancing a Binary Search Tree. - Rolf Fagerberg (FSTTCS, 1999)

Dynamic Representation of Sparse Graphs. - Gerth Stølting Brodal; Rolf Fagerberg (WADS, 1999)

The Complexity of Constructing Evolutionary Trees Using Experiments. - Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen; Anna Östlin (ICALP, 2001)

Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n). - Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen (ISAAC, 2001)

Search Trees with Relaxed Balance and Near-Optimal Height. - Rolf Fagerberg; Rune E. Jensen; Kim S. Larsen (WADS, 2001)

Cache Oblivious Distribution Sweeping. - Gerth Stølting Brodal; Rolf Fagerberg (ICALP, 2002)

Funnel Heap - A Cache Oblivious Priority Queue. - Gerth Stølting Brodal; Rolf Fagerberg (ISAAC, 2002)

Cache oblivious search trees via binary trees of small height. - Gerth Stølting Brodal; Rolf Fagerberg; Riko Jacob (SODA, 2002)

Lower bounds for external memory dictionaries. - Gerth Stølting Brodal; Rolf Fagerberg (SODA, 2003)

On the limits of cache-obliviousness. - Gerth Stølting Brodal; Rolf Fagerberg (STOC, 2003)

Computing Refined Buneman Trees in Cubic Time. - Gerth Stølting Brodal; Rolf Fagerberg; Anna Östlin; Christian N. S. Pedersen; S. Srinivasa Rao 001 (WABI, 2003)

Engineering a Cache-Oblivious Sorting Algorith. - Gerth Stølting Brodal; Rolf Fagerberg; Kristoffer Vinther (ALENEX/ANALC, 2004)

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. - Gerth Stølting Brodal; Rolf Fagerberg; Ulrich Meyer 001; Norbert Zeh (SWAT, 2004)

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). - Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen (Algorithmica, 2004)

Balanced Binary Search Trees. - Arne Andersson; Rolf Fagerberg; Kim S. Larsen (Handbook of Data Structures and Applications, 2004)

Cache-Oblivious Data Structures. - Lars Arge; Gerth Stølting Brodal; Rolf Fagerberg (Handbook of Data Structures and Applications, 2004)

Cache-oblivious planar orthogonal range searching and counting. - Lars Arge; Gerth Stølting Brodal; Rolf Fagerberg; Morten Laustsen (SCG, 2005)

Cache-Aware and Cache-Oblivious Adaptive Sorting. - Gerth Stølting Brodal; Rolf Fagerberg; Gabriel Moruz (ICALP, 2005)

Cache-oblivious string dictionaries. - Gerth Stølting Brodal; Rolf Fagerberg (SODA, 2006)

External String Sorting: Faster and Cache-Oblivious. - Rolf Fagerberg; Anna Pagh; Rasmus Pagh (STACS, 2006)

Recrafting the neighbor-joining method. - Thomas Mailund; Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen; Derek Phillips (BMC Bioinform., 2006)

Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. - Martin Stig Stissing; Christian N. S. Pedersen; Thomas Mailund; Gerth Stølting Brodal; Rolf Fagerberg (APBC, 2007)

Optimal Resilient Dynamic Dictionaries. - Gerth Stølting Brodal; Rolf Fagerberg; Irene Finocchi; Fabrizio Grandoni 001; Giuseppe F. Italiano; Allan Grønlund Jørgensen; Gabriel Moruz; Thomas Mølhave (ESA, 2007)

Engineering a cache-oblivious sorting algorithm. - Gerth Stølting Brodal; Rolf Fagerberg; Kristoffer Vinther (ACM J. Exp. Algorithmics, 2007)

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. - Martin Stig Stissing; Thomas Mailund; Christian N. S. Pedersen; Gerth Stølting Brodal; Rolf Fagerberg (J. Bioinform. Comput. Biol., 2008)

On the adaptiveness of Quicksort. - Gerth Stølting Brodal; Rolf Fagerberg; Gabriel Moruz (ACM J. Exp. Algorithmics, 2008)

Cache-Oblivious B-Tree. - Rolf Fagerberg (Encyclopedia of Algorithms, 2008)

Cache-Oblivious Model. - Rolf Fagerberg (Encyclopedia of Algorithms, 2008)

String Sorting. - Rolf Fagerberg (Encyclopedia of Algorithms, 2008)

Online Sorted Range Reporting. - Gerth Stølting Brodal; Rolf Fagerberg; Mark Greve; Alejandro López-Ortiz (ISAAC, 2009)

Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. - Philip Bille; Rolf Fagerberg; Inge Li Gørtz (ACM Trans. Algorithms, 2009)

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. - Prosenjit Bose; Karim Douïeb; Vida Dujmovic; Rolf Fagerberg (SWAT, 2010)

An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times - Prosenjit Bose; Karim Douïeb; Vida Dujmovic; Rolf Fagerberg (CoRR, 2010)

Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. - Michael A. Bender; Gerth Stølting Brodal; Rolf Fagerberg; Riko Jacob; Elias Vicari (Theory Comput. Syst., 2010)

The Cost of Cache-Oblivious Searching. - Michael A. Bender; Gerth Stølting Brodal; Rolf Fagerberg; Dongdong Ge; Simai He; Haodong Hu; John Iacono; Alejandro López-Ortiz (Algorithmica, 2011)

Competitive Routing on a Bounded-Degree Plane Spanner. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (CCCG, 2012)

Exploring Chemistry Using SMT. - Rolf Fagerberg; Christoph Flamm; Daniel Merkle; Philipp Peters (CP, 2012)

De-amortizing Binary Search Trees. - Prosenjit Bose; Sébastien Collette; Rolf Fagerberg; Stefan Langerman (ICALP (1), 2012)

Competitive routing in the half-θ6-graph. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (SODA, 2012)

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. - Gerth Stølting Brodal; Rolf Fagerberg; Thomas Mailund; Christian N. S. Pedersen; Andreas Sand (SODA, 2013)

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. - Andreas Sand; Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen; Thomas Mailund (BMC Bioinform., 2013)

New and Improved Spanning Ratios for Yao Graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot (CoRR, 2013)

On the Complexity of Reconstructing Chemical Reaction Networks. - Rolf Fagerberg; Christoph Flamm; Daniel Merkle; Philipp Peters; Peter F. Stadler (Math. Comput. Sci., 2013)

Continuous Yao Graphs. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; André van Renssen; Perouz Taslakian; Sander Verdonschot (CCCG, 2014)

New and improved spanning ratios for Yao graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Wah Loon Keng; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot; Ge Xia (J. Comput. Geom., 2015)

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (SIAM J. Comput., 2015)

Biased Predecessor Search. - Prosenjit Bose; Rolf Fagerberg; John Howat; Pat Morin (Algorithmica, 2016)

Cache-Oblivious B-Tree. - Rolf Fagerberg (Encyclopedia of Algorithms, 2016)

Cache-Oblivious Model. - Rolf Fagerberg (Encyclopedia of Algorithms, 2016)

String Sorting. - Rolf Fagerberg (Encyclopedia of Algorithms, 2016)

Competitive local routing with constraints. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (J. Comput. Geom., 2017)

Continuous Yao graphs. - Davood Bakhshesh; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; Mohammad Farshi; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2018)

Finding the K best synthesis plans. - Rolf Fagerberg; Christoph Flamm; Rojin Kianian; Daniel Merkle; Peter F. Stadler (J. Cheminformatics, 2018)

Fragile Complexity of Comparison-Based Algorithms. - Peyman Afshani; Rolf Fagerberg; David Hammer; Riko Jacob; Irina Kostitsyna; Ulrich Meyer 001; Manuel Penschuck; Nodari Sitchinava (ESA, 2019)

On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? - Rolf Fagerberg; David Hammer; Ulrich Meyer 001 (ISAAC, 2019)

On Plane Constrained Bounded-Degree Spanners. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (Algorithmica, 2019)

Handling preferences in student-project allocation. - Marco Chiarandini; Rolf Fagerberg; Stefano Gualandi (Ann. Oper. Res., 2019)

An Experimental Study of External Memory Algorithms for Connected Components. - Gerth Stølting Brodal; Rolf Fagerberg; David Hammer; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (SEA, 2021)

Graph transformation for enzymatic mechanisms. - Jakob L. Andersen; Rolf Fagerberg; Christoph Flamm; Walter Fontana; Juraj Kolcák; Christophe V. F. P. Laurent; Daniel Merkle; Nikolai Nøjgaard (Bioinform., 2021)

Efficient Modular Graph Transformation Rule Application. - Jakob L. Andersen; Rolf Fagerberg; Juraj Kolcák; Christophe V. F. P. Laurent; Daniel Merkle; Nikolai Nøjgaard (CoRR, 2022)

Characterizing Catalytic Mechanisms with Overlay Graphs. - Jakob L. Andersen; Rolf Fagerberg; Christoph Flamm; Walter Fontana; Juraj Kolcák; Christophe V. F. P. Laurent; Daniel Merkle; Nikolai Nøjgaard (CoRR, 2022)

Representing Catalytic Mechanisms with Rule Composition. - Jakob L. Andersen; Rolf Fagerberg; Christoph Flamm; Walter Fontana; Juraj Kolcák; Christophe V. F. P. Laurent; Daniel Merkle; Nikolai Nøjgaard (J. Chem. Inf. Model., 2022)

Fragile complexity of adaptive algorithms. - Prosenjit Bose; Pilar Cano; Rolf Fagerberg; John Iacono; Riko Jacob; Stefan Langerman (Theor. Comput. Sci., 2022)

On the Realisability of Chemical Pathways. - Jakob L. Andersen; Sissel Banke; Rolf Fagerberg; Christoph Flamm; Daniel Merkle; Peter F. Stadler (ISBRA, 2023)

Reconciling Inconsistent Molecular Structures from Biochemical Databases. - Casper Asbjørn Eriksen; Jakob Lykke Andersen; Rolf Fagerberg; Daniel Merkle (ISBRA, 2023)

On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. - Gerth Stølting Brodal; Rolf Fagerberg; Casper Moldrup Rysgaard (ESA, 2024)

Automated Inference of Graph Transformation Rules. - Jakob L. Andersen; Akbar Davoodi; Rolf Fagerberg; Christoph Flamm; Walter Fontana; Juraj Kolcák; Christophe V. F. P. Laurent; Daniel Merkle; Nikolai Nøjgaard (CoRR, 2024)

Finding Thermodynamically Favorable Pathways in Reaction Networks using Flows in Hypergraphs and Mixed Integer Linear Programming. - Adittya Pal; Rolf Fagerberg; Jakob Lykke Andersen; Christoph Flamm; Peter Dittrich; Daniel Merkle (CoRR, 2024)

Toward the Reconciliation of Inconsistent Molecular Structures from Biochemical Databases. - Casper Asbjørn Eriksen; Jakob Lykke Andersen; Rolf Fagerberg; Daniel Merkle (J. Comput. Biol., 2024)

Reaction rebalancing: a novel approach to curating reaction databases. - Tieu-Long Phan; Klaus Weinbauer; Thomas Gärtner 001; Daniel Merkle; Jakob L. Andersen; Rolf Fagerberg; Peter F. Stadler (J. Cheminformatics, 2024)

ChemReservoir - An Open-Source Framework for Chemically-Inspired Reservoir Computing. - Mehmet Aziz Yirik; Jakob Lykke Andersen; Rolf Fagerberg; Daniel Merkle (IEEE Access, 2025)

Pathway Realizability in Chemical Networks. - Jakob L. Andersen; Sissel Banke; Rolf Fagerberg; Christoph Flamm; Daniel Merkle; Peter F. Stadler (J. Comput. Biol., 2025)

Finding Thermodynamically Favorable Pathways in Chemical Reaction Networks Using Flows in Hypergraphs and Mixed-Integer Linear Programming. - Adittya Pal; Rolf Fagerberg; Jakob Lykke Andersen; Christoph Flamm; Peter Dittrich; Daniel Merkle (J. Chem. Inf. Model., 2025)

SynTemp: Efficient Extraction of Graph-Based Reaction Rules from Large-Scale Reaction Databases. - Tieu-Long Phan; Klaus Weinbauer; Marcos E. González Laffitte; Yingjie Pan; Daniel Merkle; Jakob L. Andersen; Rolf Fagerberg; Christoph Flamm; Peter F. Stadler (J. Chem. Inf. Model., 2025)

Finding Pathways in Reaction Networks guided by Energy Barriers using Integer Linear Programming. - Adittya Pal; Rolf Fagerberg; Jakob Lykke Andersen; Peter Dittrich; Daniel Merkle (CoRR, 2025)