1 citations · 1 across the 4 of their papers we have counts for
6 papers
Constructing Bayesian Optimal Designs for Discrete Choice Experiments by Simulated Annealing
Yicheng Mao, Roselinde Kessels, Tom van der Zanden
Discrete choice experiments (DCEs) investigate the attributes that influence individuals' choices when selecting among various options. To enhance the quality of the estimated choi…
Minimum Separator Reconfiguration
Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud +4
We study the problem of reconfiguring one minimum --separator into another minimum --separator in some -vertex graph containing two non-adjacent vertices…
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…
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…
Parameterized Complexity of Graph Constraint Logic
Tom C. van der Zanden
Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions. We study the param…
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…