Pages that link to "Item:Q2379996"
From MaRDI portal
The following pages link to A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996):
Displaying 9 items.
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- 1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- A Kernel for Convex Recoloring of Weighted Forests (Q3401093) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
- Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479370) (← links)