Jacob Holm

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 38

Top Topics

Top Venues

Publications

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)
Jacob Holm, Ivor van der Hoog, Eva Rotenberg
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. SoCG (2023)
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 (2023)
Jacob Holm, Jakub Tetek
Massively Parallel Computation on Embedded Planar Graphs. SODA (2023)
Jacob Holm, Eva Rotenberg, Alice Ryhl
Splay Top Trees. SOSA (2023)
Jacob Holm, Jakub Tetek
Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs. CoRR (2022)
Jacob Holm, Ivor van der Hoog, Eva Rotenberg
Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity. CoRR (2022)
Aleksander B. G. Christiansen, Jacob Holm, Ivor van der Hoog, Eva Rotenberg, Chris Schwiegelshohn
Adaptive Out-Orientations with Applications. CoRR (2022)
Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. MFCS (2022)
Jacob Holm, Eva Rotenberg, Alice Ryhl
Splay Top Trees. CoRR (2022)
Jacob Holm, Eva Rotenberg
Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. STACS (2021)
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282 (2020)
Jacob Holm, Eva Rotenberg
Fully-dynamic planarity testing in polylogarithmic time. STOC (2020)
Jacob Holm, Eva Rotenberg
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity. SODA (2020)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Escaping an Infinitude of Lions. Am. Math. Mon. 127 (10) (2020)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Escaping an Infinitude of Lions. CoRR (2020)
Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR (2019)
Jacob Holm, Eva Rotenberg
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity. CoRR (2019)
Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS (2019)
Aaron Bernstein, Jacob Holm, Eva Rotenberg
) Replacements. J. ACM 66 (5) (2019)
Jacob Holm, Eva Rotenberg
Fully-dynamic Planarity Testing in Polylogarithmic Time. CoRR (2019)
Jacob Holm, Eva Rotenberg, Mikkel Thorup
) Amortized Time. SODA (2018)
Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg
One-Way Trail Orientations. ICALP (2018)
Aaron Bernstein, Jacob Holm, Eva Rotenberg
Online Bipartite Matching with Amortized Replacements. SODA (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
Decremental SPQR-trees for Planar Graphs. CoRR (2018)
Jacob Holm, Eva Rotenberg
Good r-divisions Imply Optimal Amortised Decremental Biconnectivity. CoRR (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
Decremental SPQR-trees for Planar Graphs. ESA (2018)
Aaron Bernstein, Jacob Holm, Eva Rotenberg
Online bipartite matching with amortized $O(\log^2 n)$ replacements. CoRR (2017)
Jacob Holm, Eva Rotenberg
Dynamic Planar Embeddings of Dynamic Graphs. Theory Comput. Syst. 61 (4) (2017)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. CoRR (2017)
Jacob Holm, Eva Rotenberg, Mikkel Thorup
Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time. CoRR (2017)
Jacob Holm, Eva Rotenberg
Dynamic Planar Embeddings of Dynamic Graphs. CoRR (2017)
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP (2017)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. ESA (2017)
Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg
One-Way Trail Orientations. CoRR (2017)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Best Laid Plans of Lions and Men. CoRR (2017)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Best Laid Plans of Lions and Men. SoCG (2017)
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR (2016)
Jacob Holm, Eva Rotenberg
Dynamic Planar Embeddings of Dynamic Graphs. STACS (2015)
Jacob Holm, Eva Rotenberg, Mikkel Thorup
Planar Reachability in Linear Space and Constant Time. FOCS (2015)
Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Faster Fully-Dynamic Minimum Spanning Forest. ESA (2015)
Jacob Holm, Eva Rotenberg, Mikkel Thorup
Planar Reachability in Linear Space and Constant Time. CoRR (2014)
Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Faster Fully-Dynamic Minimum Spanning Forest. CoRR (2014)
Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1 (2) (2005)
Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Maintaining Information in Fully-Dynamic Trees with Top Trees CoRR (2003)
Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48 (4) (2001)
Stephen Alstrup, Jacob Holm, Mikkel Thorup
Maintaining Center and Median in Dynamic Trees. SWAT (2000)
Stephen Alstrup, Jacob Holm
Improved Algorithms for Finding Level Ancestors in Dynamic Trees. ICALP (2000)
Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Direct Routing on Trees (Extended Abstract). SODA (1998)
Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. STOC (1998)
Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
Minimizing Diameters of Dynamic Trees. ICALP (1997)