In the literature on parameterized graph problems, there has been an increased effort in recent years aimed at exploring novel notions of edit-distance that are more powerful than size a modulator to specific class. this line research, Bulian and Dawar [Algorithmica, 75 (2016), pp. 363--382] introduced notion elimination distance showed deciding whether given most $k$ any minor-closed class gra...

The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and Bäckström et al. (2012) picked up this line of research and provided an extensive parameterized analysis under various restrictions, leaving open only one stubborn case. We continue this work and provid...

The three-way table problem is to decide if there exists an l × m × n table satisfying given line sums, and find a table if yes. Recently, it was shown to be fixed-parameter tractable with parameters l, m. Here we extend this and show that the huge version of the problem, where the variable side n is encoded in binary, is also fixed-parameter tractable with parameters l, m. We also conclude tha...

We consider the parameterized complexity of the Unique Coverage problem: given a family of sets and a parameter k, find a subfamily that covers at least k elements exactly once. This NP-complete problem has applications in wireless networks and radio broadcasting and is also a natural generalization of the well-known Max Cut problem. We show that this problem is fixed-parameter tractable with r...

The NP-complete Vertex Cover problem has been intensively studied in the field of parameterized complexity theory. However, there exists only little work concerning important generalizations of Vertex Cover like Partial Vertex Cover, Connected Vertex Cover, and Capacitated Vertex Cover which are of high interest in theory as well as in real-world applications. So far research was mainly focused...

We consider the following problem. Given a 2-cnf formula, is it possible to remove at most k clauses so that the resulting 2-cnf formula is satisfiable? This problem is known to different research communities in theoretical computer science under the names Almost 2-SAT, All-but-k 2-SAT, 2-cnf deletion, and 2-SAT deletion. The status of the fixed-parameter tractability of this problem is a long-...