Rolf Fagerberg

J. Comput. Biol., 2024

Automated Inference of Graph Transformation Rules.

[BibT_eX]

[DOI]

CoRR, 2024

On Finding Longest Palindromic Subsequences Using Longest Common Subsequences.

[BibT_eX]

[DOI]

Casper Moldrup Rysgaard

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Reconciling Inconsistent Molecular Structures from Biochemical Databases.

[BibT_eX]

[DOI]

Casper Asbjørn Eriksen

Jakob Lykke Andersen

Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

On the Realisability of Chemical Pathways.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

2022

Fragile complexity of adaptive algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Representing Catalytic Mechanisms with Rule Composition.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., 2022

Characterizing Catalytic Mechanisms with Overlay Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient Modular Graph Transformation Rule Application.

[BibT_eX]

[DOI]

Jakob L. Andersen

Juraj Kolcák

CoRR, 2022

2021

Graph transformation for enzymatic mechanisms.

[BibT_eX]

[DOI]

Bioinform., 2021

An Experimental Study of External Memory Algorithms for Connected Components.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2019

Handling preferences in student-project allocation.

[BibT_eX]

[DOI]

Marco Chiarandini

Stefano Gualandi

Ann. Oper. Res., 2019

On Plane Constrained Bounded-Degree Spanners.

[BibT_eX]

[DOI]

Algorithmica, 2019

On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?

[BibT_eX]

[DOI]

David Hammer

Ulrich Meyer

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Fragile Complexity of Comparison-Based Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Finding the K best synthesis plans.

[BibT_eX]

[DOI]

J. Cheminformatics, 2018

Continuous Yao graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Competitive local routing with constraints.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

2016

String Sorting.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Cache-Oblivious Model.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Cache-Oblivious B-Tree.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Biased Predecessor Search.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

New and improved spanning ratios for Yao graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

2014

Continuous Yao Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

On the Complexity of Reconstructing Chemical Reaction Networks.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2013

New and Improved Spanning Ratios for Yao Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.

[BibT_eX]

[DOI]

Andreas Sand

BMC Bioinform., 2013

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.

[BibT_eX]

[DOI]

Andreas Sand

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Competitive routing in the half-θ6-graph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

De-amortizing Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Exploring Chemistry Using SMT.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

Competitive Routing on a Bounded-Degree Plane Spanner.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

The Cost of Cache-Oblivious Searching.

[BibT_eX]

[DOI]

Michael A. Bender

Alejandro López-Ortiz

Algorithmica, 2011

2010

Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.

[BibT_eX]

[DOI]

Michael A. Bender

Riko Jacob

Elias Vicari

Theory Comput. Syst., 2010

An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

[BibT_eX]

[DOI]

CoRR, 2010

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

2009

Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts.

[BibT_eX]

[DOI]

Philip Bille

Inge Li Gørtz

ACM Trans. Algorithms, 2009

Online Sorted Range Reporting.

[BibT_eX]

[DOI]

Mark Greve

Alejandro López-Ortiz

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

String Sorting.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Cache-Oblivious Model.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Cache-Oblivious B-Tree.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the adaptiveness of Quicksort.

[BibT_eX]

[DOI]

Gabriel Moruz

ACM J. Exp. Algorithmics, 2008

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.

[BibT_eX]

[DOI]

Martin Stig Stissing

J. Bioinform. Comput. Biol., 2008

2007

Engineering a cache-oblivious sorting algorithm.

[BibT_eX]

[DOI]

Kristoffer Vinther

ACM J. Exp. Algorithmics, 2007

Optimal Resilient Dynamic Dictionaries.

[BibT_eX]

[DOI]

Allan Grønlund Jørgensen

Gabriel Moruz

Thomas Mølhave

Proceedings of the Algorithms, 2007

Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.

[BibT_eX]

[DOI]

Martin Stig Stissing

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006

Recrafting the neighbor-joining method.

[BibT_eX]

[DOI]

Derek Phillips

BMC Bioinform., 2006

External String Sorting: Faster and Cache-Oblivious.

[BibT_eX]

[DOI]

Anna Pagh

Rasmus Pagh

Proceedings of the STACS 2006, 2006

Cache-oblivious string dictionaries.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Cache-Aware and Cache-Oblivious Adaptive Sorting.

[BibT_eX]

[DOI]

Gabriel Moruz

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cache-oblivious planar orthogonal range searching and counting.

[BibT_eX]

[DOI]

Lars Arge

Morten Laustsen

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Cache-Oblivious Data Structures.

[BibT_eX]

[DOI]

Lars Arge

Proceedings of the Handbook of Data Structures and Applications., 2004

Balanced Binary Search Trees.

[BibT_eX]

[DOI]

Arne Andersson

Proceedings of the Handbook of Data Structures and Applications., 2004

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).

[BibT_eX]

[DOI]

Algorithmica, 2004

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.

[BibT_eX]

[DOI]

Ulrich Meyer

Norbert Zeh

Proceedings of the Algorithm Theory, 2004

Engineering a Cache-Oblivious Sorting Algorith.

[BibT_eX]

Kristoffer Vinther

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Computing Refined Buneman Trees in Cubic Time.

[BibT_eX]

[DOI]

Anna Östlin

S. Srinivasa Rao

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

On the limits of cache-obliviousness.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Lower bounds for external memory dictionaries.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Cache oblivious search trees via binary trees of small height.

[BibT_eX]

[DOI]

Riko Jacob

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Funnel Heap - A Cache Oblivious Priority Queue.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Cache Oblivious Distribution Sweeping.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Search Trees with Relaxed Balance and Near-Optimal Height.

[BibT_eX]

[DOI]

Rune E. Jensen

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

The Complexity of Constructing Evolutionary Trees Using Experiments.

[BibT_eX]

[DOI]

Anna Östlin

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

1999

Dynamic Representation of Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

The Complexity of Rebalancing a Binary Search Tree.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1997

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.

[BibT_eX]

[DOI]

Joan Boyar

J. Comput. Syst. Sci., 1997

1996

A Generalization of Binomial Queues.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Efficient Rebalancing of B-Trees with Relaxed Balance.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1996

Binary Search Trees: How Low Can You Go?

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

1995

B-trees with relaxed balance.

[BibT_eX]

[DOI]