2 citations · 3 across the 4 of their papers we have counts for
4 papers
Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs
Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers
The Shapley value is the solution concept in cooperative game theory that is most used in both theoretical as practical settings. Unfortunately, computing the Shapley value is comp…
Computing Treewidth on the GPU
Tom C. van der Zanden, Hans L. Bodlaender
We present a parallel algorithm for computing the treewidth of a graph on a GPU. We implement this algorithm in OpenCL, and experimentally evaluate its performance. Our algorithm i…
Improved Lower Bounds for Graph Embedding Problems
Hans L. Bodlaender, Tom C. van der Zanden
In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafti…
PSPACE-completeness of Bloxorz and of Games with 2-Buttons
Tom C. van der Zanden, Hans L. Bodlaender
Bloxorz is an online puzzle game where players move a 1 by 1 by 2 block by tilting it on a subset of the two dimensional grid. Bloxorz features switches that open and close trapdoo…