Jacob Holm

Jacob Holm is a Tenure Track Assistant Professor in the Department of Computer Science at the University of Copenhagen, specializing in the Algorithms and Complexity research section. His work focuses on theoretical computer science with emphasis on graph algorithms and data structures.

Dr. Holm's research interests span multiple areas of theoretical computer science:

• Dynamic graph algorithms, particularly for planar graphs
• Biconnectivity and triconnectivity in dynamic settings
• Efficient data structures for graph problems
• Parallel and distributed algorithms for graph processing
• Computational geometry and pursuit-evasion problems

His publication record shows 25 research outputs including 17 article in proceedings, 6 journal articles, 1 book chapter, and 1 Ph.D. thesis. His work demonstrates consistent contributions to theoretical computer science, with numerous publications in top venues like the ACM-SIAM Symposium on Discrete Algorithms (SODA). Analysis of his recent publications reveals a strong focus on worst-case performance guarantees for dynamic graph problems, particularly in planar graph settings where maintaining efficiency during updates presents significant theoretical challenges.

Dr. Holm maintains an active research profile with an ORCID identifier (0000-0001-6997-9251) and collaborates extensively with researchers in the theoretical computer science community, particularly with Eva Rotenberg as evidenced by multiple co-authored publications. His work bridges theoretical computer science with practical applications, developing algorithms that maintain efficiency even as graphs dynamically change.