Thomas Dueholm Hansen

Publication Activity (10 Years)

Years Active: 2008-2019
Publications (10 Years): 15

Top Topics

Strongly Connected

Top Venues

Publications

Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick
-SAT algorithms using biased-PPSZ. STOC (2019)
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová
ARRIVAL: Next Stop in CLS. ICALP (2018)
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová
ARRIVAL: Next Stop in CLS. CoRR (2018)
Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
Subtree Isomorphism Revisited. ACM Trans. Algorithms 14 (3) (2018)
Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. ICALP (2017)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR (2017)
Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Hollow Heaps. ACM Trans. Algorithms 13 (3) (2017)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA (2017)
Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. CoRR (2017)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR (2017)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP (2017)
Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
Subtree Isomorphism Revisited. SODA (2016)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS (2016)
Thomas Dueholm Hansen, Uri Zwick
Random-Edge Is Slower Than Random-Facet on Abstract Cubes. ICALP (2016)
Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. STOC (2016)
Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir
Subtree Isomorphism Revisited. CoRR (2015)
Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams
Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made. CoRR (2015)
Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Hollow Heaps. CoRR (2015)
Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick
Hollow Heaps. ICALP (1) (2015)
Thomas Dueholm Hansen, Uri Zwick
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. STOC (2015)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Random-Facet and Random-Bland require subexponential time even for shortest paths. CoRR (2014)
Thomas Dueholm Hansen, Mike Paterson, Uri Zwick
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. SODA (2014)
Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. SODA (2014)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. CoRR (2014)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. CiE (2013)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen
The complexity of interior point methods for solving discounted turn-based stochastic games CoRR (2013)
Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. J. ACM 60 (1) (2013)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
A Faster Algorithm for Solving One-Clock Priced Timed Games. CONCUR (2013)
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
A Faster Algorithm for Solving One-Clock Priced Timed Games CoRR (2012)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
A subexponential lower bound for the Random Facet algorithm for Parity Games. SODA (2011)
Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. ICS (2011)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. STOC (2011)
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen
On acyclicity of games with cycles. Discret. Appl. Math. 158 (10) (2010)
Thomas Dueholm Hansen, Uri Zwick
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. ISAAC (1) (2010)
Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor CoRR (2010)
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen
On Acyclicity of Games with Cycles. AAIM (2009)
Thomas Dueholm Hansen, Orestis Telelis
Improved Bounds for Facility Location Games with Fair Cost Allocation. COCOA (2009)
Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
On Range of Skill. AAAI (2008)
Thomas Dueholm Hansen, Orestis Telelis
On Pure and (approximate) Strong Equilibria of Facility Location Games CoRR (2008)
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Approximability and parameterized complexity of minmax values CoRR (2008)
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Approximability and Parameterized Complexity of Minmax Values. WINE (2008)
Thomas Dueholm Hansen, Orestis Telelis
On Pure and (Approximate) Strong Equilibria of Facility Location Games. WINE (2008)