Thomas Dueholm Hansen

570 total citations
21 papers, 187 citations indexed

About

Thomas Dueholm Hansen is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Economics and Econometrics. According to data from OpenAlex, Thomas Dueholm Hansen has authored 21 papers receiving a total of 187 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 9 papers in Artificial Intelligence and 5 papers in Economics and Econometrics. Recurrent topics in Thomas Dueholm Hansen's work include Complexity and Algorithms in Graphs (10 papers), Advanced Graph Theory Research (5 papers) and Artificial Intelligence in Games (4 papers). Thomas Dueholm Hansen is often cited by papers focused on Complexity and Algorithms in Graphs (10 papers), Advanced Graph Theory Research (5 papers) and Artificial Intelligence in Games (4 papers). Thomas Dueholm Hansen collaborates with scholars based in Denmark, Israel and United States. Thomas Dueholm Hansen's co-authors include Uri Zwick, Peter Bro Miltersen, Oliver Friedmann, Virginia Vassilevska Williams, Amir Abboud, Ryan Williams, Haim Kaplan, Shiri Chechik, Vladimir Gurvich and Nikos Parotsidis and has published in prestigious journals such as Journal of the ACM, Discrete Applied Mathematics and ACM Transactions on Algorithms.

In The Last Decade

Thomas Dueholm Hansen

19 papers receiving 176 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thomas Dueholm Hansen Denmark 7 108 94 40 22 18 21 187
Tasuku Soma Japan 7 100 0.9× 62 0.7× 62 1.6× 21 1.0× 20 1.1× 15 169
Anand Louis United States 7 66 0.6× 97 1.0× 24 0.6× 4 0.2× 15 0.8× 15 197
John H. Lindsey United States 10 78 0.7× 59 0.6× 22 0.6× 17 0.8× 3 0.2× 26 307
Virginia Vassilevska United States 8 120 1.1× 46 0.5× 78 1.9× 6 0.3× 5 0.3× 13 186
Arnab Bhattacharyya United States 9 160 1.5× 130 1.4× 56 1.4× 4 0.2× 3 0.2× 34 220
Loïc Pottier United States 9 61 0.6× 69 0.7× 49 1.2× 6 0.3× 5 0.3× 24 169
Dimitris J. Kavvadias Greece 8 136 1.3× 186 2.0× 64 1.6× 18 0.8× 17 286
Luděk Kučera Czechia 8 177 1.6× 102 1.1× 75 1.9× 17 0.8× 2 0.1× 35 303
Robin A. Moser Switzerland 4 191 1.8× 78 0.8× 55 1.4× 9 0.4× 5 259

Countries citing papers authored by Thomas Dueholm Hansen

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Hansen, Thomas Dueholm, et al.. (2019). Faster k -SAT algorithms using biased-PPSZ. Research at the University of Copenhagen (University of Copenhagen). 578–589. 14 indexed citations
2.
Gärtner, Bernd, et al.. (2018). ARRIVAL: Next Stop in CLS. arXiv (Cornell University).
3.
Abboud, Amir, et al.. (2018). Subtree Isomorphism Revisited. ACM Transactions on Algorithms. 14(3). 1–23. 5 indexed citations
4.
Chechik, Shiri, et al.. (2017). Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs. arXiv (Cornell University). 1900–1918. 4 indexed citations
5.
Bringmann, Karl, Thomas Dueholm Hansen, & Sebastian Krinninger. (2017). Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
6.
Hansen, Thomas Dueholm, Haim Kaplan, Robert E. Tarjan, & Uri Zwick. (2017). Hollow Heaps. ACM Transactions on Algorithms. 13(3). 1–27. 5 indexed citations
7.
Chechik, Shiri, et al.. (2017). Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. 1900–1918. 4 indexed citations
8.
Chechik, Shiri, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Łącki, & Nikos Parotsidis. (2016). Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. Cineca Institutional Research Information System (Tor Vergata University). 28. 315–324. 5 indexed citations
9.
Abboud, Amir, Thomas Dueholm Hansen, Virginia Vassilevska Williams, & Ryan Williams. (2016). Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. 375–388. 23 indexed citations
10.
Abboud, Amir, et al.. (2015). Subtree Isomorphism Revisited. 1256–1271. 3 indexed citations
11.
Hansen, Thomas Dueholm & Uri Zwick. (2015). An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. 209–218. 14 indexed citations
12.
Hansen, Thomas Dueholm, Mike Paterson, & Uri Zwick. (2014). Improved upper bounds for random-edge and random-jump on abstract cubes. Symposium on Discrete Algorithms. 874–881. 4 indexed citations
13.
Hansen, Thomas Dueholm, Haim Kaplan, & Uri Zwick. (2013). Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. 847–860. 1 indexed citations
14.
Hansen, Thomas Dueholm, Peter Bro Miltersen, & Uri Zwick. (2013). Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. Journal of the ACM. 60(1). 1–16. 58 indexed citations
15.
Hansen, Thomas Dueholm, Mike Paterson, & Uri Zwick. (2013). Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. 874–881. 2 indexed citations
16.
Friedmann, Oliver, Thomas Dueholm Hansen, & Uri Zwick. (2011). Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. 283–292. 26 indexed citations
17.
Friedmann, Oliver, Thomas Dueholm Hansen, & Uri Zwick. (2011). A subexponential lower bound for the Random Facet algorithm for Parity Games. 202–216. 3 indexed citations
18.
Andersson, Daniel, Vladimir Gurvich, & Thomas Dueholm Hansen. (2010). On acyclicity of games with cycles. Discrete Applied Mathematics. 158(10). 1049–1063. 8 indexed citations
19.
Hansen, Thomas Dueholm, Peter Bro Miltersen, & Uri Zwick. (2010). Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. arXiv (Cornell University). 253–263. 6 indexed citations
20.
Hansen, Thomas Dueholm, Peter Bro Miltersen, & Troels Bjerre Sørensen. (2008). On range of skill. National Conference on Artificial Intelligence. 277–282. 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

Breakdown of academic impact, for papers by Tasuku Soma Breakdown of academic impact, for papers by Anand Louis Breakdown of academic impact, for papers by John H. Lindsey Breakdown of academic impact, for papers by Virginia Vassilevska Breakdown of academic impact, for papers by Arnab Bhattacharyya Breakdown of academic impact, for papers by Loïc Pottier Breakdown of academic impact, for papers by Dimitris J. Kavvadias Breakdown of academic impact, for papers by Luděk Kučera Breakdown of academic impact, for papers by Robin A. Moser
Rankless by CCL
2026