An FPT algorithm for orthogonal buttons and scissors

Research output: Contribution to journalArticlepeer-review


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(k2log⁡k)+(n+m)O(1), where k is an upper bound on the number of cuts.

Original languageEnglish
Article number105997
Number of pages7
JournalInformation Processing Letters
StatePublished - 1 Nov 2020


  • Algorithms
  • Keywords Combinatorial puzzles
  • Parameterized complexity
  • Reduction rules


Dive into the research topics of 'An FPT algorithm for orthogonal buttons and scissors'. Together they form a unique fingerprint.

Cite this