Rolf Fagerberg

105 papers A* 11A 5B 15C 2Journal 51Unranked 13
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Sensitivity Analysis Methodology for Rule-Based Stochastic Chemical Systems.
J. Chem. Inf. Model.
Erika M. Herrera Machado, Jakob L. Andersen, Rolf Fagerberg, Daniel Merkle
2025 J jnl
ChemReservoir - An Open-Source Framework for Chemically-Inspired Reservoir Computing.
IEEE Access
Mehmet Aziz Yirik, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle
2025 J jnl
ChemReservoir - An Open-Source Framework for Chemically-Inspired Reservoir Computing.
CoRR
Mehmet Aziz Yirik, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle
2025 J jnl
Finding Pathways in Reaction Networks guided by Energy Barriers using Integer Linear Programming.
CoRR
Adittya Pal, Rolf Fagerberg, Jakob Lykke Andersen, Peter Dittrich, Daniel Merkle
2025 J jnl
Finding Thermodynamically Favorable Pathways in Chemical Reaction Networks Using Flows in Hypergraphs and Mixed-Integer Linear Programming.
J. Chem. Inf. Model.
Adittya Pal, Rolf Fagerberg, Jakob Lykke Andersen, Christoph Flamm, Peter Dittrich, Daniel Merkle
2025 J jnl
Pathway Realizability in Chemical Networks.
J. Comput. Biol.
Jakob L. Andersen, Sissel Banke, Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Peter F. Stadler
2024 J jnl
Automated Inference of Graph Transformation Rules.
CoRR
Jakob L. Andersen, Akbar Davoodi, Rolf Fagerberg, Christoph Flamm, Walter Fontana, Juraj Kolcák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai Nøjgaard
2024 J jnl
Finding Thermodynamically Favorable Pathways in Reaction Networks using Flows in Hypergraphs and Mixed Integer Linear Programming.
CoRR
Adittya Pal, Rolf Fagerberg, Jakob Lykke Andersen, Christoph Flamm, Peter Dittrich, Daniel Merkle
2024 A conf
On Finding Longest Palindromic Subsequences Using Longest Common Subsequences.
ESA
Gerth Stølting Brodal, Rolf Fagerberg, Casper Moldrup Rysgaard
2024 J jnl
Reaction rebalancing: a novel approach to curating reaction databases.
J. Cheminformatics
Tieu-Long Phan, Klaus Weinbauer, Thomas Gärtner, Daniel Merkle, Jakob L. Andersen, Rolf Fagerberg, Peter F. Stadler
2024 J jnl
Toward the Reconciliation of Inconsistent Molecular Structures from Biochemical Databases.
J. Comput. Biol.
Casper Asbjørn Eriksen, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle
2023 — conf
On the Realisability of Chemical Pathways.
ISBRA
Jakob L. Andersen, Sissel Banke, Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Peter F. Stadler
2023 J jnl
On the Realisability of Chemical Pathways.
CoRR
Jakob L. Andersen, Sissel Banke, Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Peter F. Stadler
2023 — conf
Reconciling Inconsistent Molecular Structures from Biochemical Databases.
ISBRA
Casper Asbjørn Eriksen, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle
2023 J jnl
Reconciling Inconsistent Molecular Structures from Biochemical Databases.
CoRR
Casper Asbjørn Eriksen, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle
2022 J jnl
Characterizing Catalytic Mechanisms with Overlay Graphs.
CoRR
Jakob L. Andersen, Rolf Fagerberg, Christoph Flamm, Walter Fontana, Juraj Kolcák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai Nøjgaard
2022 J jnl
Efficient Modular Graph Transformation Rule Application.
CoRR
Jakob L. Andersen, Rolf Fagerberg, Juraj Kolcák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai Nøjgaard
2022 J jnl
Fragile complexity of adaptive algorithms.
Theor. Comput. Sci.
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
2022 J jnl
Representing Catalytic Mechanisms with Rule Composition.
J. Chem. Inf. Model.
Jakob L. Andersen, Rolf Fagerberg, Christoph Flamm, Walter Fontana, Juraj Kolcák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai Nøjgaard
2021 B conf
An Experimental Study of External Memory Algorithms for Connected Components.
SEA
Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran
2021 C conf
Fragile Complexity of Adaptive Algorithms.
CIAC
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
2021 J jnl
Fragile Complexity of Adaptive Algorithms.
CoRR
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
2021 J jnl
Graph Transformation for Enzymatic Mechanisms.
CoRR
Jakob L. Andersen, Rolf Fagerberg, Christoph Flamm, Walter Fontana, Juraj Kolcák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai Nøjgaard
2021 J jnl
Graph transformation for enzymatic mechanisms.
Bioinform.
Jakob L. Andersen, Rolf Fagerberg, Christoph Flamm, Walter Fontana, Juraj Kolcák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai Nøjgaard
2019 A conf
Fragile Complexity of Comparison-Based Algorithms.
ESA
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
2019 J jnl
Fragile Complexity of Comparison-Based Algorithms.
CoRR
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
2019 J jnl
Handling preferences in student-project allocation.
Ann. Oper. Res.
Marco Chiarandini, Rolf Fagerberg, Stefano Gualandi
2019 B conf
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?
ISAAC
Rolf Fagerberg, David Hammer, Ulrich Meyer
2019 J jnl
On Plane Constrained Bounded-Degree Spanners.
Algorithmica
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2018 J jnl
Continuous Yao graphs.
Comput. Geom.
Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot
2018 J jnl
Finding the K best synthesis plans.
J. Cheminformatics
Rolf Fagerberg, Christoph Flamm, Rojin Kianian, Daniel Merkle, Peter F. Stadler
2017 J jnl
Biased Predecessor Search.
CoRR
Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin
2017 J jnl
Competitive local routing with constraints.
J. Comput. Geom.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2017 J jnl
On Plane Constrained Bounded-Degree Spanners.
CoRR
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2016 J jnl
Biased Predecessor Search.
Algorithmica
Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin
2016 — ch.
Cache-Oblivious B-Tree.
Encyclopedia of Algorithms
Rolf Fagerberg
2016 — ch.
Cache-Oblivious Model.
Encyclopedia of Algorithms
Rolf Fagerberg
2016 — ch.
String Sorting.
Encyclopedia of Algorithms
Rolf Fagerberg
2015 B conf
Competitive Local Routing with Constraints.
ISAAC
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2015 J jnl
New and improved spanning ratios for Yao graphs.
J. Comput. Geom.
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia
2015 J jnl
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.
SIAM J. Comput.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2014 B conf
Biased Predecessor Search.
LATIN
Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin
2014 J jnl
Competitive Local Routing with Constraints.
CoRR
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2014 — conf
Continuous Yao Graphs.
CCCG
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot
2014 J jnl
Continuous Yao Graphs.
CoRR
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot
2014 A* conf
New and Improved Spanning Ratios for Yao Graphs.
SoCG
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia
2014 J jnl
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles.
CoRR
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2013 J jnl
A practical O(n log
BMC Bioinform.
Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Thomas Mailund
2013 A* conf
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
SODA
Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand
2013 J jnl
New and Improved Spanning Ratios for Yao Graphs.
CoRR
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot
2013 J jnl
On the Complexity of Reconstructing Chemical Reaction Networks.
CoRR
Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters, Peter F. Stadler
2013 J jnl
On the Complexity of Reconstructing Chemical Reaction Networks.
Math. Comput. Sci.
Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters, Peter F. Stadler
2012 — conf
Competitive Routing on a Bounded-Degree Plane Spanner.
CCCG
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2012 A* conf
Competitive routing in the half-θ
SODA
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2012 — conf
De-amortizing Binary Search Trees.
ICALP (1)
Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman
2012 A conf
Exploring Chemistry Using SMT.
CP
Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters
2012 B conf
On Plane Constrained Bounded-Degree Spanners.
LATIN
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2011 J jnl
De-amortizing Binary Search Trees
CoRR
Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman
2011 J jnl
The Cost of Cache-Oblivious Searching.
Algorithmica
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
2010 — conf
An
SWAT
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg
2010 J jnl
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
CoRR
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg
2010 J jnl
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Theory Comput. Syst.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
2009 J jnl
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts.
ACM Trans. Algorithms
Philip Bille, Rolf Fagerberg, Inge Li Gørtz
2009 B conf
Online Sorted Range Reporting.
ISAAC
Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz
2008 — ch.
Cache-Oblivious B-Tree.
Encyclopedia of Algorithms
Rolf Fagerberg
2008 — ch.
Cache-Oblivious Model.
Encyclopedia of Algorithms
Rolf Fagerberg
2008 J jnl
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
J. Bioinform. Comput. Biol.
Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg
2008 J jnl
On the adaptiveness of Quicksort.
ACM J. Exp. Algorithmics
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
2008 — ch.
String Sorting.
Encyclopedia of Algorithms
Rolf Fagerberg
2007 B conf
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
APBC
Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg
2007 B conf
Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.
APBC
Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg
2007 J jnl
Engineering a cache-oblivious sorting algorithm.
ACM J. Exp. Algorithmics
Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther
2007 B conf
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts.
CPM
Philip Bille, Rolf Fagerberg, Inge Li Gørtz
2007 A conf
Optimal Resilient Dynamic Dictionaries.
ESA
Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
2007 B conf
Optimal sparse matrix dense vector multiplication in the I/O-model.
SPAA
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
2006 A* conf
Cache-oblivious string dictionaries.
SODA
Gerth Stølting Brodal, Rolf Fagerberg
2006 A conf
External String Sorting: Faster and Cache-Oblivious.
STACS
Rolf Fagerberg, Anna Pagh, Rasmus Pagh
2006 J jnl
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
CoRR
Philip Bille, Rolf Fagerberg, Inge Li Gørtz
2006 J jnl
Recrafting the neighbor-joining method.
BMC Bioinform.
Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips
2005 A* conf
Cache-Aware and Cache-Oblivious Adaptive Sorting.
ICALP
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
2005 — conf
Cache-oblivious planar orthogonal range searching and counting.
SCG
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen
2005 — conf
On the Adaptiveness of Quicksort.
ALENEX/ANALCO
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
2004 — ch.
Balanced Binary Search Trees.
Handbook of Data Structures and Applications
Arne Andersson, Rolf Fagerberg, Kim S. Larsen
2004 — conf
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
SWAT
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
2004 — ch.
Cache-Oblivious Data Structures.
Handbook of Data Structures and Applications
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg
2004 J jnl
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).
Algorithmica
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen
2004 — conf
Engineering a Cache-Oblivious Sorting Algorith.
ALENEX/ANALC
Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther
2003 C conf
Computing Refined Buneman Trees in Cubic Time.
WABI
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao
2003 A* conf
Lower bounds for external memory dictionaries.
SODA
Gerth Stølting Brodal, Rolf Fagerberg
2003 A* conf
On the limits of cache-obliviousness.
STOC
Gerth Stølting Brodal, Rolf Fagerberg
2003 A* conf
The Cost of Cache-Oblivious Searching.
FOCS
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
2002 A* conf
Cache Oblivious Distribution Sweeping.
ICALP
Gerth Stølting Brodal, Rolf Fagerberg
2002 A* conf
Cache oblivious search trees via binary trees of small height.
SODA
Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob
2002 B conf
Funnel Heap - A Cache Oblivious Priority Queue.
ISAAC
Gerth Stølting Brodal, Rolf Fagerberg
2001 B conf
Computing the Quartet Distance between Evolutionary Trees in Time O(n log
ISAAC
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen
2001 B conf
Search Trees with Relaxed Balance and Near-Optimal Height.
WADS
Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen
2001 A* conf
The Complexity of Constructing Evolutionary Trees Using Experiments.
ICALP
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin
1999 B conf
Dynamic Representation of Sparse Graphs.
WADS
Gerth Stølting Brodal, Rolf Fagerberg
1999 — conf
The Complexity of Rebalancing a Binary Search Tree.
FSTTCS
Rolf Fagerberg
1997 J jnl
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
J. Comput. Syst. Sci.
Joan Boyar, Rolf Fagerberg, Kim S. Larsen
1996 J jnl
A Generalization of Binomial Queues.
Inf. Process. Lett.
Rolf Fagerberg
1996 — conf
Binary Search Trees: How Low Can You Go?
SWAT
Rolf Fagerberg
1996 J jnl
Efficient Rebalancing of B-Trees with Relaxed Balance.
Int. J. Found. Comput. Sci.
Kim S. Larsen, Rolf Fagerberg
1995 B conf
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
WADS
Joan Boyar, Rolf Fagerberg, Kim S. Larsen
1995 — conf
B-trees with relaxed balance.
IPPS
Kim S. Larsen, Rolf Fagerberg