Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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 $n\times m$ grid by a series of horizontal and vertical
cuts. We show that the corresponding parameterized problem has an algorithm
with time complexity $2^{O(k^2 \log k)} (n+m)^{O(1)}$, where $k$ is an upper
bound on the number of cuts.

26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th
15
The categories of this paper are: nucl-ex
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
8
The categories of this paper are: hep-ex
4
The categories of this paper are: cond-mat
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas