Thomas Dueholm Hansen
PhD student at the Center for the Theory of Interactive
Computation (CTIC), Department of
Computer Science, Aarhus University. My advisor is Peter Bro
Miltersen.
Email: tdh @ cs.au.dk
I was lecturing on the simplex algorithm and the Hirsch
conjecture at the MADALGO
& CTIC Summer School on High-dimensional Geometric Computing:
Lecture
1,
Lecture
2,
Lecture
3.
List of publications:
A faster algorithm for solving one-clock priced timed games
Thomas Dueholm Hansen,
Rasmus Ibsen-Jensen and
Peter Bro Miltersen
Manuscript, Online.
Subexponential lower bounds for randomized pivoting rules
for the simplex algorithm
Oliver Friedmann,
Thomas Dueholm Hansen and
Uri Zwick
STOC'11, co-winner of the Best Paper Award, Online
(Older version with full proofs,
slides).
A subexponential lower bound for the Random Facet algorithm
for Parity Games
Oliver Friedmann,
Thomas Dueholm Hansen and
Uri Zwick
SODA'11, Online
(Slides).
Strategy iteration is strongly polynomial for 2-player
turn-based stochastic games with a constant discount factor
Thomas Dueholm Hansen,
Peter Bro Miltersen and
Uri Zwick
ICS'11, Online
(Slides).
Lower bounds for Howard's algorithm for finding Minimum
Mean-Cost Cycles
Thomas Dueholm Hansen and
Uri Zwick
ISAAC'10, Online
(Slides).
On Acyclicity of Games with Cycles
Daniel Andersson,
Vladimir Gurvich and
Thomas Dueholm Hansen
Discrete Applied Mathematics, 158(10):1049-1063, 2010, Online (Slides).
Improved Bounds for Facility Location Games with Fair Cost Allocation
Thomas Dueholm Hansen and
Orestis A. Telelis
COCOA'09, Online.
Approximability and Parameterized Complexity of Minmax Values
Kristoffer Arnsfelt Hansen,
Thomas Dueholm Hansen,
Peter Bro Miltersen and
Troels Bjerre Sørensen
WINE'08, Online.
On Pure and (approximate) Strong Equilibria of Facility Location Games
Thomas Dueholm Hansen and
Orestis A. Telelis
WINE'08, Online (Slides).
On Range of Skill
Thomas Dueholm Hansen,
Peter Bro Miltersen and
Troels Bjerre Sørensen
AAAI'08, Online (Slides).