Jacob Holm
Tenure Track Assistant Professor, Ekstern
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
Department of English, Germanic and Romance Studies
Emil Holms Kanal 6
2300 København S
- 2024
- Published
Adaptive Out-Orientations with Applications
Chekuri, C., Christiansen, A. B., Holm, Jacob, van der Hoog, I., Quanrud, K., Rotenberg, E. & Schwiegelshohn, C., 2024, p. 3062-3088. 27 p.Research output: Contribution to conference › Paper › Research › peer-review
- 2023
- 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-4408Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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-331Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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
- 2022
- 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
- 2021
- 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
- 2020
- 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-896Research output: Contribution to journal › Journal article › Research › peer-review
- 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
- 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-180Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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-2397Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- 2019
- 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
- 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. 8948658Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2018
- Published
One-wasy trail orientation
Aamand, Anders, Hjuler, N., Holm, Jacob & Rotenberg, E., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 13 p. 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 107).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Online Bipartite Matching with Amortized Replacements
Bernstein, A., Holm, Jacob & Rotenberg, E., 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 947-959Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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 proceeding › Article in proceedings › Research › peer-review
- 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
- 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
- 2017
- Published
Best laid plans of lions and men
Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 6. (Leibniz International Proceedings in Informatics, Vol. 77).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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 proceeding › Article in proceedings › Research › peer-review
- 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
- 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 journal › Journal article › Research › peer-review
- 2015
- 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
- 2000
- 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 proceeding › Article in proceedings › Research › peer-review
ID: 143903170
Most downloads
-
121
downloads
Best laid plans of lions and men
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
84
downloads
Decremental SPQR-trees for planar graphs
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
68
downloads
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published