1 research outputs found
An FPT algorithm for orthogonal buttons and scissors
We study the puzzle game Buttons and Scissors in which the goal is to remove
all buttons from an grid by a series of horizontal and vertical
cuts. We show that the corresponding parameterized problem has an algorithm
with time complexity , where is an upper
bound on the number of cuts