default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEva Rotenberg
Person information
- affiliation: IT University of Copenhagen, Denmark
- affiliation (former): Technical University of Denmark, Lyngby, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j10]Kasper Skov Johansen
, Eva Rotenberg, Carsten Thomassen:
Edge-Connectivity Augmentation of Simple Graphs. SIAM J. Discret. Math. 39(1): 163-169 (2025)- [c57]Karl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, Yanheng Wang:
Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation. SoCG 2025: 25:1-25:16 - [c56]Ivor van der Hoog, Lara Ost, Eva Rotenberg, Daniel Rutschmann:
Efficient Greedy Discrete Subtrajectory Clustering. SoCG 2025: 78:1-78:20 - [c55]Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf:
Fréchet Distance in Unweighted Planar Graphs. ESA 2025: 24:1-24:16 - [c54]Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong:
Instance-Optimal Imprecise Convex Hull. ESA 2025: 25:1-25:15 - [c53]Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen:
A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees. ESA 2025: 64:1-64:18 - [c52]Ernestine Großmann, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz, Ivor van der Hoog, Juliette Vlieghe:
From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation. ESA 2025: 65:1-65:18 - [c51]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
Simpler Universally Optimal Dijkstra. ESA 2025: 71:1-71:9 - [c50]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull. ESA 2025: 102:1-102:13 - [c49]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
Simpler Optimal Sorting from a Directed Acyclic Graph. SOSA 2025: 350-355 - [c48]Aleksander Bjørn Grodt Christiansen, Ivor van der Hoog, Eva Rotenberg:
Local Density and Its Distributed Approximation. STACS 2025: 25:1-25:20 - [c47]Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokolowski:
Fully Dynamic Biconnectivity in Õ(log² n) Time. STOC 2025: 156-165 - [c46]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela:
Distributed Computation with Local Advice. DISC 2025: 12:1-12:19 - [d4]Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen:
A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees. DROPS Artifacts, 2025
- [d3]Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen:
Testbed for our learned index repository. DROPS Artifacts, 2025 - [d2]Ernestine Großmann, Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz, Juliette Vlieghe:
Dense Dataset from the paper "From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation". Zenodo, 2025 - [d1]Ernestine Großmann, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz, Ivor van der Hoog, Juliette Vlieghe:
Implementation of our dynamic algorithm for minimum orientation. DROPS Artifacts, 2025 - [i62]Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg:
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. CoRR abs/2502.10066 (2025) - [i61]Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen:
Dynamic Indexing Through Learned Indices with Worst-case Guarantees. CoRR abs/2503.05007 (2025) - [i60]Ivor van der Hoog, Lara Ost, Eva Rotenberg, Daniel Rutschmann:
Efficient Greedy Discrete Subtrajectory Clustering. CoRR abs/2503.14115 (2025) - [i59]Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokolowski:
Fully dynamic biconnectivity in Õ(log² n) time. CoRR abs/2503.21733 (2025) - [i58]Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, Sampson Wong:
Instance-Optimal Imprecise Convex Hull. CoRR abs/2504.02611 (2025) - [i57]Ernestine Großmann, Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz, Juliette Vlieghe:
From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation. CoRR abs/2504.16720 (2025) - [i56]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
Simple Universally Optimal Dijkstra. CoRR abs/2504.17327 (2025) - [i55]Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf:
Fréchet Distance in Unweighted Planar Graphs. CoRR abs/2504.17342 (2025) - [i54]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull. CoRR abs/2505.01194 (2025) - [i53]Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg:
Practical Insertion-Only Convex Hull. CoRR abs/2508.17496 (2025) - [i52]Sarita de Berg, Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg:
Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve. CoRR abs/2508.19891 (2025) - [i51]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection. CoRR abs/2511.02954 (2025) - [i50]Sarita de Berg, Jacobus Conradi, Ivor van der Hoog, Eva Rotenberg:
The Contiguous Art Gallery Problem is in Θ(n log n). CoRR abs/2511.02960 (2025) - [i49]Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf:
The Complexity of Stackelberg Pricing Games. CoRR abs/2511.05700 (2025) - [i48]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull. CoRR abs/2512.06559 (2025) - [i47]Jacobus Conradi, Ivor van der Hoog, Eva Rotenberg:
On computing the (exact) Fréchet distance with a frog. CoRR abs/2512.07728 (2025) - [i46]Michael A. Bender, John Iacono, László Kozma, Eva Rotenberg, Justin Dallant:
Adaptive and Scalable Data Structures (Dagstuhl Seminar 25191). Dagstuhl Reports 15(5): 1-20 (2025) - 2024
- [j9]Jacob Holm, Eva Rotenberg:
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity. Theory Comput. Syst. 68(4): 1014-1048 (2024) - [j8]Ruiqi Cui, Emil Toftegaard Gæde, Eva Rotenberg, Leif Kobbelt, J. Andreas Bærentzen:
Surface Reconstruction Using Rotation Systems. ACM Trans. Graph. 43(6): 190:1-190:22 (2024) - [c45]Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg:
Simple and Robust Dynamic Two-Dimensional Convex Hull. ALENEX 2024: 144-156 - [c44]Eva Rotenberg:
Simple (Invited Talk). ESA 2024: 2:1-2:2 - [c43]Ivor van der Hoog, Irene Parada, Eva Rotenberg:
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. ESA 2024: 70:1-70:18 - [c42]Ivor van der Hoog, Eva Rotenberg, Sampson Wong:
Data Structures for Approximate Fréchet Distance for Realistic Curves. ISAAC 2024: 56:1-56:18 - [c41]Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals:
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. MFCS 2024: 63:1-63:17 - [c40]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela:
Brief Announcement: Local Advice and Local Decompression. PODC 2024: 117-120 - [c39]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. SODA 2024: 208-242 - [c38]Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann:
Triangulations Admit Dominating Sets of Size 2n/7. SODA 2024: 1194-1240 - [c37]Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. SODA 2024: 3062-3088 - [c36]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. STACS 2024: 16:1-16:21 - [c35]Aleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe:
Sparsity-Parameterised Dynamic Edge Colouring. SWAT 2024: 20:1-20:18 - [c34]Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg:
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. WG 2024: 121-135 - [i45]Ruiqi Cui, Emil Toftegaard Gæde, Eva Rotenberg, Leif Kobbelt, Jakob Andreas Bærentzen:
Surface Reconstruction Using Rotation Systems. CoRR abs/2402.01893 (2024) - [i44]Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe:
Private graph colouring with limited defectiveness. CoRR abs/2404.18692 (2024) - [i43]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela:
Local Advice and Local Decompression. CoRR abs/2405.04519 (2024) - [i42]Ivor van der Hoog, André Nusser, Eva Rotenberg, Frank Staals:
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs. CoRR abs/2406.20065 (2024) - [i41]Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
Simpler Optimal Sorting from a Directed Acyclic Graph. CoRR abs/2407.21591 (2024) - [i40]Karl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, Yanheng Wang:
Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation. CoRR abs/2410.00996 (2024) - [i39]Aleksander Bjørn Grodt Christiansen, Ivor van der Hoog, Eva Rotenberg:
Local Density and its Distributed Approximation. CoRR abs/2411.12694 (2024) - [i38]Keren Censor-Hillel, Yasamin Nazari, Eva Rotenberg, Thatchaphol Saranurak, Martín Costa:
Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471). Dagstuhl Reports 14(11): 92-107 (2024) - 2023
- [c33]J. Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, Eva Rotenberg:
Multilevel Skeletonization Using Local Separators. SoCG 2023: 13:1-13:18 - [c32]Jacob Holm, Ivor van der Hoog, Eva Rotenberg:
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. SoCG 2023: 40:1-40:18 - [c31]Jacob Holm, Eva Rotenberg, Alice Ryhl:
Splay Top Trees. SOSA 2023: 305-331 - [c30]Eva Rotenberg:
Amortised Analysis of Dynamic Data Structures (Invited Talk). STACS 2023: 2:1-2:2 - [c29]Aleksander Bjørn Grodt Christiansen, Krzysztof Nowicki, Eva Rotenberg:
Improved Dynamic Colouring of Sparse Graphs. STOC 2023: 1201-1214 - [i37]Jakob Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, Eva Rotenberg:
Multilevel Skeletonization Using Local Separators. CoRR abs/2303.07210 (2023) - [i36]Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann:
Triangulations Admit Dominating Sets of Size 2n/7. CoRR abs/2310.11254 (2023) - [i35]Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg:
Simple and Robust Dynamic Two-Dimensional Convex Hull. CoRR abs/2310.18068 (2023) - [i34]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. CoRR abs/2310.18128 (2023) - [i33]Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. CoRR abs/2310.18146 (2023) - [i32]Aleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe:
Sparsity-Parameterised Dynamic Edge Colouring. CoRR abs/2311.10616 (2023) - 2022
- [j7]Anne Driemel, Ivor van der Hoog, Eva Rotenberg:
On the discrete Fréchet distance in a graph. J. Comput. Geom. 14(2): 197-223 (2022) - [j6]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String indexing for top-k close consecutive occurrences. Theor. Comput. Sci. 927: 133-147 (2022) - [c28]Anne Driemel, Ivor van der Hoog, Eva Rotenberg:
On the Discrete Fréchet Distance in a Graph. SoCG 2022: 36:1-36:18 - [c27]Aleksander B. G. Christiansen, Eva Rotenberg:
Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring. ICALP 2022: 42:1-42:20 - [c26]Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen:
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. MFCS 2022: 34:1-34:15 - [e1]Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman:
30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, September 5-9, 2022. LIPIcs 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-247-1 [contents] - [i31]Anne Driemel, Ivor van der Hoog, Eva Rotenberg:
On the Discrete Fréchet Distance in a Graph. CoRR abs/2201.02121 (2022) - [i30]Aleksander B. G. Christiansen, Eva Rotenberg:
Fully-dynamic α+2 Arboricity Decomposition and Implicit Colouring. CoRR abs/2203.06039 (2022) - [i29]Jacob Holm, Ivor van der Hoog, Eva Rotenberg:
Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity. CoRR abs/2209.14079 (2022) - [i28]Aleksander B. G. Christiansen, Jacob Holm, Ivor van der Hoog, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. CoRR abs/2209.14087 (2022) - [i27]Ivor van der Hoog, Irene Parada, Eva Rotenberg:
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. CoRR abs/2209.14094 (2022) - [i26]Jacob Holm, Eva Rotenberg, Alice Ryhl:
Splay Top Trees. CoRR abs/2210.11918 (2022) - [i25]Aleksander B. G. Christiansen, Krzysztof D. Nowicki, Eva Rotenberg:
Improved Dynamic Colouring of Sparse Graphs. CoRR abs/2211.06858 (2022) - [i24]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. CoRR abs/2211.16860 (2022) - [i23]Ivor van der Hoog, Eva Rotenberg, Sampson Wong:
Approximate Discrete Fréchet distance: simplified, extended and structured. CoRR abs/2212.07124 (2022) - 2021
- [j5]Andreas Bærentzen, Eva Rotenberg:
Skeletonization via Local Separators. ACM Trans. Graph. 40(5): 187:1-187:18 (2021) - [c25]Eva Rotenberg:
On Dynamic Graphs (Invited Talk). MFCS 2021: 4:1-4:1 - [c24]Jacob Holm, Eva Rotenberg:
Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. STACS 2021: 42:1-42:18 - 2020
- [j4]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Escaping an Infinitude of Lions. Am. Math. Mon. 127(10): 880-896 (2020) - [c23]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. FSTTCS 2020: 14:1-14:17 - [c22]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP 2020: 14:1-14:18 - [c21]Jacob Holm, Eva Rotenberg:
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity. SODA 2020: 2378-2397 - [c20]Jacob Holm, Eva Rotenberg:
Fully-dynamic planarity testing in polylogarithmic time. STOC 2020: 167-180 - [i22]Andreas Bærentzen, Eva Rotenberg:
Skeletonization via Local Separators. CoRR abs/2007.03483 (2020) - [i21]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. CoRR abs/2007.04128 (2020) - [i20]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Escaping an Infinitude of Lions. CoRR abs/2012.11181 (2020)
2010 – 2019
- 2019
- [j3]Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online Bipartite Matching with Amortized O(log 2 n) Replacements. J. ACM 66(5): 37:1-37:23 (2019) - [i19]Jacob Holm, Eva Rotenberg:
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity. CoRR abs/1910.09005 (2019) - [i18]Jacob Holm, Eva Rotenberg:
Fully-dynamic Planarity Testing in Polylogarithmic Time. CoRR abs/1911.03449 (2019) - [i17]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR abs/1911.03542 (2019) - 2018
- [c19]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. ESA 2018: 46:1-46:16 - [c18]Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. ESA 2018: 52:1-52:13 - [c17]Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg:
One-Way Trail Orientations. ICALP 2018: 6:1-6:13 - [c16]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Dynamic Bridge-Finding in Õ(log2 n) Amortized Time. SODA 2018: 35-52 - [c15]Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman:
The Bane of Low-Dimensionality Clustering. SODA 2018: 441-456 - [c14]Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online Bipartite Matching with Amortized Replacements. SODA 2018: 947-959 - [c13]Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen:
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. SODA 2018: 1645-1649 - [c12]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. SPIRE 2018: 74-87 - [c11]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast fencing. STOC 2018: 564-573 - [i16]Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. CoRR abs/1803.01695 (2018) - [i15]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast Fencing. CoRR abs/1804.00101 (2018) - [i14]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. CoRR abs/1806.03102 (2018) - [i13]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. CoRR abs/1806.10772 (2018) - [i12]Jacob Holm, Eva Rotenberg:
Good r-divisions Imply Optimal Amortised Decremental Biconnectivity. CoRR abs/1808.02568 (2018) - 2017
- [j2]Jacob Holm, Eva Rotenberg:
Dynamic Planar Embeddings of Dynamic Graphs. Theory Comput. Syst. 61(4): 1054-1083 (2017) - [c10]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. SoCG 2017: 6:1-6:16 - [c9]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. ESA 2017: 50:1-50:15 - [i11]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. CoRR abs/1703.03687 (2017) - [i10]Jacob Holm, Eva Rotenberg:
Dynamic Planar Embeddings of Dynamic Graphs. CoRR abs/1704.00565 (2017) - [i9]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. CoRR abs/1706.10228 (2017) - [i8]Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online bipartite matching with amortized $O(\log^2 n)$ replacements. CoRR abs/1707.06063 (2017) - [i7]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time. CoRR abs/1707.06311 (2017) - [i6]Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg:
One-Way Trail Orientations. CoRR abs/1708.07389 (2017) - [i5]Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman:
The Bane of Low-Dimensionality Clustering. CoRR abs/1711.01171 (2017) - 2016
- [c8]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
The Power of Two Choices with Simple Tabulation. SODA 2016: 1631-1642 - [c7]Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel:
Graph Reconstruction with a Betweenness Oracle. STACS 2016: 5:1-5:14 - 2015
- [c6]Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Faster Fully-Dynamic Minimum Spanning Forest. ESA 2015: 742-753 - [c5]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Planar Reachability in Linear Space and Constant Time. FOCS 2015: 370-389 - [c4]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
Hashing for Statistics over K-Partitions. FOCS 2015: 1292-1310 - [c3]Jacob Holm, Eva Rotenberg:
Dynamic Planar Embeddings of Dynamic Graphs. STACS 2015: 434-446 - 2014
- [j1]Alexis De Vos, Stéphane Burignat, Robert Glück, Torben Ægidius Mogensen, Holger Bock Axelsen, Michael Kirkedal Thomsen, Eva Rotenberg, Tetsuo Yokoyama:
Designing Garbage-Free Reversible Implementations of the Integer Cosine Transform. ACM J. Emerg. Technol. Comput. Syst. 11(2): 11:1-11:15 (2014) - [i4]Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Faster Fully-Dynamic Minimum Spanning Forest. CoRR abs/1407.6832 (2014) - [i3]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
The Power of Two Choices with Simple Tabulation. CoRR abs/1407.6846 (2014) - [i2]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Planar Reachability in Linear Space and Constant Time. CoRR abs/1411.5867 (2014) - [i1]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
Hashing for statistics over k-partitions. CoRR abs/1411.7191 (2014) - 2013
- [c2]Eva Rotenberg, James Cranch, Michael Kirkedal Thomsen, Holger Bock Axelsen:
Strength of the Reversible, Garbage-Free 2 k ±1 Multiplier. RC 2013: 46-57 - 2010
- [c1]Matloob Qureshi, Eva Rotenberg, Hans Henrik Stærfeldt, Lena Hansson, David Wayne Ussery:
The Genome Atlas Resource. CSBio 2010: 141-150
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 2026-01-25 00:21 CET 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:
