For a well-studied family of domination-type problems, in bounded-treewidth graphs, we
investigate whether it is possible to find faster algorithms. For sets σ, ρ of non-negative …

The-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear
codes over, which can be stated as follows: given a generator matrix and an integer …

Belmonte and Vatshelle (TCS 2013) used mim-width, a graph width parameter bounded on
interval graphs and permutation graphs, to explain existing algorithms for many domination …

The $ k $-Even Set problem is a parameterized variant of the Minimum Distance Problem of
linear codes over $\mathbb F_2 $, which can be stated as follows: given a generator matrix …

Robust control theory has been successfully applied to numerous real-world problems using
a small set of devices called controllers. However, the real systems represented by networks …

In the mixed Chinese postman problem (MCPP), given a weighted mixed graph G (it may
have both edges and arcs), our aim is to find a closed walk of minimum weight traversing …

We study the parameterized complexity of domination-type problems.(σ, ρ)-domination is a
general and unifying framework introduced by Telle: given σ, ρ⊆ ℕ, a set D of vertices of a …

Abstract In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph G
(G may have both edges and arcs), our aim is to find a minimum weight closed walk …

For the vertex selection problem (σ, ρ)-DomSet one is given two fixed sets σ and ρ of
integers and the task is to decide whether we can select vertices of the input graph such that …

For nonempty σ, ρ⊆ ℕ, a vertex set S in a graph G is a (σ, ρ)-dominating set if for all v∈ S,| N
(v)∩ S|∈ σ, and for all v∈ V (G)⧵ S,| N (v)∩ S|∈ ρ. The Min/Max (σ, ρ)-Dominating Set …