Jacob Holm

According to our database, Jacob Holm authored at least 34 papers between 1997 and 2024.

Collaborative distances:

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

2024

Good r-divisions Imply Optimal Amortized Decremental Biconnectivity.

Jacob Holm, Eva Rotenberg

Theory Comput. Syst., August, 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

2023

Splay Top Trees.

Jacob Holm, Eva Rotenberg, Alice Ryhl

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Massively Parallel Computation on Embedded Planar Graphs.

Jacob Holm, Jakub Tetek

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

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

Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs.

Jacob Holm, Jakub Tetek

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

2020

Escaping an Infinitude of Lions.

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

Am. Math. Mon., 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

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

2019

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

Aaron Bernstein, Jacob Holm, Eva Rotenberg

J. ACM, 2019

Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges.

Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Good r-divisions Imply Optimal Amortised Decremental Biconnectivity.

Jacob Holm, Eva Rotenberg

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

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

One-Way Trail Orientations.

Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 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

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs.

Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 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

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

Faster Fully-Dynamic Minimum Spanning Forest.

Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen

Proceedings of the Algorithms - ESA 2015, 2015

2005

Maintaining information in fully dynamic trees with top trees.

Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

ACM Trans. Algorithms, 2005

2001

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

2000

Maintaining Center and Median in Dynamic Trees.

Stephen Alstrup, Jacob Holm, Mikkel Thorup

Proceedings of the Algorithm Theory, 2000

Improved Algorithms for Finding Level Ancestors in Dynamic Trees.

Stephen Alstrup, Jacob Holm

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1998

Direct Routing on Trees (Extended Abstract).

Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

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

1997

Minimizing Diameters of Dynamic Trees.

Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997