1 paper
Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte +2
We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves…