Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Linear kernels for k-tuple and liar's domination in bounded genus graphs   A set $D\subseteq V$ is called a $k$-tuple dominating set of a graph
$G=(V,E)$ if $\left| N_G[v] \cap D \right| \geq k$ for all $v \in V$, where
$N_G[v]$ denotes the closed neighborhood of $v$. A set $D \subseteq V$ is
called a liar's dominating set of a graph $G=(V,E)$ if (i) $\left| N_G[v] \cap
D \right| \geq 2$ for all $v\in V$ and (ii) for every pair of distinct vertices
$u, v\in V$, $\left| (N_G[u] \cup N_G[v]) \cap D \right| \geq 3$. Given a graph
$G$, the decision versions of $k$-Tuple Domination Problem and the Liar's
Domination Problem are to check whether there exists a $k$-tuple dominating set
and a liar's dominating set of $G$ of a given cardinality, respectively. These
two problems are known to be NP-complete \cite{LiaoChang2003, Slater2009}. In
this paper, we study the parameterized complexity of these problems. We show
that the $k$-Tuple Domination Problem and the Liar's Domination Problem are
$\mathsf{W}[2]$-hard for general graphs but they admit linear kernels for
graphs with bounded genus.

14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
28
The categories of this paper are: alg-geom
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
30
The categories of this paper are: q-alg
34
The categories of this paper are: chem-ph