BibTeX records: Jacob Holm

download as .bib file

@inproceedings{DBLP:conf/soda/ChekuriCHHQRS24,
  author       = {Chandra Chekuri and
                  Aleksander Bj{\o}rn Grodt Christiansen and
                  Jacob Holm and
                  Ivor {van der Hoog} and
                  Kent Quanrud and
                  Eva Rotenberg and
                  Chris Schwiegelshohn},
  editor       = {David P. Woodruff},
  title        = {Adaptive Out-Orientations with Applications},
  booktitle    = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
  pages        = {3062--3088},
  publisher    = {{SIAM}},
  year         = {2024},
  url          = {https://doi.org/10.1137/1.9781611977912.110},
  doi          = {10.1137/1.9781611977912.110},
  timestamp    = {Thu, 04 Apr 2024 19:38:10 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/ChekuriCHHQRS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/HolmHR23,
  author       = {Jacob Holm and
                  Ivor {van der Hoog} and
                  Eva Rotenberg},
  editor       = {Erin W. Chambers and
                  Joachim Gudmundsson},
  title        = {Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable
                  Planar Embeddings},
  booktitle    = {39th International Symposium on Computational Geometry, SoCG 2023,
                  June 12-15, 2023, Dallas, Texas, {USA}},
  series       = {LIPIcs},
  volume       = {258},
  pages        = {40:1--40:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2023.40},
  doi          = {10.4230/LIPICS.SOCG.2023.40},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/HolmHR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/HolmT23,
  author       = {Jacob Holm and
                  Jakub Tetek},
  editor       = {Nikhil Bansal and
                  Viswanath Nagarajan},
  title        = {Massively Parallel Computation on Embedded Planar Graphs},
  booktitle    = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2023, Florence, Italy, January 22-25, 2023},
  pages        = {4373--4408},
  publisher    = {{SIAM}},
  year         = {2023},
  url          = {https://doi.org/10.1137/1.9781611977554.ch167},
  doi          = {10.1137/1.9781611977554.CH167},
  timestamp    = {Fri, 17 Feb 2023 09:28:57 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/HolmT23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sosa/HolmRR23,
  author       = {Jacob Holm and
                  Eva Rotenberg and
                  Alice Ryhl},
  editor       = {Telikepalli Kavitha and
                  Kurt Mehlhorn},
  title        = {Splay Top Trees},
  booktitle    = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
                  Italy, January 23-25, 2023},
  pages        = {305--331},
  publisher    = {{SIAM}},
  year         = {2023},
  url          = {https://doi.org/10.1137/1.9781611977585.ch28},
  doi          = {10.1137/1.9781611977585.CH28},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sosa/HolmRR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2310-18146,
  author       = {Chandra Chekuri and
                  Aleksander Bj{\o}rn Grodt Christiansen and
                  Jacob Holm and
                  Ivor {van der Hoog} and
                  Kent Quanrud and
                  Eva Rotenberg and
                  Chris Schwiegelshohn},
  title        = {Adaptive Out-Orientations with Applications},
  journal      = {CoRR},
  volume       = {abs/2310.18146},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.18146},
  doi          = {10.48550/ARXIV.2310.18146},
  eprinttype    = {arXiv},
  eprint       = {2310.18146},
  timestamp    = {Thu, 02 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-18146.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/ChristiansenHRT22,
  author       = {Aleksander B. G. Christiansen and
                  Jacob Holm and
                  Eva Rotenberg and
                  Carsten Thomassen},
  editor       = {Stefan Szeider and
                  Robert Ganian and
                  Alexandra Silva},
  title        = {On Dynamic {\(\alpha\)} + 1 Arboricity Decomposition and Out-Orientation},
  booktitle    = {47th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {241},
  pages        = {34:1--34:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2022.34},
  doi          = {10.4230/LIPICS.MFCS.2022.34},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/ChristiansenHRT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2204-09035,
  author       = {Jacob Holm and
                  Jakub Tetek},
  title        = {Massively Parallel Computation and Sublinear-Time Algorithms for Embedded
                  Planar Graphs},
  journal      = {CoRR},
  volume       = {abs/2204.09035},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2204.09035},
  doi          = {10.48550/ARXIV.2204.09035},
  eprinttype    = {arXiv},
  eprint       = {2204.09035},
  timestamp    = {Mon, 25 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-09035.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2209-14079,
  author       = {Jacob Holm and
                  Ivor {van der Hoog} and
                  Eva Rotenberg},
  title        = {Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity},
  journal      = {CoRR},
  volume       = {abs/2209.14079},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2209.14079},
  doi          = {10.48550/ARXIV.2209.14079},
  eprinttype    = {arXiv},
  eprint       = {2209.14079},
  timestamp    = {Thu, 06 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2209-14079.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2209-14087,
  author       = {Aleksander B. G. Christiansen and
                  Jacob Holm and
                  Ivor {van der Hoog} and
                  Eva Rotenberg and
                  Chris Schwiegelshohn},
  title        = {Adaptive Out-Orientations with Applications},
  journal      = {CoRR},
  volume       = {abs/2209.14087},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2209.14087},
  doi          = {10.48550/ARXIV.2209.14087},
  eprinttype    = {arXiv},
  eprint       = {2209.14087},
  timestamp    = {Thu, 06 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2209-14087.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2210-11918,
  author       = {Jacob Holm and
                  Eva Rotenberg and
                  Alice Ryhl},
  title        = {Splay Top Trees},
  journal      = {CoRR},
  volume       = {abs/2210.11918},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.11918},
  doi          = {10.48550/ARXIV.2210.11918},
  eprinttype    = {arXiv},
  eprint       = {2210.11918},
  timestamp    = {Tue, 25 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-11918.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/HolmR21,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  editor       = {Markus Bl{\"{a}}ser and
                  Benjamin Monmege},
  title        = {Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity},
  booktitle    = {38th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
                  Conference)},
  series       = {LIPIcs},
  volume       = {187},
  pages        = {42:1--42:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2021.42},
  doi          = {10.4230/LIPICS.STACS.2021.42},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/HolmR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AbrahamsenAHKS20,
  author       = {Mikkel Abrahamsen and
                  Stephen Alstrup and
                  Jacob Holm and
                  Mathias B{\ae}k Tejs Knudsen and
                  Morten St{\"{o}}ckel},
  title        = {Near-optimal induced universal graphs for cycles and paths},
  journal      = {Discret. Appl. Math.},
  volume       = {282},
  pages        = {1--13},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.dam.2019.10.030},
  doi          = {10.1016/J.DAM.2019.10.030},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AbrahamsenAHKS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tamm/AbrahamsenHRW20,
  author       = {Mikkel Abrahamsen and
                  Jacob Holm and
                  Eva Rotenberg and
                  Christian Wulff{-}Nilsen},
  title        = {Escaping an Infinitude of Lions},
  journal      = {Am. Math. Mon.},
  volume       = {127},
  number       = {10},
  pages        = {880--896},
  year         = {2020},
  url          = {https://doi.org/10.1080/00029890.2020.1820837},
  doi          = {10.1080/00029890.2020.1820837},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tamm/AbrahamsenHRW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/HolmR20,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  editor       = {Shuchi Chawla},
  title        = {Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity,
                  and Triconnectivity},
  booktitle    = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages        = {2378--2397},
  publisher    = {{SIAM}},
  year         = {2020},
  url          = {https://doi.org/10.1137/1.9781611975994.146},
  doi          = {10.1137/1.9781611975994.146},
  timestamp    = {Thu, 15 Jul 2021 13:48:53 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/HolmR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/HolmR20,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  editor       = {Konstantin Makarychev and
                  Yury Makarychev and
                  Madhur Tulsiani and
                  Gautam Kamath and
                  Julia Chuzhoy},
  title        = {Fully-dynamic planarity testing in polylogarithmic time},
  booktitle    = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
  pages        = {167--180},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3357713.3384249},
  doi          = {10.1145/3357713.3384249},
  timestamp    = {Mon, 18 Dec 2023 07:33:37 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HolmR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2012-11181,
  author       = {Mikkel Abrahamsen and
                  Jacob Holm and
                  Eva Rotenberg and
                  Christian Wulff{-}Nilsen},
  title        = {Escaping an Infinitude of Lions},
  journal      = {CoRR},
  volume       = {abs/2012.11181},
  year         = {2020},
  url          = {https://arxiv.org/abs/2012.11181},
  eprinttype    = {arXiv},
  eprint       = {2012.11181},
  timestamp    = {Mon, 04 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2012-11181.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BernsteinHR19,
  author       = {Aaron Bernstein and
                  Jacob Holm and
                  Eva Rotenberg},
  title        = {Online Bipartite Matching with Amortized \emph{O}(log \({}^{\mbox{2}}\)
                  \emph{n}) Replacements},
  journal      = {J. {ACM}},
  volume       = {66},
  number       = {5},
  pages        = {37:1--37:23},
  year         = {2019},
  url          = {https://doi.org/10.1145/3344999},
  doi          = {10.1145/3344999},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/BernsteinHR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/HolmKTZZ19,
  author       = {Jacob Holm and
                  Valerie King and
                  Mikkel Thorup and
                  Or Zamir and
                  Uri Zwick},
  editor       = {David Zuckerman},
  title        = {Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges},
  booktitle    = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2019, Baltimore, Maryland, USA, November 9-12, 2019},
  pages        = {896--909},
  publisher    = {{IEEE} Computer Society},
  year         = {2019},
  url          = {https://doi.org/10.1109/FOCS.2019.00058},
  doi          = {10.1109/FOCS.2019.00058},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/HolmKTZZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1909-11147,
  author       = {Jacob Holm and
                  Valerie King and
                  Mikkel Thorup and
                  Or Zamir and
                  Uri Zwick},
  title        = {Random k-out subgraph leaves only O(n/k) inter-component edges},
  journal      = {CoRR},
  volume       = {abs/1909.11147},
  year         = {2019},
  url          = {http://arxiv.org/abs/1909.11147},
  eprinttype    = {arXiv},
  eprint       = {1909.11147},
  timestamp    = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1909-11147.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1910-09005,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  title        = {Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity,
                  and Triconnectivity},
  journal      = {CoRR},
  volume       = {abs/1910.09005},
  year         = {2019},
  url          = {http://arxiv.org/abs/1910.09005},
  eprinttype    = {arXiv},
  eprint       = {1910.09005},
  timestamp    = {Tue, 22 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1910-09005.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1911-03449,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  title        = {Fully-dynamic Planarity Testing in Polylogarithmic Time},
  journal      = {CoRR},
  volume       = {abs/1911.03449},
  year         = {2019},
  url          = {http://arxiv.org/abs/1911.03449},
  eprinttype    = {arXiv},
  eprint       = {1911.03449},
  timestamp    = {Mon, 11 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1911-03449.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/HolmIKLR18,
  author       = {Jacob Holm and
                  Giuseppe F. Italiano and
                  Adam Karczmarz and
                  Jakub Lacki and
                  Eva Rotenberg},
  editor       = {Yossi Azar and
                  Hannah Bast and
                  Grzegorz Herman},
  title        = {Decremental SPQR-trees for Planar Graphs},
  booktitle    = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
                  2018, Helsinki, Finland},
  series       = {LIPIcs},
  volume       = {112},
  pages        = {46:1--46:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2018.46},
  doi          = {10.4230/LIPICS.ESA.2018.46},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/HolmIKLR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/AamandHHR18,
  author       = {Anders Aamand and
                  Niklas Hjuler and
                  Jacob Holm and
                  Eva Rotenberg},
  editor       = {Ioannis Chatzigiannakis and
                  Christos Kaklamanis and
                  D{\'{a}}niel Marx and
                  Donald Sannella},
  title        = {One-Way Trail Orientations},
  booktitle    = {45th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
  series       = {LIPIcs},
  volume       = {107},
  pages        = {6:1--6:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2018.6},
  doi          = {10.4230/LIPICS.ICALP.2018.6},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/AamandHHR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/HolmRT18,
  author       = {Jacob Holm and
                  Eva Rotenberg and
                  Mikkel Thorup},
  editor       = {Artur Czumaj},
  title        = {Dynamic Bridge-Finding in \emph{{\~{O}}}(log\({}^{\mbox{2}}\) \emph{n})
                  Amortized Time},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages        = {35--52},
  publisher    = {{SIAM}},
  year         = {2018},
  url          = {https://doi.org/10.1137/1.9781611975031.3},
  doi          = {10.1137/1.9781611975031.3},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/HolmRT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BernsteinHR18,
  author       = {Aaron Bernstein and
                  Jacob Holm and
                  Eva Rotenberg},
  editor       = {Artur Czumaj},
  title        = {Online Bipartite Matching with Amortized Replacements},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages        = {947--959},
  publisher    = {{SIAM}},
  year         = {2018},
  url          = {https://doi.org/10.1137/1.9781611975031.61},
  doi          = {10.1137/1.9781611975031.61},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BernsteinHR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1806-10772,
  author       = {Jacob Holm and
                  Giuseppe F. Italiano and
                  Adam Karczmarz and
                  Jakub Lacki and
                  Eva Rotenberg},
  title        = {Decremental SPQR-trees for Planar Graphs},
  journal      = {CoRR},
  volume       = {abs/1806.10772},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.10772},
  eprinttype    = {arXiv},
  eprint       = {1806.10772},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-10772.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1808-02568,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  title        = {Good r-divisions Imply Optimal Amortised Decremental Biconnectivity},
  journal      = {CoRR},
  volume       = {abs/1808.02568},
  year         = {2018},
  url          = {http://arxiv.org/abs/1808.02568},
  eprinttype    = {arXiv},
  eprint       = {1808.02568},
  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1808-02568.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/HolmR17,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  title        = {Dynamic Planar Embeddings of Dynamic Graphs},
  journal      = {Theory Comput. Syst.},
  volume       = {61},
  number       = {4},
  pages        = {1054--1083},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00224-017-9768-7},
  doi          = {10.1007/S00224-017-9768-7},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/HolmR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/AbrahamsenHRW17,
  author       = {Mikkel Abrahamsen and
                  Jacob Holm and
                  Eva Rotenberg and
                  Christian Wulff{-}Nilsen},
  editor       = {Boris Aronov and
                  Matthew J. Katz},
  title        = {Best Laid Plans of Lions and Men},
  booktitle    = {33rd International Symposium on Computational Geometry, SoCG 2017,
                  July 4-7, 2017, Brisbane, Australia},
  series       = {LIPIcs},
  volume       = {77},
  pages        = {6:1--6:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2017.6},
  doi          = {10.4230/LIPICS.SOCG.2017.6},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/compgeom/AbrahamsenHRW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/HolmIKLRS17,
  author       = {Jacob Holm and
                  Giuseppe F. Italiano and
                  Adam Karczmarz and
                  Jakub Lacki and
                  Eva Rotenberg and
                  Piotr Sankowski},
  editor       = {Kirk Pruhs and
                  Christian Sohler},
  title        = {Contracting a Planar Graph Efficiently},
  booktitle    = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
                  4-6, 2017, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {87},
  pages        = {50:1--50:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2017.50},
  doi          = {10.4230/LIPICS.ESA.2017.50},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/HolmIKLRS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/AbrahamsenAHKS17,
  author       = {Mikkel Abrahamsen and
                  Stephen Alstrup and
                  Jacob Holm and
                  Mathias B{\ae}k Tejs Knudsen and
                  Morten St{\"{o}}ckel},
  editor       = {Ioannis Chatzigiannakis and
                  Piotr Indyk and
                  Fabian Kuhn and
                  Anca Muscholl},
  title        = {Near-Optimal Induced Universal Graphs for Bounded Degree Graphs},
  booktitle    = {44th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {80},
  pages        = {128:1--128:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2017.128},
  doi          = {10.4230/LIPICS.ICALP.2017.128},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/AbrahamsenAHKS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/AbrahamsenHRW17,
  author       = {Mikkel Abrahamsen and
                  Jacob Holm and
                  Eva Rotenberg and
                  Christian Wulff{-}Nilsen},
  title        = {Best Laid Plans of Lions and Men},
  journal      = {CoRR},
  volume       = {abs/1703.03687},
  year         = {2017},
  url          = {http://arxiv.org/abs/1703.03687},
  eprinttype    = {arXiv},
  eprint       = {1703.03687},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AbrahamsenHRW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/HolmR17,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  title        = {Dynamic Planar Embeddings of Dynamic Graphs},
  journal      = {CoRR},
  volume       = {abs/1704.00565},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.00565},
  eprinttype    = {arXiv},
  eprint       = {1704.00565},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HolmR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/HolmIKLRS17,
  author       = {Jacob Holm and
                  Giuseppe F. Italiano and
                  Adam Karczmarz and
                  Jakub Lacki and
                  Eva Rotenberg and
                  Piotr Sankowski},
  title        = {Contracting a Planar Graph Efficiently},
  journal      = {CoRR},
  volume       = {abs/1706.10228},
  year         = {2017},
  url          = {http://arxiv.org/abs/1706.10228},
  eprinttype    = {arXiv},
  eprint       = {1706.10228},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HolmIKLRS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BernsteinHR17,
  author       = {Aaron Bernstein and
                  Jacob Holm and
                  Eva Rotenberg},
  title        = {Online bipartite matching with amortized {\textdollar}O({\textbackslash}log{\^{}}2
                  n){\textdollar} replacements},
  journal      = {CoRR},
  volume       = {abs/1707.06063},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.06063},
  eprinttype    = {arXiv},
  eprint       = {1707.06063},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BernsteinHR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/HolmRT17,
  author       = {Jacob Holm and
                  Eva Rotenberg and
                  Mikkel Thorup},
  title        = {Dynamic Bridge-Finding in {\textdollar}{\textbackslash}tilde\{O\}({\textbackslash}log
                  {\^{}}2 n){\textdollar} Amortized Time},
  journal      = {CoRR},
  volume       = {abs/1707.06311},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.06311},
  eprinttype    = {arXiv},
  eprint       = {1707.06311},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HolmRT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1708-07389,
  author       = {Anders Aamand and
                  Niklas Hjuler and
                  Jacob Holm and
                  Eva Rotenberg},
  title        = {One-Way Trail Orientations},
  journal      = {CoRR},
  volume       = {abs/1708.07389},
  year         = {2017},
  url          = {http://arxiv.org/abs/1708.07389},
  eprinttype    = {arXiv},
  eprint       = {1708.07389},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1708-07389.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/AbrahamsenAHKS16,
  author       = {Mikkel Abrahamsen and
                  Stephen Alstrup and
                  Jacob Holm and
                  Mathias B{\ae}k Tejs Knudsen and
                  Morten St{\"{o}}ckel},
  title        = {Near-Optimal Induced Universal Graphs for Bounded Degree Graphs},
  journal      = {CoRR},
  volume       = {abs/1607.04911},
  year         = {2016},
  url          = {http://arxiv.org/abs/1607.04911},
  eprinttype    = {arXiv},
  eprint       = {1607.04911},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AbrahamsenAHKS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/HolmRW15,
  author       = {Jacob Holm and
                  Eva Rotenberg and
                  Christian Wulff{-}Nilsen},
  editor       = {Nikhil Bansal and
                  Irene Finocchi},
  title        = {Faster Fully-Dynamic Minimum Spanning Forest},
  booktitle    = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
                  Greece, September 14-16, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9294},
  pages        = {742--753},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48350-3\_62},
  doi          = {10.1007/978-3-662-48350-3\_62},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/HolmRW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/HolmRT15,
  author       = {Jacob Holm and
                  Eva Rotenberg and
                  Mikkel Thorup},
  editor       = {Venkatesan Guruswami},
  title        = {Planar Reachability in Linear Space and Constant Time},
  booktitle    = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages        = {370--389},
  publisher    = {{IEEE} Computer Society},
  year         = {2015},
  url          = {https://doi.org/10.1109/FOCS.2015.30},
  doi          = {10.1109/FOCS.2015.30},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/HolmRT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/HolmR15,
  author       = {Jacob Holm and
                  Eva Rotenberg},
  editor       = {Ernst W. Mayr and
                  Nicolas Ollinger},
  title        = {Dynamic Planar Embeddings of Dynamic Graphs},
  booktitle    = {32nd International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2015, March 4-7, 2015, Garching, Germany},
  series       = {LIPIcs},
  volume       = {30},
  pages        = {434--446},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2015.434},
  doi          = {10.4230/LIPICS.STACS.2015.434},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/HolmR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/HolmRW14,
  author       = {Jacob Holm and
                  Eva Rotenberg and
                  Christian Wulff{-}Nilsen},
  title        = {Faster Fully-Dynamic Minimum Spanning Forest},
  journal      = {CoRR},
  volume       = {abs/1407.6832},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.6832},
  eprinttype    = {arXiv},
  eprint       = {1407.6832},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HolmRW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/HolmRT14,
  author       = {Jacob Holm and
                  Eva Rotenberg and
                  Mikkel Thorup},
  title        = {Planar Reachability in Linear Space and Constant Time},
  journal      = {CoRR},
  volume       = {abs/1411.5867},
  year         = {2014},
  url          = {http://arxiv.org/abs/1411.5867},
  eprinttype    = {arXiv},
  eprint       = {1411.5867},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HolmRT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/AlstrupHLT05,
  author       = {Stephen Alstrup and
                  Jacob Holm and
                  Kristian de Lichtenberg and
                  Mikkel Thorup},
  title        = {Maintaining information in fully dynamic trees with top trees},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {1},
  number       = {2},
  pages        = {243--264},
  year         = {2005},
  url          = {https://doi.org/10.1145/1103963.1103966},
  doi          = {10.1145/1103963.1103966},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/AlstrupHLT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/cs-DS-0310065,
  author       = {Stephen Alstrup and
                  Jacob Holm and
                  Kristian de Lichtenberg and
                  Mikkel Thorup},
  title        = {Maintaining Information in Fully-Dynamic Trees with Top Trees},
  journal      = {CoRR},
  volume       = {cs.DS/0310065},
  year         = {2003},
  url          = {http://arxiv.org/abs/cs/0310065},
  timestamp    = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/cs-DS-0310065.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/HolmLT01,
  author       = {Jacob Holm and
                  Kristian de Lichtenberg and
                  Mikkel Thorup},
  title        = {Poly-logarithmic deterministic fully-dynamic algorithms for connectivity,
                  minimum spanning tree, 2-edge, and biconnectivity},
  journal      = {J. {ACM}},
  volume       = {48},
  number       = {4},
  pages        = {723--760},
  year         = {2001},
  url          = {https://doi.org/10.1145/502090.502095},
  doi          = {10.1145/502090.502095},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/HolmLT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/AlstrupH00,
  author       = {Stephen Alstrup and
                  Jacob Holm},
  editor       = {Ugo Montanari and
                  Jos{\'{e}} D. P. Rolim and
                  Emo Welzl},
  title        = {Improved Algorithms for Finding Level Ancestors in Dynamic Trees},
  booktitle    = {Automata, Languages and Programming, 27th International Colloquium,
                  {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1853},
  pages        = {73--84},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-45022-X\_8},
  doi          = {10.1007/3-540-45022-X\_8},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/AlstrupH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/swat/AlstrupHT00,
  author       = {Stephen Alstrup and
                  Jacob Holm and
                  Mikkel Thorup},
  editor       = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Maintaining Center and Median in Dynamic Trees},
  booktitle    = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
                  Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1851},
  pages        = {46--56},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-44985-X\_6},
  doi          = {10.1007/3-540-44985-X\_6},
  timestamp    = {Fri, 27 Mar 2020 08:50:36 +0100},
  biburl       = {https://dblp.org/rec/conf/swat/AlstrupHT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/AlstrupHLT98,
  author       = {Stephen Alstrup and
                  Jacob Holm and
                  Kristian de Lichtenberg and
                  Mikkel Thorup},
  editor       = {Howard J. Karloff},
  title        = {Direct Routing on Trees (Extended Abstract)},
  booktitle    = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  25-27 January 1998, San Francisco, California, {USA}},
  pages        = {342--349},
  publisher    = {{ACM/SIAM}},
  year         = {1998},
  url          = {http://dl.acm.org/citation.cfm?id=314613.314726},
  timestamp    = {Thu, 05 Jul 2018 07:29:49 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AlstrupHLT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/HolmLT98,
  author       = {Jacob Holm and
                  Kristian de Lichtenberg and
                  Mikkel Thorup},
  editor       = {Jeffrey Scott Vitter},
  title        = {Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity,
                  Minimum Spanning Tree, 2-Edge, and Biconnectivity},
  booktitle    = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
                  of Computing, Dallas, Texas, USA, May 23-26, 1998},
  pages        = {79--89},
  publisher    = {{ACM}},
  year         = {1998},
  url          = {https://doi.org/10.1145/276698.276715},
  doi          = {10.1145/276698.276715},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HolmLT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/AlstrupHLT97,
  author       = {Stephen Alstrup and
                  Jacob Holm and
                  Kristian de Lichtenberg and
                  Mikkel Thorup},
  editor       = {Pierpaolo Degano and
                  Roberto Gorrieri and
                  Alberto Marchetti{-}Spaccamela},
  title        = {Minimizing Diameters of Dynamic Trees},
  booktitle    = {Automata, Languages and Programming, 24th International Colloquium,
                  ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1256},
  pages        = {270--280},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/3-540-63165-8\_184},
  doi          = {10.1007/3-540-63165-8\_184},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/AlstrupHLT97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.