The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Improved approximation algorithm for convex recoloring of trees
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Efficient approximation of convex recolorings
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Convex recolorings of strings and trees: definitions, hardness results and algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
The undirected feedback vertex set problem has a poly(k) kernel
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Connected coloring completion for general graphs: algorithms and complexity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Parameterized Complexity
A 2O (k)poly(n) algorithm for the parameterized Convex Recoloring problem
Information Processing Letters
Convex Recoloring Revisited: Complexity and Exact Algorithms
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Kernel for Convex Recoloring of Weighted Forests
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Speeding up dynamic programming for some NP-hard graph recoloring problems
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
ACM Transactions on Algorithms (TALG)
Connected coloring completion for general graphs: algorithms and complexity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored tree T, the problem is to determine whether recoloring at most k vertices can achieve a convex coloring, meaning by this a coloring where each color class induces a connected subtree. The problem was introduced by Moran and Snir, who showed that CR is NP-hard, and described a search-tree based FPT algorithm with a running time of O(k(k/log k)kn4). The Moran and Snir result did not provide any nontrivial kernelization. Subsequently, a kernelization with a large polynomial bound was established. Here we give the strongest FPT results to date on this problem: (1) We show that in polynomial time, a problem kernel of size O(k2) can be obtained, and (2) We prove that the problem can be solved in linear time for fixed k. The technique used to establish the second result appears to be of general interest and applicability for bounded treewidth problems.