Jacob Holm - RankMe

55 papers A* 17A 5B 1Journal 30Unranked 2

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