Thomas Dueholm Hansen
- Computational Theory and Mathematics top 5%
- Artificial Intelligence top 10%
- Computer Networks and Communications
- Management Science and Operations Research
- Computational Mathematics top 5%
- Co-authors
- Uri ZwickPeter Bro MiltersenOliver FriedmannAmir AbboudVirginia Vassilevska WilliamsRyan WilliamsHaim KaplanNikos Parotsidis
- Topics
- Complexity and Algorithms in Graphs (10 papers)Advanced Graph Theory Research (5 papers)Artificial Intelligence in Games (4 papers)
- Partner nations
- DenmarkIsraelUnited States
In The Last Decade
Thomas Dueholm Hansen
19 papers receiving 176 citations
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 108
- Artificial Intelligence 94
- Computer Networks and Communications 40
- Management Science and Operations Research 22
- Computational Mathematics 18
Countries citing papers authored by Thomas Dueholm Hansen
This map shows the geographic impact of Thomas Dueholm Hansen'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 Thomas Dueholm Hansen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Dueholm Hansen more than expected).
Fields of papers citing papers by Thomas Dueholm Hansen
This network shows the impact of papers produced by Thomas Dueholm Hansen. 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 Thomas Dueholm Hansen. The network helps show where Thomas Dueholm Hansen may publish in the future.
Co-authorship network of co-authors of Thomas Dueholm Hansen
This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Dueholm Hansen. A scholar is included among the top collaborators of Thomas Dueholm Hansen 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 Thomas Dueholm Hansen. Thomas Dueholm Hansen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 14 | |
| 2 | ARRIVAL: Next Stop in CLS | 0 |
| 3 | 5 | |
| 4 | 4 | |
| 5 | 1 | |
| 6 | 5 | |
| 7 | 4 | |
| 8 | 5 | |
| 9 | 23 | |
| 10 | 3 | |
| 11 | 14 | |
| 12 | 4 | |
| 13 | 1 | |
| 14 | 58 | |
| 15 | 2 | |
| 16 | 3 | |
| 17 | 26 | |
| 18 | 8 | |
| 19 | 6 | |
| 20 | On range of skill | 1 |
About Thomas Dueholm Hansen
Thomas Dueholm Hansen is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Artificial Intelligence, having authored 21 papers that have together received 187 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (10 papers), Advanced Graph Theory Research (5 papers) and Artificial Intelligence in Games (4 papers). The work is most often cited by research in Computational Mathematics (18 citations), Computational Theory and Mathematics (108 citations) and Artificial Intelligence (94 citations). Thomas Dueholm Hansen has collaborated with scholars based in Denmark, Israel and United States. Frequent co-authors include Uri Zwick, Peter Bro Miltersen, Oliver Friedmann, Amir Abboud, Virginia Vassilevska Williams, Ryan Williams, Haim Kaplan, Nikos Parotsidis, Giuseppe F. Italiano and Vladimir Gurvich. Their work appears in journals such as Journal of the ACM, Discrete Applied Mathematics and ACM Transactions on Algorithms.
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.