Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The complexity of computing the cylindrical and the $t$-circle crossing
  number of a graph   A plane drawing of a graph is {\em cylindrical} if there exist two concentric
circles that contain all the vertices of the graph, and no edge intersects
(other than at its endpoints) any of these circles. The {\em cylindrical
crossing number} of a graph \(G\) is the minimum number of crossings in a
cylindrical drawing of \(G\). In his influential survey on the variants of the
definition of the crossing number of a graph, Schaefer lists the complexity of
computing the cylindrical crossing number of a graph as an open question. In
this paper we settle this by showing that this problem is NP-complete.
Moreover, we show an analogous result for the natural generalization of the
cylindrical crossing number, namely the \(t\)-{\em circle crossing number}.

37
The categories of this paper are: supr-con
27
The categories of this paper are: comp-gas
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
19
The categories of this paper are: eess
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
3
The categories of this paper are: physics
16
The categories of this paper are: stat
29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
9
The categories of this paper are: nlin
1
The categories of this paper are: cs