default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRolf Fagerberg
Person information
- affiliation: University of Southern Denmark, Odense, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]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): 498-512 (2024)- [j25]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): 82 (2024) - [c46]Gerth Stølting Brodal, Rolf Fagerberg, Casper Moldrup Rysgaard:
On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. ESA 2024: 35:1-35:16 - [i18]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 abs/2404.02692 (2024) - 2023
- [c45]Casper Asbjørn Eriksen, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle:
Reconciling Inconsistent Molecular Structures from Biochemical Databases. ISBRA 2023: 58-71 - [c44]Jakob L. Andersen, Sissel Banke, Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Peter F. Stadler:
On the Realisability of Chemical Pathways. ISBRA 2023: 409-419 - [i17]Casper Asbjørn Eriksen, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle:
Reconciling Inconsistent Molecular Structures from Biochemical Databases. CoRR abs/2308.12735 (2023) - [i16]Jakob L. Andersen, Sissel Banke, Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Peter F. Stadler:
On the Realisability of Chemical Pathways. CoRR abs/2309.10629 (2023) - 2022
- [j24]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): 5513-5524 (2022) - [j23]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919: 92-102 (2022) - [i15]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 abs/2201.04360 (2022) - [i14]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 abs/2201.04515 (2022) - 2021
- [j22]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): 392-400 (2021) - [c43]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CIAC 2021: 144-157 - [c42]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: 23:1-23:23 - [i13]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CoRR abs/2102.00338 (2021) - [i12]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 abs/2102.03292 (2021)
2010 – 2019
- 2019
- [j21]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. Algorithmica 81(4): 1392-1415 (2019) - [j20]Marco Chiarandini, Rolf Fagerberg, Stefano Gualandi:
Handling preferences in student-project allocation. Ann. Oper. Res. 275(1): 39-78 (2019) - [c41]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. ESA 2019: 2:1-2:19 - [c40]Rolf Fagerberg, David Hammer, Ulrich Meyer:
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? ISAAC 2019: 35:1-35:16 - [i11]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. CoRR abs/1901.02857 (2019) - 2018
- [j19]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: 42-52 (2018) - [j18]Rolf Fagerberg, Christoph Flamm, Rojin Kianian, Daniel Merkle, Peter F. Stadler:
Finding the K best synthesis plans. J. Cheminformatics 10(1): 19:1-19:21 (2018) - 2017
- [j17]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive local routing with constraints. J. Comput. Geom. 8(1): 125-152 (2017) - [i10]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. CoRR abs/1704.03596 (2017) - [i9]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. CoRR abs/1707.01182 (2017) - 2016
- [j16]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. Algorithmica 76(4): 1097-1105 (2016) - [r8]Rolf Fagerberg:
Cache-Oblivious B-Tree. Encyclopedia of Algorithms 2016: 261-264 - [r7]Rolf Fagerberg:
Cache-Oblivious Model. Encyclopedia of Algorithms 2016: 264-269 - [r6]Rolf Fagerberg:
String Sorting. Encyclopedia of Algorithms 2016: 2117-2121 - 2015
- [j15]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): 19-53 (2015) - [j14]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): 1626-1649 (2015) - [c39]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Local Routing with Constraints. ISAAC 2015: 23-34 - 2014
- [c38]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CCCG 2014 - [c37]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: 30 - [c36]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. LATIN 2014: 755-764 - [i8]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CoRR abs/1408.4099 (2014) - [i7]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. CoRR abs/1409.6397 (2014) - [i6]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Local Routing with Constraints. CoRR abs/1412.0760 (2014) - 2013
- [j13]Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Thomas Mailund:
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. BMC Bioinform. 14(S-2): S18 (2013) - [j12]Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters, Peter F. Stadler:
On the Complexity of Reconstructing Chemical Reaction Networks. Math. Comput. Sci. 7(3): 275-292 (2013) - [c35]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: 1814-1832 - [i5]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 abs/1307.5829 (2013) - [i4]Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters, Peter F. Stadler:
On the Complexity of Reconstructing Chemical Reaction Networks. CoRR abs/1309.7198 (2013) - 2012
- [c34]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Routing on a Bounded-Degree Plane Spanner. CCCG 2012: 285-290 - [c33]Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters:
Exploring Chemistry Using SMT. CP 2012: 900-915 - [c32]Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman:
De-amortizing Binary Search Trees. ICALP (1) 2012: 121-132 - [c31]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. LATIN 2012: 85-96 - [c30]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive routing in the half-θ6-graph. SODA 2012: 1319-1328 - 2011
- [j11]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): 463-505 (2011) - [i3]Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman:
De-amortizing Binary Search Trees. CoRR abs/1111.1665 (2011) - 2010
- [j10]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): 934-962 (2010) - [c29]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. SWAT 2010: 38-49 - [i2]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. CoRR abs/1003.0139 (2010)
2000 – 2009
- 2009
- [j9]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): 3:1-3:14 (2009) - [c28]Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz:
Online Sorted Range Reporting. ISAAC 2009: 173-182 - 2008
- [j8]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): 37-50 (2008) - [j7]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the adaptiveness of Quicksort. ACM J. Exp. Algorithmics 12: 3.2:1-3.2:20 (2008) - [r5]Rolf Fagerberg:
Cache-Oblivious B-Tree. Encyclopedia of Algorithms 2008 - [r4]Rolf Fagerberg:
Cache-Oblivious Model. Encyclopedia of Algorithms 2008 - [r3]Rolf Fagerberg:
String Sorting. Encyclopedia of Algorithms 2008 - 2007
- [j6]Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther:
Engineering a cache-oblivious sorting algorithm. ACM J. Exp. Algorithmics 12: 2.2:1-2.2:23 (2007) - [c27]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: 91-100 - [c26]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: 101-110 - [c25]Philip Bille, Rolf Fagerberg, Inge Li Gørtz:
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CPM 2007: 52-62 - [c24]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: 347-358 - [c23]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: 61-70 - 2006
- [j5]Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips:
Recrafting the neighbor-joining method. BMC Bioinform. 7: 29 (2006) - [c22]Gerth Stølting Brodal, Rolf Fagerberg:
Cache-oblivious string dictionaries. SODA 2006: 581-590 - [c21]Rolf Fagerberg, Anna Pagh, Rasmus Pagh:
External String Sorting: Faster and Cache-Oblivious. STACS 2006: 68-79 - [i1]Philip Bille, Rolf Fagerberg, Inge Li Gørtz:
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CoRR abs/cs/0609085 (2006) - 2005
- [c20]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the Adaptiveness of Quicksort. ALENEX/ANALCO 2005: 130-140 - [c19]Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen:
Cache-oblivious planar orthogonal range searching and counting. SCG 2005: 160-169 - [c18]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
Cache-Aware and Cache-Oblivious Adaptive Sorting. ICALP 2005: 576-588 - 2004
- [j4]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): 377-395 (2004) - [c17]Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther:
Engineering a Cache-Oblivious Sorting Algorith. ALENEX/ANALC 2004: 4-17 - [c16]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: 480-492 - [r2]Arne Andersson, Rolf Fagerberg, Kim S. Larsen:
Balanced Binary Search Trees. Handbook of Data Structures and Applications 2004 - [r1]Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg:
Cache-Oblivious Data Structures. Handbook of Data Structures and Applications 2004 - 2003
- [c15]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: 271-282 - [c14]Gerth Stølting Brodal, Rolf Fagerberg:
Lower bounds for external memory dictionaries. SODA 2003: 546-554 - [c13]Gerth Stølting Brodal, Rolf Fagerberg:
On the limits of cache-obliviousness. STOC 2003: 307-315 - [c12]Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao:
Computing Refined Buneman Trees in Cubic Time. WABI 2003: 259-270 - 2002
- [c11]Gerth Stølting Brodal, Rolf Fagerberg:
Cache Oblivious Distribution Sweeping. ICALP 2002: 426-438 - [c10]Gerth Stølting Brodal, Rolf Fagerberg:
Funnel Heap - A Cache Oblivious Priority Queue. ISAAC 2002: 219-228 - [c9]Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob:
Cache oblivious search trees via binary trees of small height. SODA 2002: 39-48 - 2001
- [c8]Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin:
The Complexity of Constructing Evolutionary Trees Using Experiments. ICALP 2001: 140-151 - [c7]Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen:
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n). ISAAC 2001: 731-742 - [c6]Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen:
Search Trees with Relaxed Balance and Near-Optimal Height. WADS 2001: 414-425
1990 – 1999
- 1999
- [c5]Rolf Fagerberg:
The Complexity of Rebalancing a Binary Search Tree. FSTTCS 1999: 72-83 - [c4]Gerth Stølting Brodal, Rolf Fagerberg:
Dynamic Representation of Sparse Graphs. WADS 1999: 342-351 - 1997
- [j3]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): 504-521 (1997) - 1996
- [j2]Kim S. Larsen, Rolf Fagerberg:
Efficient Rebalancing of B-Trees with Relaxed Balance. Int. J. Found. Comput. Sci. 7(2): 169-186 (1996) - [j1]Rolf Fagerberg:
A Generalization of Binomial Queues. Inf. Process. Lett. 57(2): 109-114 (1996) - [c3]Rolf Fagerberg:
Binary Search Trees: How Low Can You Go? SWAT 1996: 428-439 - 1995
- [c2]Kim S. Larsen, Rolf Fagerberg:
B-trees with relaxed balance. IPPS 1995: 196-202 - [c1]Joan Boyar, Rolf Fagerberg, Kim S. Larsen:
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
