TY - JOUR
T1 - An FPT algorithm for orthogonal buttons and scissors
AU - Tsur, Dekel
N1 - Publisher Copyright:
© 2020 Elsevier B.V.
PY - 2020/11/1
Y1 - 2020/11/1
N2 - We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an n×m grid by a series of horizontal and vertical cuts. We show that the corresponding decision problem has an algorithm with time complexity 2O(k2logk)+(n+m)O(1), where k is an upper bound on the number of cuts.
AB - We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an n×m grid by a series of horizontal and vertical cuts. We show that the corresponding decision problem has an algorithm with time complexity 2O(k2logk)+(n+m)O(1), where k is an upper bound on the number of cuts.
KW - Algorithms
KW - Keywords Combinatorial puzzles
KW - Parameterized complexity
KW - Reduction rules
UR - http://www.scopus.com/inward/record.url?scp=85089383507&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2020.105997
DO - 10.1016/j.ipl.2020.105997
M3 - Article
AN - SCOPUS:85089383507
VL - 163
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
M1 - 105997
ER -