The Genome Atlas Resource. - Matloob Qureshi; Eva Rotenberg; Hans Henrik Stærfeldt; Lena Hansson; David Wayne Ussery (CSBio, 2010)

Strength of the Reversible, Garbage-Free 2 k ±1 Multiplier. - Eva Rotenberg; James Cranch; Michael Kirkedal Thomsen; Holger Bock Axelsen (RC, 2013)

Designing Garbage-Free Reversible Implementations of the Integer Cosine Transform. - Alexis De Vos; Stéphane Burignat; Robert Glück; Torben Ægidius Mogensen; Holger Bock Axelsen; Michael Kirkedal Thomsen; Eva Rotenberg; Tetsuo Yokoyama (ACM J. Emerg. Technol. Comput. Syst., 2014)

Faster Fully-Dynamic Minimum Spanning Forest. - Jacob Holm; Eva Rotenberg; Christian Wulff-Nilsen (ESA, 2015)

Hashing for Statistics over K-Partitions. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Eva Rotenberg; Mikkel Thorup (FOCS, 2015)

Planar Reachability in Linear Space and Constant Time. - Jacob Holm; Eva Rotenberg; Mikkel Thorup (FOCS, 2015)

The Power of Two Choices with Simple Tabulation. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Eva Rotenberg; Mikkel Thorup (SODA, 2016)

Graph Reconstruction with a Betweenness Oracle. - Mikkel Abrahamsen; Greg Bodwin; Eva Rotenberg; Morten Stöckel (STACS, 2016)

Best Laid Plans of Lions and Men. - Mikkel Abrahamsen; Jacob Holm; Eva Rotenberg; Christian Wulff-Nilsen (SoCG, 2017)

Contracting a Planar Graph Efficiently. - Jacob Holm; Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Eva Rotenberg; Piotr Sankowski (ESA, 2017)

Online bipartite matching with amortized $O( log^2 n)$ replacements. - Aaron Bernstein; Jacob Holm; Eva Rotenberg (CoRR, 2017)

Dynamic Bridge-Finding in $ tilde{O}( log ^2 n)$ Amortized Time. - Jacob Holm; Eva Rotenberg; Mikkel Thorup (CoRR, 2017)

Dynamic Planar Embeddings of Dynamic Graphs. - Jacob Holm; Eva Rotenberg (Theory Comput. Syst., 2017)

Decremental SPQR-trees for Planar Graphs. - Jacob Holm; Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Eva Rotenberg (ESA, 2018)

String Attractors: Verification and Optimization. - Dominik Kempa; Alberto Policriti; Nicola Prezza; Eva Rotenberg (ESA, 2018)

One-Way Trail Orientations. - Anders Aamand; Niklas Hjuler; Jacob Holm; Eva Rotenberg (ICALP, 2018)

A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. - Stephen Alstrup; Agelos Georgakopoulos; Eva Rotenberg; Carsten Thomassen (SODA, 2018)

Online Bipartite Matching with Amortized Replacements. - Aaron Bernstein; Jacob Holm; Eva Rotenberg (SODA, 2018)

The Bane of Low-Dimensionality Clustering. - Vincent Cohen-Addad; Arnaud de Mesmay; Eva Rotenberg; Alan Roytman (SODA, 2018)

Dynamic Bridge-Finding in Õ(log2 n) Amortized Time. - Jacob Holm; Eva Rotenberg; Mikkel Thorup (SODA, 2018)

Compressed Communication Complexity of Longest Common Prefixes. - Philip Bille; Mikko Berggren Ettienne; Roberto Grossi; Inge Li Gørtz; Eva Rotenberg (SPIRE, 2018)

Fast fencing. - Mikkel Abrahamsen; Anna Adamaszek; Karl Bringmann; Vincent Cohen-Addad; Mehran Mehr; Eva Rotenberg; Alan Roytman; Mikkel Thorup (STOC, 2018)

Good r-divisions Imply Optimal Amortised Decremental Biconnectivity. - Jacob Holm; Eva Rotenberg (CoRR, 2018)

Online Bipartite Matching with Amortized O(log 2 n) Replacements. - Aaron Bernstein; Jacob Holm; Eva Rotenberg (J. ACM, 2019)

