Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky
  Model   We show that finding orthogonal grid-embeddings of plane graphs (planar with
fixed combinatorial embedding) with the minimum number of bends in the
so-called Kandinsky model (which allows vertices of degree $> 4$) is
NP-complete, thus solving a long-standing open problem. On the positive side,
we give an efficient algorithm for several restricted variants, such as graphs
of bounded branch width and a subexponential exact algorithm for general plane
graphs.

18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
8
The categories of this paper are: hep-ex
9
The categories of this paper are: nlin
5
The categories of this paper are: gr-qc
29
The categories of this paper are: funct-an
16
The categories of this paper are: stat
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys