| 2019 | STOC | Faster | Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick |
| 2018 | ICALP | ARRIVAL: Next Stop in CLS. | Bernd Grtner, Thomas Dueholm Hansen, Pavel Hubcek, Karel Krl, Hagar Mosaad, Veronika Slvov |
| 2017 | ICALP | Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. | Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger |
| 2017 | ICALP | Decremental Data Structures for Connectivity and Dominators in Directed Graphs. | Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis |
| 2017 | SODA | Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. | Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis |
| 2016 | FOCS | 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 |
| 2016 | ICALP | Random-Edge Is Slower Than Random-Facet on Abstract Cubes. | Thomas Dueholm Hansen, Uri Zwick |
| 2016 | SODA | Subtree Isomorphism Revisited. | Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir |
| 2016 | STOC | 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 |
| 2015 | ICALP | Hollow Heaps. | Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick |
| 2015 | STOC | An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. | Thomas Dueholm Hansen, Uri Zwick |
| 2014 | SODA | Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. | Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick |
| 2014 | SODA | Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. | Thomas Dueholm Hansen, Mike Paterson, Uri Zwick |
| 2013 | CiE | The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. | Thomas Dueholm Hansen, Rasmus Ibsen-Jensen |
| 2013 | CONCUR | A Faster Algorithm for Solving One-Clock Priced Timed Games. | Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |
| 2011 | SODA | A subexponential lower bound for the Random Facet algorithm for Parity Games. | Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick |
| 2011 | STOC | Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. | Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick |
| 2010 | ISAAC | Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. | Thomas Dueholm Hansen, Uri Zwick |
| 2009 | AAIM | On Acyclicity of Games with Cycles. | Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen |
| 2009 | COCOA | Improved Bounds for Facility Location Games with Fair Cost Allocation. | Thomas Dueholm Hansen, Orestis Telelis |
| 2008 | AAAI | On Range of Skill. | Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |