On Range of Skill. - Thomas Dueholm Hansen; Peter Bro Miltersen; Troels Bjerre Sørensen (AAAI, 2008)

Approximability and Parameterized Complexity of Minmax Values. - Kristoffer Arnsfelt Hansen; Thomas Dueholm Hansen; Peter Bro Miltersen; Troels Bjerre Sørensen (WINE, 2008)

On Pure and (Approximate) Strong Equilibria of Facility Location Games. - Thomas Dueholm Hansen; Orestis Telelis (WINE, 2008)

Improved Bounds for Facility Location Games with Fair Cost Allocation. - Thomas Dueholm Hansen; Orestis Telelis (COCOA, 2009)

Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. - Thomas Dueholm Hansen; Uri Zwick (ISAAC (1), 2010)

On acyclicity of games with cycles. - Daniel Andersson; Vladimir Gurvich; Thomas Dueholm Hansen (Discret. Appl. Math., 2010)

A subexponential lower bound for the Random Facet algorithm for Parity Games. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (SODA, 2011)

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (STOC, 2011)

The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. - Thomas Dueholm Hansen; Rasmus Ibsen-Jensen (CiE, 2013)

A Faster Algorithm for Solving One-Clock Priced Timed Games. - Thomas Dueholm Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (CONCUR, 2013)

Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. - Thomas Dueholm Hansen; Peter Bro Miltersen; Uri Zwick (J. ACM, 2013)

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. - Thomas Dueholm Hansen; Haim Kaplan; Uri Zwick (SODA, 2014)

Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. - Thomas Dueholm Hansen; Mike Paterson; Uri Zwick (SODA, 2014)

Random-Facet and Random-Bland require subexponential time even for shortest paths. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (CoRR, 2014)

Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (CoRR, 2014)

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. - Thomas Dueholm Hansen; Uri Zwick (STOC, 2015)

Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. - Shiri Chechik; Thomas Dueholm Hansen; Giuseppe F. Italiano; Jakub Lacki; Nikos Parotsidis (FOCS, 2016)

Random-Edge Is Slower Than Random-Facet on Abstract Cubes. - Thomas Dueholm Hansen; Uri Zwick (ICALP, 2016)

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. - Amir Abboud; Thomas Dueholm Hansen; Virginia Vassilevska Williams; Ryan Williams 001 (STOC, 2016)

Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. - Karl Bringmann; Thomas Dueholm Hansen; Sebastian Krinninger (ICALP, 2017)

Decremental Data Structures for Connectivity and Dominators in Directed Graphs. - Loukas Georgiadis; Thomas Dueholm Hansen; Giuseppe F. Italiano; Sebastian Krinninger; Nikos Parotsidis (ICALP, 2017)

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. - Shiri Chechik; Thomas Dueholm Hansen; Giuseppe F. Italiano; Veronika Loitzenbauer; Nikos Parotsidis (SODA, 2017)

Hollow Heaps. - Thomas Dueholm Hansen; Haim Kaplan; Robert E. Tarjan; Uri Zwick (ACM Trans. Algorithms, 2017)

ARRIVAL: Next Stop in CLS. - Bernd Gärtner; Thomas Dueholm Hansen; Pavel Hubácek; Karel Král 002; Hagar Mosaad; Veronika Slívová (ICALP, 2018)

Subtree Isomorphism Revisited. - Amir Abboud; Arturs Backurs; Thomas Dueholm Hansen; Virginia Vassilevska Williams; Or Zamir (ACM Trans. Algorithms, 2018)

Faster k-SAT algorithms using biased-PPSZ. - Thomas Dueholm Hansen; Haim Kaplan; Or Zamir; Uri Zwick (STOC, 2019)