Related papers: The Parameterized Complexity of some Permutation G…

The \textsc{Bipartite Contraction} problem is to decide, given a graph $G$ and a parameter $k$, whether we can can obtain a bipartite graph from $G$ by at most $k$ edge contractions. The fixed-parameter tractability of the problem was shown…

A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions S and T of size k, whether it is…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems with unattractive polynomial running times. Here, we focus…

We show that the dominating set problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K(1,3)), the complete bipartite graph on four vertices where the two parts have one and three…

We present a parameterized dichotomy for the \textsc{$k$-Sparsest Cut} problem in weighted and unweighted versions. In particular, we show that the weighted \textsc{$k$-Sparsest Cut} problem is NP-hard for every $k\geq 3$ even on graphs…

Scheduling theory is an old and well-established area in combinatorial optimization, whereas the much younger area of parameterized complexity has only recently gained the attention of the community. Our aim is to bring these two areas…

The space of solutions of the exact renormalization group fixed point equations of the two-dimensional $RP^{N-1}$ model, which we recently obtained within the scale invariant scattering framework, is explored for continuous values of $N\geq…

Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on…

Parameterized complexity enables the practical solution of generally intractable NP-hard problems when certain parameters are small, making it particularly useful in real-world applications. The study of string problems in this framework…

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

A graph vertex-subset problem defines which subsets of the vertices of an input graph are feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of the graph. A reconfiguration variant of a vertex-subset…

We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…

Let $p$ be a prime number, $G$ be a $p$-solvable finite group and $P$ be a Sylow $p$-subgroup of $G$. We prove that $G$ is $p$-supersolvable if $N_G(P)$ is $p$-supersolvable and if there is a subgroup $H$ of $P$ with $P' \le H \le \Phi(P)$…

We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence, where the aim is to obtain a graph with a given degree sequence \sigma by at most k vertex or edge deletions…

For a graph class $\mathcal{G}$, we define the $\mathcal{G}$-modular cardinality of a graph $G$ as the minimum size of a vertex partition of $G$ into modules that each induces a graph in $\mathcal{G}$. This generalizes other module-based…

We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new…

Subexponential parameterized algorithms are known for a wide range of natural problems on planar graphs, but the techniques are usually highly problem specific. The goal of this paper is to introduce a framework for obtaining…

Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…

Let $ G $ be a connected reductive algebraic group over $ \C $. We denote by $ K = (G^{\theta})_{0} $ the identity component of the fixed points of an involutive automorphism $ \theta $ of $ G $. The pair $ (G, K) $ is called a symmetric…