default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacob Holm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Jacob Holm
, Eva Rotenberg:
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity. Theory Comput. Syst. 68(4): 1014-1048 (2024)- [c24]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 - 2023
- [c23]Jacob Holm, Ivor van der Hoog, Eva Rotenberg:
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. SoCG 2023: 40:1-40:18 - [c22]Jacob Holm, Jakub Tetek:
Massively Parallel Computation on Embedded Planar Graphs. SODA 2023: 4373-4408 - [c21]Jacob Holm, Eva Rotenberg, Alice Ryhl:
Splay Top Trees. SOSA 2023: 305-331 - [i21]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) - 2022
- [c20]Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen:
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. MFCS 2022: 34:1-34:15 - [i20]Jacob Holm, Jakub Tetek:
Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs. CoRR abs/2204.09035 (2022) - [i19]Jacob Holm, Ivor van der Hoog, Eva Rotenberg:
Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity. CoRR abs/2209.14079 (2022) - [i18]Aleksander B. G. Christiansen, Jacob Holm, Ivor van der Hoog, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. CoRR abs/2209.14087 (2022) - [i17]Jacob Holm, Eva Rotenberg, Alice Ryhl:
Splay Top Trees. CoRR abs/2210.11918 (2022) - 2021
- [c19]Jacob Holm, Eva Rotenberg:
Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. STACS 2021: 42:1-42:18 - 2020
- [j6]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: 1-13 (2020) - [j5]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Escaping an Infinitude of Lions. Am. Math. Mon. 127(10): 880-896 (2020) - [c18]Jacob Holm, Eva Rotenberg:
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity. SODA 2020: 2378-2397 - [c17]Jacob Holm, Eva Rotenberg:
Fully-dynamic planarity testing in polylogarithmic time. STOC 2020: 167-180 - [i16]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Escaping an Infinitude of Lions. CoRR abs/2012.11181 (2020)
2010 – 2019
- 2019
- [j4]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) - [c16]Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS 2019: 896-909 - [i15]Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR abs/1909.11147 (2019) - [i14]Jacob Holm, Eva Rotenberg:
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity. CoRR abs/1910.09005 (2019) - [i13]Jacob Holm, Eva Rotenberg:
Fully-dynamic Planarity Testing in Polylogarithmic Time. CoRR abs/1911.03449 (2019) - 2018
- [c15]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. ESA 2018: 46:1-46:16 - [c14]Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg:
One-Way Trail Orientations. ICALP 2018: 6:1-6:13 - [c13]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Dynamic Bridge-Finding in Õ(log2 n) Amortized Time. SODA 2018: 35-52 - [c12]Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online Bipartite Matching with Amortized Replacements. SODA 2018: 947-959 - [i12]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. CoRR abs/1806.10772 (2018) - [i11]Jacob Holm, Eva Rotenberg:
Good r-divisions Imply Optimal Amortised Decremental Biconnectivity. CoRR abs/1808.02568 (2018) - 2017
- [j3]Jacob Holm, Eva Rotenberg:
Dynamic Planar Embeddings of Dynamic Graphs. Theory Comput. Syst. 61(4): 1054-1083 (2017) - [c11]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. SoCG 2017: 6:1-6:16 - [c10]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. ESA 2017: 50:1-50:15 - [c9]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: 128:1-128:14 - [i10]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. CoRR abs/1703.03687 (2017) - [i9]Jacob Holm, Eva Rotenberg:
Dynamic Planar Embeddings of Dynamic Graphs. CoRR abs/1704.00565 (2017) - [i8]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. CoRR abs/1706.10228 (2017) - [i7]Aaron Bernstein, Jacob Holm, Eva Rotenberg:
Online bipartite matching with amortized $O(\log^2 n)$ replacements. CoRR abs/1707.06063 (2017) - [i6]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time. CoRR abs/1707.06311 (2017) - [i5]Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg:
One-Way Trail Orientations. CoRR abs/1708.07389 (2017) - 2016
- [i4]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR abs/1607.04911 (2016) - 2015
- [c8]Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Faster Fully-Dynamic Minimum Spanning Forest. ESA 2015: 742-753 - [c7]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Planar Reachability in Linear Space and Constant Time. FOCS 2015: 370-389 - [c6]Jacob Holm, Eva Rotenberg:
Dynamic Planar Embeddings of Dynamic Graphs. STACS 2015: 434-446 - 2014
- [i3]Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Faster Fully-Dynamic Minimum Spanning Forest. CoRR abs/1407.6832 (2014) - [i2]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Planar Reachability in Linear Space and Constant Time. CoRR abs/1411.5867 (2014)
2000 – 2009
- 2005
- [j2]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2): 243-264 (2005) - 2003
- [i1]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining Information in Fully-Dynamic Trees with Top Trees. CoRR cs.DS/0310065 (2003) - 2001
- [j1]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): 723-760 (2001) - 2000
- [c5]Stephen Alstrup, Jacob Holm:
Improved Algorithms for Finding Level Ancestors in Dynamic Trees. ICALP 2000: 73-84 - [c4]Stephen Alstrup, Jacob Holm, Mikkel Thorup:
Maintaining Center and Median in Dynamic Trees. SWAT 2000: 46-56
1990 – 1999
- 1998
- [c3]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Direct Routing on Trees (Extended Abstract). SODA 1998: 342-349 - [c2]Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. STOC 1998: 79-89 - 1997
- [c1]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Minimizing Diameters of Dynamic Trees. ICALP 1997: 270-280
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 2024-12-10 20:48 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:
