Eva Rotenberg

According to our database, Eva Rotenberg authored at least 54 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Surface Reconstruction Using Rotation Systems.

Ruiqi Cui, Emil Toftegaard Gæde, Eva Rotenberg, Leif Kobbelt, Jakob Andreas Bærentzen

CoRR, 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

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Triangulations Admit Dominating Sets of Size 2<i>n</i>/7.

Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Dynamic Dynamic Time Warping.

Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Sparsity-Parameterised Dynamic Edge Colouring.

Aleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe

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

CoRR, 2023

Triangulations Admit Dominating Sets of Size 2n/7.

Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann

CoRR, 2023

Improved Dynamic Colouring of Sparse Graphs.

Aleksander Bjørn Grodt Christiansen, Krzysztof Nowicki, Eva Rotenberg

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Amortised Analysis of Dynamic Data Structures (Invited Talk).

Eva Rotenberg

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Splay Top Trees.

Jacob Holm, Eva Rotenberg, Alice Ryhl

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings.

Jacob Holm, Ivor van der Hoog, Eva Rotenberg

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Multilevel Skeletonization Using Local Separators.

J. Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, Eva Rotenberg

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

String indexing for top-<i>k</i> close consecutive occurrences.

Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner

Theor. Comput. Sci., 2022

Approximate Discrete Fréchet distance: simplified, extended and structured.

Ivor van der Hoog, Eva Rotenberg, Sampson Wong

CoRR, 2022

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs.

Ivor van der Hoog, Irene Parada, 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

Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity.

Jacob Holm, Ivor van der Hoog, Eva Rotenberg

CoRR, 2022

Fully-dynamic α+2 Arboricity Decomposition and Implicit Colouring.

Aleksander B. G. Christiansen, Eva Rotenberg

CoRR, 2022

On Dynamic α + 1 Arboricity Decomposition and Out-Orientation.

Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring.

Aleksander B. G. Christiansen, Eva Rotenberg

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

On the Discrete Fréchet Distance in a Graph.

Anne Driemel, Ivor van der Hoog, Eva Rotenberg

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Skeletonization via Local Separators.

Andreas Bærentzen, Eva Rotenberg

ACM Trans. Graph., 2021

Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity.

Jacob Holm, Eva Rotenberg

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

On Dynamic Graphs (Invited Talk).

Eva Rotenberg

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Escaping an Infinitude of Lions.

Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen

Am. Math. Mon., 2020

Fully-dynamic planarity testing in polylogarithmic time.

Jacob Holm, Eva Rotenberg

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity.

Jacob Holm, Eva Rotenberg

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Space Efficient Construction of Lyndon Arrays in Linear Time.

Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

String Indexing for Top-k Close Consecutive Occurrences.

Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Online Bipartite Matching with Amortized <i>O</i>(log ² <i>n</i>) Replacements.

Aaron Bernstein, Jacob Holm, Eva Rotenberg

J. ACM, 2019

2018

Good r-divisions Imply Optimal Amortised Decremental Biconnectivity.

Jacob Holm, Eva Rotenberg

CoRR, 2018

Fast fencing.

Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Compressed Communication Complexity of Longest Common Prefixes.

Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg

Proceedings of the String Processing and Information Retrieval, 2018

Dynamic Bridge-Finding in <i>Õ</i>(log² <i>n</i>) Amortized Time.

Jacob Holm, Eva Rotenberg, Mikkel Thorup

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

The Bane of Low-Dimensionality Clustering.

Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Online Bipartite Matching with Amortized Replacements.

Aaron Bernstein, Jacob Holm, Eva Rotenberg

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time.

Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

One-Way Trail Orientations.

Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

String Attractors: Verification and Optimization.

Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Decremental SPQR-trees for Planar Graphs.

Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Dynamic Planar Embeddings of Dynamic Graphs.

Jacob Holm, Eva Rotenberg

Theory Comput. Syst., 2017

Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time.

Jacob Holm, Eva Rotenberg, Mikkel Thorup

CoRR, 2017

Online bipartite matching with amortized $O(\log^2 n)$ replacements.

Aaron Bernstein, Jacob Holm, Eva Rotenberg

CoRR, 2017

Contracting a Planar Graph Efficiently.

Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Best Laid Plans of Lions and Men.

Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Graph Reconstruction with a Betweenness Oracle.

Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

The Power of Two Choices with Simple Tabulation.

Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Planar Reachability in Linear Space and Constant Time.

Jacob Holm, Eva Rotenberg, Mikkel Thorup

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Hashing for Statistics over K-Partitions.

Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Faster Fully-Dynamic Minimum Spanning Forest.

Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen

Proceedings of the Algorithms - ESA 2015, 2015

2014

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

2013

Strength of the Reversible, Garbage-Free 2 k ±1 Multiplier.

Eva Rotenberg, James Cranch, Michael Kirkedal Thomsen, Holger Bock Axelsen

Proceedings of the Reversible Computation - 5th International Conference, 2013

2010

The Genome Atlas Resource.

Matloob Qureshi, Eva Rotenberg, Hans-Henrik Stærfeldt, Lena Hansson, David Wayne Ussery

Proceedings of the Computational Systems-Biology and Bioinformatics, 2010