Fast biclustering by dual parameterization

We adapt our algorithm for b -Coloring on graphs of bounded clique-width to solve Fall Coloring , and therefore show that the latter problem is as well solvable in time n 2 O(w) ,

Maximum Induced Forest and Maximum Induced Tree are W[1]-hard pa- rameterized by k + w, and Feedback Vertex Set is W[1]-hard parameterized by w, where k denotes the solution size and

These problems are NP-complete on 3-regular graphs, and we showed that on bipartite graphs, they become polynomial-time solvable; while parameterized by k, they are FPT, and the

Given the aforementioned NP-completeness result for Eulerian Edge Deletion and the fact that H- Editing is NP-complete for almost all natural graph classes H [2, 20], we find

Just like in that algorithm, we enumerate in parameterized subexponential time special structures called potential maximal cliques which are the maximal cliques in some

In fact, the parameterized problems having FPT algorithms are precisely the parameterized problems where preprocessing can in polyno- mial time reduce a problem instance (G, k) to

We complement these results by showing that the choice of degeneracy as the “above guarantee parameterization” is optimal in the following sense: For any ε > 0 it is NP-complete

In particular, the Eulerian approach to fluid simulation is not suitable for flow editing since it does not provide a convenient spatio-temporal parameterization of the