Rolf Fagerberg

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 27

Top Topics

External Memory

Graph Transformation

Top Venues

J. Cheminformatics

Publications

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