Jacob Holm

Jacob Holm

Tenure Track Assistant Professor, Ekstern

ORCID: 0000-0001-6997-9251

Publication year:
All
11 - 20 out of 23Page size: 10
  1. 2018
  2. Published

    Efficient Graph algorithms and Data Structures

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

    Research output: Book/Report › Ph.D. thesis › Research

  3. 2019
  4. Published

    Online Bipartite Matching with Amortized O(log2 n) Replacements

    Bernstein, A., Holm, Jacob & Rotenberg, E., 2019, In: Journal of the ACM. 66, 5, 23 p., 37.

    Research output: Contribution to journal › Journal article › Research › peer-review

  5. 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

  6. 2020
  7. 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 journal › Journal article › Research › peer-review

  8. Published

    Near-optimal induced universal graphs for cycles and paths

    Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2020, In: Discrete Applied Mathematics. 282, p. 1-13 13 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  9. 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

  10. 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

  11. 2021
  12. 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

  13. 2022
  14. Published

    On Dynamic α+ 1 Arboricity Decomposition and Out-Orientation

    Christiansen, A. B. G., Holm, Jacob, Rotenberg, E. & Thomassen, C., 2022, 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022. Szeider, S., Ganian, R. & Silva, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-15 34. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 241).

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

  15. 2023
  16. 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

Previous 1 2 3 Next

ID: 143903170