2 citations · 2 across the 3 of their papers we have counts for
4 papers
ARRIVAL: Next Stop in CLS
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubáček +3
We study the computational complexity of ARRIVAL, a zero-player game on -vertex switch graphs introduced by Dohrau, Gärtner, Kohler, Matoušek, and Welzl. They showed that the pr…
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano +2
Connectivity related concepts are of fundamental interest in graph theory. The area has received extensive attention over four decades, but many problems remain unsolved, especiall…
On Pure and (approximate) Strong Equilibria of Facility Location Games
Thomas Dueholm Hansen, Orestis A. Telelis
We study social cost losses in Facility Location games, where selfish agents install facilities over a network and connect to them, so as to forward their local demand (express…
Approximability and parameterized complexity of minmax values
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen +1
We consider approximating the minmax value of a multi-player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precis…