Minimizing Diameters of Dynamic Trees. - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (ICALP, 1997)

Direct Routing on Trees (Extended Abstract). - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (SODA, 1998)

Improved Algorithms for Finding Level Ancestors in Dynamic Trees. - Stephen Alstrup; Jacob Holm (ICALP, 2000)

Maintaining Center and Median in Dynamic Trees. - Stephen Alstrup; Jacob Holm; Mikkel Thorup (SWAT, 2000)

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. - Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (J. ACM, 2001)

Maintaining information in fully dynamic trees with top trees. - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (ACM Trans. Algorithms, 2005)

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

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

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)

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. - Mikkel Abrahamsen; Stephen Alstrup; Jacob Holm; Mathias Bæk Tejs Knudsen; Morten Stöckel (ICALP, 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)

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

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

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

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

Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. - Jacob Holm; Valerie King; Mikkel Thorup; Or Zamir; Uri Zwick (FOCS, 2019)

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

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)

Near-optimal induced universal graphs for cycles and paths. - Mikkel Abrahamsen; Stephen Alstrup; Jacob Holm; Mathias Bæk Tejs Knudsen; Morten Stöckel (Discret. Appl. Math., 2020)

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

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

Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs. - Jacob Holm; Jakub Tetek (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)

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

Massively Parallel Computation on Embedded Planar Graphs. - Jacob Holm; Jakub Tetek (SODA, 2023)

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

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)

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

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