Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Cleaning Interval Graphs   We investigate a special case of the Induced Subgraph Isomorphism problem,
where both input graphs are interval graphs. We show the NP-hardness of this
problem, and we prove fixed-parameter tractability of the problem with
non-standard parameterization, where the parameter is the difference
|V(G)|-|V(H)|, with G and H being the larger and the smaller input graph,
respectively. Intuitively, we can interpret this problem as "cleaning" the
graph G, regarded as a pattern containing extra vertices indicating errors, in
order to obtain the graph H representing the original pattern. We also prove
W[1]-hardness for the standard parameterization where the parameter is |V(H)|.

30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc
9
The categories of this paper are: nlin
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
16
The categories of this paper are: stat
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
35
The categories of this paper are: mtrl-th
11
The categories of this paper are: hep-lat