Jacob Holm

Jacob Holm

Tenure Track Assistant Professor, Ekstern

ORCID: 0000-0001-6997-9251

Publication year:
All
1 - 10 out of 23Page size: 10
Sort by: 1st author
  1. Published

    Splay Top Trees

    Holm, Jacob, Rotenberg, E. & Ryhl, A., 2023, Symposium on Simplicity in Algorithms (SOSA). Kavitha, T. & Mehlhorn, K. (eds.). Society for Industrial and Applied Mathematics, p. 305-331

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  2. 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 proceeding › Article in proceedings › Research › peer-review

  3. 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 proceeding › Article in proceedings › Research › peer-review

  4. Published

    Random k-out subgraph leaves only O(n/k) inter-component edges

    Holm, Jacob, King, V., Thorup, Mikkel, Zamir, O. & Zwick, U., 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE, 14 p. 8948658

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  5. Published

    Planar reachability in linear space and constant time

    Holm, Jacob, Rotenberg, E. & Thorup, Mikkel, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 370-389 20 p. (Symposium on Foundations of Computer Science. Annual Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  6. Published

    Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings

    Holm, Jacob, van der Hoog, I. & Rotenberg, E., 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 18 p. 40. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 258).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  7. 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 proceeding › Article in proceedings › Research › peer-review

  8. 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 proceeding › Article in proceedings › Research › peer-review

  9. Published

    Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity

    Holm, Jacob & Rotenberg, E., 2020, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Chawla, S. (ed.). Society for Industrial and Applied Mathematics, p. 2378-2397

    Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review

  10. Published

    Contracting a planar graph efficiently

    Holm, Jacob, Italiano, G. F., Karczmarz, A., Łacki, J., Rotenberg, E. & Sankowski, P., 1 Sep 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 p. 50. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 87).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Previous 1 2 3 Next

ID: 143903170