Jacob Holm

1.1k total citations
20 papers, 383 citations indexed

About

Jacob Holm is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Jacob Holm has authored 20 papers receiving a total of 383 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 6 papers in Artificial Intelligence. Recurrent topics in Jacob Holm's work include Complexity and Algorithms in Graphs (11 papers), Advanced Graph Theory Research (9 papers) and Interconnection Networks and Systems (6 papers). Jacob Holm is often cited by papers focused on Complexity and Algorithms in Graphs (11 papers), Advanced Graph Theory Research (9 papers) and Interconnection Networks and Systems (6 papers). Jacob Holm collaborates with scholars based in Denmark, Austria and United States. Jacob Holm's co-authors include Mikkel Thorup, Kristian de Lichtenberg, Stephen Alstrup, Michael Kühl, Daniel Wangpraseurt, David J. Suggett, Peter J. Ralph, Mathieu Pernice, Anthony W. D. Larkum and Steven L. Jacques and has published in prestigious journals such as Frontiers in Microbiology, Journal of the ACM and Journal of The Royal Society Interface.

In The Last Decade

Jacob Holm

13 papers receiving 362 citations

Peers

Jacob Holm

CTM

CNC

CVPR

ECOLO

Anand Srivastav Germany

Marcin Mucha Poland

Lorenzo Orecchia United States

A. J. Field United Kingdom

Filip Blagojević United States

Angelo Monti Italy

Jens Gustedt France

Prasoon Tiwari United States

Mats Carlsson Sweden

Christian Tenllado Spain

Anand Srivastav Germany

Jacob Holm

114 ×0.6

CTM

60 ×0.4

CNC

73 ×0.7

46 ×0.9

CVPR

15 ×0.3

ECOLO

Citations per year, relative to Jacob Holm Jacob Holm (= 1×) peers Anand Srivastav

Countries citing papers authored by Jacob Holm

Since Specialization

Citations

This map shows the geographic impact of Jacob Holm's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jacob Holm with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jacob Holm more than expected).

Fields of papers citing papers by Jacob Holm

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jacob Holm. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jacob Holm. The network helps show where Jacob Holm may publish in the future.

Co-authorship network of co-authors of Jacob Holm

This figure shows the co-authorship network connecting the top 25 collaborators of Jacob Holm. A scholar is included among the top collaborators of Jacob Holm based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jacob Holm. Jacob Holm is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Holm, Jacob, et al.. (2024). Good r-divisions Imply Optimal Amortized Decremental Biconnectivity. Theory of Computing Systems. 68(4). 1014–1048.

Holm, Jacob, et al.. (2023). Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Holm, Jacob, et al.. (2021). Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. Research at the University of Copenhagen (University of Copenhagen).

Holm, Jacob, et al.. (2020). Escaping an Infinitude of Lions. American Mathematical Monthly. 127(10). 880–896. 2 indexed citations

Wangpraseurt, Daniel, et al.. (2019). Microscale light management and inherent optical properties of intact corals studied with optical coherence tomography. Journal of The Royal Society Interface. 16(151). 20180567–20180567. 21 indexed citations

Alstrup, Stephen, et al.. (2019). Near-optimal induced universal graphs for cycles and paths. Discrete Applied Mathematics. 282. 1–13.

Holm, Jacob, et al.. (2019). Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. Research at the University of Copenhagen (University of Copenhagen). 896–909. 1 indexed citations

Bernstein, Aaron, et al.. (2019). Online Bipartite Matching with Amortized O (log ² n ) Replacements. Journal of the ACM. 66(5). 1–23. 4 indexed citations

Holm, Jacob, et al.. (2018). One-Way Trail Orientations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

10.

Wangpraseurt, Daniel, Jacob Holm, Anthony W. D. Larkum, et al.. (2017). In vivo Microscale Measurements of Light and Photosynthesis during Coral Bleaching: Evidence for the Optical Feedback Loop?. Frontiers in Microbiology. 8. 59–59. 43 indexed citations

11.

Holm, Jacob, et al.. (2017). Best Laid Plans of Lions and Men. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 1 indexed citations

12.

Alstrup, Stephen, et al.. (2017). Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

13.

Holm, Jacob, et al.. (2017). Dynamic Planar Embeddings of Dynamic Graphs. Theory of Computing Systems. 61(4). 1054–1083.

14.

Holm, Jacob, et al.. (2015). Planar Reachability in Linear Space and Constant Time. Research at the University of Copenhagen (University of Copenhagen). 370–389. 3 indexed citations

15.

Alstrup, Stephen, Jacob Holm, Kristian de Lichtenberg, & Mikkel Thorup. (2005). Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms. 1(2). 243–264. 49 indexed citations

16.

Holm, Jacob, Kristian de Lichtenberg, & Mikkel Thorup. (2001). Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM. 48(4). 723–760. 207 indexed citations

17.

Alstrup, Stephen, Jacob Holm, Kristian de Lichtenberg, & Mikkel Thorup. (1998). Direct Routing on Trees (Extended Abstract).. Symposium on Discrete Algorithms. 342–349. 1 indexed citations

18.

Alstrup, Stephen, Jacob Holm, Kristian de Lichtenberg, & Mikkel Thorup. (1998). Direct routing on trees. Symposium on Discrete Algorithms. 342–349. 8 indexed citations

19.

Holm, Jacob, Kristian de Lichtenberg, & Mikkel Thorup. (1998). Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. 79–89. 37 indexed citations

20.

Holm, Jacob, Kristian de Lichtenberg, & Mikkel Thorup. (1997). Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree. Research at the University of Copenhagen (University of Copenhagen). 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact