Jacob Holm

Jacob Holm

Tenure Track Assistant Professor, Ekstern


  1. Published

    Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

    Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 201. Chatzigiannaki, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 128. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 80).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  2. Published

    Massively Parallel Computation on Embedded Planar Graphs

    Holm, Jacob & Tetek, Jakub, 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Bansal, N. & Nagarajan, V. (eds.). Society for Industrial and Applied Mathematics, p. 4373-4408

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  3. Published

    Maintaining center and median in dynamic trees

    Alstrup, Stephen, Holm, Jacob & Thorup, Mikkel, 2000, Algorithm Theory-SWAT 2000. Springer Science+Business Media, Vol. 1851. p. 46-56 11 p. (Lecture notes in computer science).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  4. Published

    Good r-divisions imply optimal amortized decremental biconnectivity

    Holm, Jacob & Rotenberg, E., 2021, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021. Blaser, M. & Monmege, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-18 42. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 187).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  5. Published

    Fully-dynamic planarity testing in polylogarithmic time

    Holm, Jacob & Rotenberg, E., 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 167-180

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  6. Published

    Escaping an Infinitude of Lions

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2020, In: The American Mathematical Monthly. 127, 10, p. 880-896

    Research output: Contribution to journalJournal articleResearchpeer-review

  7. Published

    Efficient Graph algorithms and Data Structures

    Holm, Jacob, 2018, Department of Computer Science, Faculty of Science, University of Copenhagen.

    Research output: Book/ReportPh.D. thesisResearch

  8. Published

    Dynamic planar embeddings of dynamic graphs

    Holm, Jacob & Rotenberg, E., Nov 2017, In: Theory of Computing Systems. 61, 4, p. 1054-1083 30 p.

    Research output: Contribution to journalJournal articleResearchpeer-review

  9. Published

    Dynamic bridge-finding in Õ(log2 n) amortized time

    Holm, Jacob, Rotenberg, E. & Thorup, Mikkel, 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 35-52 18 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  10. Published

    Decremental SPQR-trees for planar graphs

    Holm, Jacob, Italiano, G. F., Karczmarz, A., Łacki, J. & Rotenberg, E., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16 p. 46. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 112).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

ID: 143903170