An algorithm is presented that constructively produces a solution to the k -DOMINATING SET problem for planar graphs in time O(c^ \sqrt k n) where c=4^ 6\sqrt 34 and k is the size of the face cover set.Expand

It is proved that this problem is in FPT for general (weighted) graphs and how the use of compact representations may speed up the decision algorithm is shown.Expand

A fixed parameter algorithm is given for the reconfiguration of faulty chips when providing so-called shared and linked spares as well as other enumeration techniques.Expand

This work gives the first polynomial kernel for Rooted k-Leaf-Out-Branching, a variant of k- leaf- out-branching where the root of the tree searched for is also a part of the input, and is the first ones separating Karp kernelization from Turing kernelization.Expand

A fixed parameter algorithm with running time O(8kn), where k is the size of the dominating set and n is the number of vertices in the graph is derived.Expand

Given an undirected graph G with n nodes, the Maximum Leaf Spanning Tree problem asks to find a spanning tree of G with as many leaves as possible. When parameterized in the number of leaves k, thisâ€¦ Expand

This work provides the first nontrivial so-called "fixed parameter" algorithm for CBVC, running in time O(1.3999k1+k2 + (k1-k2n), which is efficient for small values of k1 and k2, as occurring in applications.Expand