@inproceedings{193edaa5616149d3b24f9c8b35d170d9,
title = "Games, Puzzles and Treewidth",
abstract = "We discuss some results on the complexity of games and puzzles. In particular, we focus on the relationship between bounded treewidth and the (in-)tractability of games and puzzles in which graphs play a role. We discuss some general methods which are good starting points for finding complexity proofs for games and puzzles.",
keywords = "complexity, games, puzzles, treewidth",
author = "{Van Der Zanden}, {Tom C.}",
year = "2020",
month = apr,
day = "20",
doi = "10.1007/978-3-030-42071-0_17",
language = "English",
isbn = "978-3-030-42070-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Cham",
pages = "247--261",
editor = "F. Fomin and S. Kratsch and {van Leeuwen}, E.",
booktitle = "Treewidth, Kernels, and Algorithms",
address = "Switzerland",
}