String Indexing for Top-k Close Consecutive Occurrences. - Philip Bille; Inge Li Gørtz; Max Rishøj Pedersen; Eva Rotenberg; Teresa Anna Steiner (FSTTCS, 2020)

Space Efficient Construction of Lyndon Arrays in Linear Time. - Philip Bille; Jonas Ellert; Johannes Fischer 001; Inge Li Gørtz; Florian Kurpicz; J. Ian Munro; Eva Rotenberg (ICALP, 2020)

Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity. - Jacob Holm; Eva Rotenberg (SODA, 2020)

Fully-dynamic planarity testing in polylogarithmic time. - Jacob Holm; Eva Rotenberg (STOC, 2020)

Escaping an Infinitude of Lions. - Mikkel Abrahamsen; Jacob Holm; Eva Rotenberg; Christian Wulff-Nilsen (Am. Math. Mon., 2020)

On Dynamic Graphs (Invited Talk). - Eva Rotenberg (MFCS, 2021)

Skeletonization via Local Separators. - Andreas Bærentzen; Eva Rotenberg (ACM Trans. Graph., 2021)

Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring. - Aleksander B. G. Christiansen; Eva Rotenberg (ICALP, 2022)

On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. - Aleksander B. G. Christiansen; Jacob Holm; Eva Rotenberg; Carsten Thomassen (MFCS, 2022)

Fully-dynamic α+2 Arboricity Decomposition and Implicit Colouring. - Aleksander B. G. Christiansen; Eva Rotenberg (CoRR, 2022)

Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity. - Jacob Holm; Ivor van der Hoog; Eva Rotenberg (CoRR, 2022)

Adaptive Out-Orientations with Applications. - Aleksander B. G. Christiansen; Jacob Holm; Ivor van der Hoog; Eva Rotenberg; Chris Schwiegelshohn (CoRR, 2022)

Approximate Discrete Fréchet distance: simplified, extended and structured. - Ivor van der Hoog; Eva Rotenberg; Sampson Wong (CoRR, 2022)

On the discrete Fréchet distance in a graph. - Anne Driemel; Ivor van der Hoog; Eva Rotenberg (J. Comput. Geom., 2022)

String indexing for top-k close consecutive occurrences. - Philip Bille; Inge Li Gørtz; Max Rishøj Pedersen; Eva Rotenberg; Teresa Anna Steiner (Theor. Comput. Sci., 2022)

Multilevel Skeletonization Using Local Separators. - J. Andreas Bærentzen; Rasmus Emil Christensen; Emil Toftegaard Gæde; Eva Rotenberg (SoCG, 2023)

Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. - Jacob Holm; Ivor van der Hoog; Eva Rotenberg (SoCG, 2023)

Splay Top Trees. - Jacob Holm; Eva Rotenberg; Alice Ryhl (SOSA, 2023)

Amortised Analysis of Dynamic Data Structures (Invited Talk). - Eva Rotenberg (STACS, 2023)

Improved Dynamic Colouring of Sparse Graphs. - Aleksander Bjørn Grodt Christiansen; Krzysztof Nowicki 002; Eva Rotenberg (STOC, 2023)

Triangulations Admit Dominating Sets of Size 2n/7. - Aleksander B. G. Christiansen; Eva Rotenberg; Daniel Rutschmann (CoRR, 2023)

Simple and Robust Dynamic Two-Dimensional Convex Hull. - Emil Toftegaard Gæde; Inge Li Gørtz; Ivor van der Hoog; Christoffer Krogh; Eva Rotenberg (ALENEX, 2024)

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. - Ivor van der Hoog; Irene Parada; Eva Rotenberg (ESA, 2024)

Simple (Invited Talk). - Eva Rotenberg (ESA, 2024)

Data Structures for Approximate Fréchet Distance for Realistic Curves. - Ivor van der Hoog; Eva Rotenberg; Sampson Wong (ISAAC, 2024)

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. - Ivor van der Hoog; André Nusser; Eva Rotenberg; Frank Staals (MFCS, 2024)

