( en | de | ru )

 

Disambiguation of "Hansen, Thomas Dueholm"

Author of the publication

copydeleteadd this publication to your clipboard
On Pure and (approximate) Strong Equilibria of Facility Location Games

, and . CoRR, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sten Dueholm

Thomas Hansen

Thomas Hansen

Thomas Hansen

Thomas Hansen

 

Other publications of authors with the same name

Subtree Isomorphism Revisited., , , , and . SODA, page 1256-1271. SIAM, (2016)Random-Edge Is Slower Than Random-Facet on Abstract Cubes., and . ICALP, volume 55 of LIPIcs, page 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games., and . CiE, volume 7921 of Lecture Notes in Computer Science, page 252-262. Springer, (2013)Subtree Isomorphism Revisited., , , , and . ACM Trans. Algorithms, 14 (3): 27:1-27:23 (2018)Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made., , , and . CoRR, (2015)An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm., and . STOC, page 209-218. ACM, (2015)Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made., , , and . STOC, page 375-388. ACM, (2016)Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles., and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 415-426. Springer, (2010)On Acyclicity of Games with Cycles., , and . AAIM, volume 5564 of Lecture Notes in Computer Science, page 15-28. Springer, (2009)Approximability and Parameterized Complexity of Minmax Values., , , and . WINE, volume 5385 of Lecture Notes in Computer Science, page 684-695. Springer, (2008)