Thomas Dueholm Hansen

According to our database, Thomas Dueholm Hansen authored at least 26 papers between 2008 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

Faster <i>k</i>-SAT algorithms using biased-PPSZ.

Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Subtree Isomorphism Revisited.

Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir

ACM Trans. Algorithms, 2018

ARRIVAL: Next Stop in CLS.

Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Hollow Heaps.

Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick

ACM Trans. Algorithms, 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

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Decremental Data Structures for Connectivity and Dominators in Directed Graphs.

Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis

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.

Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger

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.

Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Random-Edge Is Slower Than Random-Facet on Abstract Cubes.

Thomas Dueholm Hansen, Uri Zwick

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.

Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm.

Thomas Dueholm Hansen, Uri Zwick

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014

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

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick

CoRR, 2014

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

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick

CoRR, 2014

Improved upper bounds for Random-Edge and Random-Jump on abstract cubes.

Thomas Dueholm Hansen, Mike Paterson, Uri Zwick

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.

Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick

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.

Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick

J. ACM, 2013

A Faster Algorithm for Solving One-Clock Priced Timed Games.

Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games.

Thomas Dueholm Hansen, Rasmus Ibsen-Jensen

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2011

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm.

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

A subexponential lower bound for the Random Facet algorithm for Parity Games.

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

On acyclicity of games with cycles.

Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen

Discret. Appl. Math., 2010

Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles.

Thomas Dueholm Hansen, Uri Zwick

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Improved Bounds for Facility Location Games with Fair Cost Allocation.

Thomas Dueholm Hansen, Orestis Telelis

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

On Pure and (Approximate) Strong Equilibria of Facility Location Games.

Thomas Dueholm Hansen, Orestis Telelis

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Approximability and Parameterized Complexity of Minmax Values.

Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On Range of Skill.

Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008