Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of
  Terminals   Given an undirected, edge-weighted graph G together with pairs of vertices,
called pairs of terminals, the minimum multicut problem asks for a
minimum-weight set of edges such that, after deleting these edges, the two
terminals of each pair belong to different connected components of the graph.
Relying on topological techniques, we provide a polynomial-time algorithm for
this problem in the case where G is embedded on a fixed surface of genus g
(e.g., when G is planar) and has a fixed number t of terminals. The running
time is a polynomial of degree O(sqrt{g^2+gt}) in the input size.
  In the planar case, our result corrects an error in an extended abstract by
Bentz [Int. Workshop on Parameterized and Exact Computation, 109-119, 2012].
The minimum multicut problem is also a generalization of the multiway cut
problem, a.k.a. multiterminal cut problem; even for this special case, no
dedicated algorithm was known for graphs embedded on surfaces.

26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas
3
The categories of this paper are: physics
10
The categories of this paper are: q-bio
16
The categories of this paper are: stat
19
The categories of this paper are: eess
2
The categories of this paper are: math
4
The categories of this paper are: cond-mat
36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol