Thomas Dueholm Hansen

Most-cited papers

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
2010JACM187 citations Open access
Semantic Scholar
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
2015Symposium on the Theory of Computing130 citations Open access
Semantic Scholar
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2011Symposium on the Theory of Computing97 citations
Semantic Scholar
Subtree Isomorphism Revisited
Amir Abboud, A. Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams +1 more
2015ACM-SIAM Symposium on Discrete Algorithms53 citations Open access
Semantic Scholar
Faster k-SAT algorithms using biased-PPSZ
Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick
2019Symposium on the Theory of Computing51 citations
Semantic Scholar
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
Thomas Dueholm Hansen, Uri Zwick
2015Symposium on the Theory of Computing42 citations
Semantic Scholar
Approximability and Parameterized Complexity of Minmax Values
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, T. Lund
2008Workshop on Internet and Network Economics32 citations Open access
Semantic Scholar
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time
S. Chechik, Thomas Dueholm Hansen, G. Italiano, J. Lacki +1 more
2016IEEE Annual Symposium on Foundations of Computer Science29 citations
Semantic Scholar
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
S. Chechik, Thomas Dueholm Hansen, G. Italiano, Veronika Loitzenbauer +1 more
2017ACM-SIAM Symposium on Discrete Algorithms28 citations
Semantic Scholar
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Thomas Dueholm Hansen, Uri Zwick
2010International Symposium on Algorithms and Computation27 citations
Semantic Scholar
ARRIVAL: Next Stop in CLS
Bernd Gärtner, Thomas Dueholm Hansen, P. Hubáček, Karel Král +2 more
2018International Colloquium on Automata, Languages and Programming25 citations
Semantic Scholar
On acyclicity of games with cycles
Daniel Andersson, V. Gurvich, Thomas Dueholm Hansen
2009Discrete Applied Mathematics25 citations Open access
Semantic Scholar
Hollow Heaps
Thomas Dueholm Hansen, Haim Kaplan, R. Tarjan, Uri Zwick
2015International Colloquium on Automata, Languages and Programming24 citations
Semantic Scholar
A Faster Algorithm for Solving One-Clock Priced Timed Games
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
2012International Conference on Concurrency Theory22 citations Open access
Semantic Scholar
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2014arXiv.org21 citations
Semantic Scholar
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes
Thomas Dueholm Hansen, M. Paterson, Uri Zwick
2014ACM-SIAM Symposium on Discrete Algorithms15 citations
Semantic Scholar
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles
Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick
2014ACM-SIAM Symposium on Discrete Algorithms15 citations
Semantic Scholar
Decremental Data Structures for Connectivity and Dominators in Directed Graphs
Loukas Georgiadis, Thomas Dueholm Hansen, G. Italiano, Sebastian Krinninger +1 more
2017International Colloquium on Automata, Languages and Programming12 citations Open access
Semantic Scholar
The complexity of interior point methods for solving discounted turn-based stochastic games
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen
2013Conference on Computability in Europe12 citations Open access
Semantic Scholar
Random-Edge Is Slower Than Random-Facet on Abstract Cubes
Thomas Dueholm Hansen, Uri Zwick
2016International Colloquium on Automata, Languages and Programming9 citations
Semantic Scholar
On Pure and (Approximate) Strong Equilibria of Facility Location Games
Thomas Dueholm Hansen, Orestis Telelis
2008Workshop on Internet and Network Economics9 citations Open access
Semantic Scholar
Improved Bounds for Facility Location Games with Fair Cost Allocation
Thomas Dueholm Hansen, Orestis Telelis
2009International Conference on Combinatorial Optimization and Applications8 citations
Semantic Scholar
Random-Facet and Random-Bland require subexponential time even for shortest paths
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2014arXiv.org7 citations
Semantic Scholar
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
K. Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger
2017International Colloquium on Automata, Languages and Programming6 citations
Semantic Scholar
On Range of Skill
Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
2008AAAI Conference on Artificial Intelligence6 citations
Semantic Scholar
A subexponential lower bound for the random facet algorithm for parity games
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
2011ACM-SIAM Symposium on Discrete Algorithms4 citations
Semantic Scholar
An improved randomized algorithm for finding sinks of Acyclic Unique Sink Orientations of the binary hypercube
Thomas Dueholm Hansen, Uri Zwick
20260 citations
Semantic Scholar
Lecture notes for \Analysis of Algorithms": Markov decision processes
Thomas Dueholm Hansen
20130 citations
Semantic Scholar