Torben Hagerup
- Artificial Intelligence top 2%
- Computational Theory and Mathematics top 0.5%
- Computer Networks and Communications top 2%
- Hardware and Architecture top 5%
- Computer Graphics and Computer-Aided Design top 2%
- Co-authors
- Christine RübJyrki KatajainenMartin DietzfelbingerMartti PenttonenSusanne AlbersKurt MehlhornHans L. BodlaenderRajeev Raman
- Topics
- Algorithms and Data Compression (30 papers)Complexity and Algorithms in Graphs (25 papers)Advanced Graph Theory Research (15 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignComputational Theory and MathematicsHardware and Architecture
- Partner nations
- GermanyUnited StatesDenmark
In The Last Decade
Torben Hagerup
63 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 63
- Artificial Intelligence 636
- Computational Theory and Mathematics 627
- Computer Networks and Communications 502
- Hardware and Architecture 220
- Computer Graphics and Computer-Aided Design 163
Countries citing papers authored by Torben Hagerup
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 5 | |
| 2 | 2 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | On the parameterized complexity of the generalized rush hour puzzle. | 6 |
| 6 | 2 | |
| 7 | Fast deterministic construction of static dictionaries | 7 |
| 8 | 6 | |
| 9 | 19 | |
| 10 | 32 | |
| 11 | 113 | |
| 12 | 1 | |
| 13 | 28 | |
| 14 | 1 | |
| 15 | Generalized topological sorting in linear time | 2 |
| 16 | 24 | |
| 17 | Improved parallel integer sorting without concurrent writing | 17 |
| 18 | 30 | |
| 19 | 18 | |
| 20 | Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract) | 1 |
About Torben Hagerup
Torben Hagerup is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Hardware and Architecture, having authored 65 papers that have together received 1.3k indexed citations. Recurring topics across this work include Algorithms and Data Compression (30 papers), Complexity and Algorithms in Graphs (25 papers) and Advanced Graph Theory Research (15 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (163 citations), Computational Theory and Mathematics (627 citations) and Hardware and Architecture (220 citations). Torben Hagerup has collaborated with scholars based in Germany, United States and Denmark. Frequent 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. Their work appears in journals such as SIAM Journal on Computing, Future Generation Computer Systems and Theoretical Computer Science.
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.