Brief Announcement: Local Advice and Local Decompression. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Krzysztof Nowicki 002; Dennis Olivetti; Eva Rotenberg; Jukka Suomela (PODC, 2024)

Dynamic Dynamic Time Warping. - Karl Bringmann; Nick Fischer; Ivor van der Hoog; Evangelos Kipouridis; Tomasz Kociumaka; Eva Rotenberg (SODA, 2024)

Adaptive Out-Orientations with Applications. - Chandra Chekuri; Aleksander Bjørn Grodt Christiansen; Jacob Holm; Ivor van der Hoog; Kent Quanrud; Eva Rotenberg; Chris Schwiegelshohn (SODA, 2024)

Triangulations Admit Dominating Sets of Size 2n/7. - Aleksander B. G. Christiansen; Eva Rotenberg; Daniel Rutschmann (SODA, 2024)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time. - Philip Bille; Inge Li Gørtz; Moshe Lewenstein; Solon P. Pissis; Eva Rotenberg; Teresa Anna Steiner (STACS, 2024)

Sparsity-Parameterised Dynamic Edge Colouring. - Aleksander B. G. Christiansen; Eva Rotenberg; Juliette Vlieghe (SWAT, 2024)

Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. - Aleksander Bjørn Grodt Christiansen; Linda Kleist; Irene Parada; Eva Rotenberg (WG, 2024)

Private graph colouring with limited defectiveness. - Aleksander B. G. Christiansen; Eva Rotenberg; Teresa Anna Steiner; Juliette Vlieghe (CoRR, 2024)

Local Advice and Local Decompression. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Krzysztof Nowicki 002; Dennis Olivetti; Eva Rotenberg; Jukka Suomela (CoRR, 2024)

Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471). - Keren Censor-Hillel; Yasamin Nazari; Eva Rotenberg; Thatchaphol Saranurak; Martín Costa (Dagstuhl Reports, 2024)

Good r-divisions Imply Optimal Amortized Decremental Biconnectivity. - Jacob Holm; Eva Rotenberg (Theory Comput. Syst., 2024)

Surface Reconstruction Using Rotation Systems. - Ruiqi Cui; Emil Toftegaard Gæde; Eva Rotenberg; Leif Kobbelt; J. Andreas Bærentzen (ACM Trans. Graph., 2024)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation. - Karl Bringmann; Kasper Green Larsen; André Nusser; Eva Rotenberg; Yanheng Wang (SoCG, 2025)

Efficient Greedy Discrete Subtrajectory Clustering. - Ivor van der Hoog; Lara Ost; Eva Rotenberg; Daniel Rutschmann (SoCG, 2025)

Simpler Optimal Sorting from a Directed Acyclic Graph. - Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann (SOSA, 2025)

Local Density and Its Distributed Approximation. - Aleksander Bjørn Grodt Christiansen; Ivor van der Hoog; Eva Rotenberg (STACS, 2025)

Fully Dynamic Biconnectivity in Õ(log² n) Time. - Jacob Holm; Wojciech Nadara; Eva Rotenberg; Marek Sokolowski 001 (STOC, 2025)

Edge-Connectivity Augmentation of Simple Graphs. - Kasper Skov Johansen; Eva Rotenberg; Carsten Thomassen (SIAM J. Discret. Math., 2025)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees. - Emil Toftegaard Gæde; Ivor van der Hoog; Eva Rotenberg; Tord Stordalen (CoRR, 2025)

Instance-Optimal Imprecise Convex Hull. - Sarita de Berg; Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann; Sampson Wong (CoRR, 2025)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation. - Ernestine Großmann; Ivor van der Hoog; Henrik Reinstädtler; Eva Rotenberg; Christian Schulz 003; Juliette Vlieghe (CoRR, 2025)

Simple Universally Optimal Dijkstra. - Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann (CoRR, 2025)

Fréchet Distance in Unweighted Planar Graphs. - Ivor van der Hoog; Thijs van der Horst; Eva Rotenberg; Lasse Wulf (CoRR, 2025)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull. - Ivor van der Hoog; Eva Rotenberg; Daniel Rutschmann (CoRR, 2025)