Torben Hagerup

3.1k total citations
65 papers, 1.3k citations indexed

About

Torben Hagerup is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Torben Hagerup has authored 65 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computational Theory and Mathematics, 35 papers in Artificial Intelligence and 16 papers in Computer Networks and Communications. Recurrent topics in Torben Hagerup's work include Algorithms and Data Compression (30 papers), Complexity and Algorithms in Graphs (25 papers) and Advanced Graph Theory Research (15 papers). Torben Hagerup is often cited by papers focused on Algorithms and Data Compression (30 papers), Complexity and Algorithms in Graphs (25 papers) and Advanced Graph Theory Research (15 papers). Torben Hagerup collaborates with scholars based in Germany, United States and Denmark. Torben Hagerup's co-authors include Christine Rüb, Jyrki Katajainen, Martin Dietzfelbinger, Martti Penttonen, Susanne Albers, Kurt Mehlhorn, Hans L. Bodlaender, Rajeev Raman, Joseph Cheriyan and Tomasz Radzik and has published in prestigious journals such as SIAM Journal on Computing, Future Generation Computer Systems and Theoretical Computer Science.

In The Last Decade

Torben Hagerup

63 papers receiving 1.1k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Torben Hagerup Germany 19 636 627 502 220 163 65 1.3k
Lawrence L. Larmore United States 18 451 0.7× 345 0.6× 541 1.1× 116 0.5× 60 0.4× 121 1.2k
Michael Rodeh Israel 21 738 1.2× 724 1.2× 819 1.6× 402 1.8× 50 0.3× 46 1.8k
Francis Zane United States 12 349 0.5× 741 1.2× 536 1.1× 219 1.0× 62 0.4× 21 1.2k
Venkatesh Raman India 22 970 1.5× 1.0k 1.7× 639 1.3× 201 0.9× 114 0.7× 111 1.9k
Yossi Shiloach Israel 18 441 0.7× 998 1.6× 773 1.5× 269 1.2× 189 1.2× 28 1.7k
Srinivasa Rao Satti South Korea 19 924 1.5× 603 1.0× 749 1.5× 283 1.3× 84 0.5× 70 1.6k
Derick Wood Canada 21 927 1.5× 725 1.2× 401 0.8× 96 0.4× 355 2.2× 152 1.7k
Virginia Vassilevska Williams United States 18 472 0.7× 853 1.4× 403 0.8× 90 0.4× 87 0.5× 71 1.3k
Paul Beame United States 27 1.5k 2.4× 1.8k 2.9× 683 1.4× 157 0.7× 94 0.6× 107 2.6k
Konstantin Makarychev United States 18 349 0.5× 553 0.9× 427 0.9× 51 0.2× 78 0.5× 68 1.2k

Countries citing papers authored by Torben Hagerup

Since Specialization
Citations

This map shows the geographic impact of Torben Hagerup'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 Torben Hagerup with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Torben Hagerup more than expected).

Fields of papers citing papers by Torben Hagerup

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Torben Hagerup. 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 Torben Hagerup. The network helps show where Torben Hagerup may publish in the future.

Co-authorship network of co-authors of Torben Hagerup

This figure shows the co-authorship network connecting the top 25 collaborators of Torben Hagerup. A scholar is included among the top collaborators of Torben Hagerup 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 Torben Hagerup. Torben Hagerup is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hagerup, Torben, et al.. (2018). Space-efficient Euler partition and bipartite edge coloring. Theoretical Computer Science. 754. 16–34. 5 indexed citations
2.
Hagerup, Torben & Frank Kammer. (2017). On-the-Fly Array Initialization in Less Space. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 92. 12. 2 indexed citations
3.
Hagerup, Torben, et al.. (2011). Finding the maximum suffix with fewer comparisons. Journal of Discrete Algorithms. 9(3). 279–286. 1 indexed citations
4.
Hagerup, Torben. (2010). A strengthened analysis of an algorithm for Dominating Set in planar graphs. Discrete Applied Mathematics. 160(6). 793–798. 1 indexed citations
5.
Fernau, Henning, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, & Klaus Reinhardt. (2003). On the parameterized complexity of the generalized rush hour puzzle.. OPUS (Augsburg University). 6–9. 6 indexed citations
6.
Hagerup, Torben. (2000). Parallel Preprocessing for Path Queries without Concurrent Reading. Information and Computation. 158(1). 18–28. 2 indexed citations
7.
Hagerup, Torben. (1999). Fast deterministic construction of static dictionaries. OPUS (Augsburg University). 414–418. 7 indexed citations
8.
Diks, Krzysztof & Torben Hagerup. (1998). More general parallel tree contraction: Register allocation and broadcasting in a tree. Theoretical Computer Science. 203(1). 3–29. 6 indexed citations
9.
Hagerup, Torben, Jyrki Katajainen, Naomi Nishimura, & Prabhakar Ragde. (1998). Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. Journal of Computer and System Sciences. 57(3). 366–375. 19 indexed citations
10.
Albers, Susanne & Torben Hagerup. (1997). Improved Parallel Integer Sorting without Concurrent Writing. Information and Computation. 136(1). 25–51. 32 indexed citations
11.
Dietzfelbinger, Martin, Torben Hagerup, Jyrki Katajainen, & Martti Penttonen. (1997). A Reliable Randomized Algorithm for the Closest-Pair Problem. Journal of Algorithms. 25(1). 19–51. 113 indexed citations
12.
Hagerup, Torben. (1996). Allocating Independent Tasks to Parallel Processors: An Experimental Study. Journal of Parallel and Distributed Computing. 47(2). 1–197. 1 indexed citations
13.
Bast, Hannah & Torben Hagerup. (1995). Fast Parallel Space Allocation, Estimation, and Integer Sorting. Information and Computation. 123(1). 72–110. 28 indexed citations
14.
Hagerup, Torben. (1995). A Lower-Bound for the Emulation of PRAM Memories on Processor Networks. Information and Computation. 119(1). 124–128. 1 indexed citations
15.
Hagerup, Torben, et al.. (1994). Generalized topological sorting in linear time. MPG.PuRe (Max Planck Society). 1(1). 38–49. 2 indexed citations
16.
Hagerup, Torben. (1993). Fast deterministic processor allocation. Symposium on Discrete Algorithms. 18(3). 1–10. 24 indexed citations
17.
Albers, Susanne & Torben Hagerup. (1992). Improved parallel integer sorting without concurrent writing. Max Planck Institute for Plasma Physics. 463–472. 17 indexed citations
18.
Hagerup, Torben & Rajeev Raman. (1992). Waste makes haste: tight bounds for loose parallel sorting. OPUS (Augsburg University). 628–637. 30 indexed citations
19.
Hagerup, Torben. (1990). Optimal parallel algorithms on planar graphs. Information and Computation. 84(1). 71–96. 18 indexed citations
20.
Diks, Krzysztof, Torben Hagerup, & Wojciech Rytter. (1989). Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). 207–217. 1 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

Rankless by CCL
2026