Thomas Dueholm Hansen

According to our database1, Thomas Dueholm Hansen authored at least 41 papers between 2008 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Subtree Isomorphism Revisited.
ACM Trans. Algorithms, 2018

ARRIVAL: Next Stop in CLS.
CoRR, 2018

ARRIVAL: Next Stop in CLS.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Hollow Heaps.
ACM Trans. Algorithms, 2017

Decremental Data Structures for Connectivity and Dominators in Directed Graphs.
CoRR, 2017

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs.
CoRR, 2017

Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs.
CoRR, 2017

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Decremental Data Structures for Connectivity and Dominators in Directed Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Subtree Isomorphism Revisited.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Random-Edge Is Slower Than Random-Facet on Abstract Cubes.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Hollow Heaps.
CoRR, 2015

Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made.
CoRR, 2015

Subtree Isomorphism Revisited.
CoRR, 2015

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Hollow Heaps.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games.
CoRR, 2014

Random-Facet and Random-Bland require subexponential time even for shortest paths.
CoRR, 2014

Improved upper bounds for Random-Edge and Random-Jump on abstract cubes.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor.
J. ACM, 2013

The complexity of interior point methods for solving discounted turn-based stochastic games
CoRR, 2013

A Faster Algorithm for Solving One-Clock Priced Timed Games.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
A Faster Algorithm for Solving One-Clock Priced Timed Games
CoRR, 2012

2011
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

A subexponential lower bound for the Random Facet algorithm for Parity Games.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor.
Proceedings of the Innovations in Computer Science, 2011

2010
On acyclicity of games with cycles.
Discrete Applied Mathematics, 2010

Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor
CoRR, 2010

Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Improved Bounds for Facility Location Games with Fair Cost Allocation.
Proceedings of the Combinatorial Optimization and Applications, 2009

On Acyclicity of Games with Cycles.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
On Pure and (approximate) Strong Equilibria of Facility Location Games
CoRR, 2008

Approximability and parameterized complexity of minmax values
CoRR, 2008

On Pure and (Approximate) Strong Equilibria of Facility Location Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Approximability and Parameterized Complexity of Minmax Values.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On Range of Skill.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008


  Loading...