Thomas Dueholm Hansen

42 papers A* 15A 1B 1C 3Journal 18Unranked 4

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