Pages that link to "Item:Q931727"

The following pages link to Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727):

Displaying 21 items.

• The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
• The complexity of minimum convex coloring (Q415283) (← links)
• The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
• Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
• Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• 1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830) (← links)
• An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
• Structured proportional representation (Q1686072) (← links)
• The parameterized complexity of some minimum label problems (Q1959420) (← links)
• A GRASP for the convex recoloring problem in graphs (Q2132370) (← links)
• Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
• Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
• Strong intractability of generalized convex recoloring problems (Q2413156) (← links)
• Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
• Strong inequalities and a branch-and-price algorithm for the convex recoloring problem (Q2673556) (← links)
• Convex Recoloring of Paths (Q2840702) (← links)
• Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)
• A strong formulation for the graph partition problem (Q6068542) (← links)
• A heuristic for the convex recoloring problem in graphs (Q6071077) (← links)
• Heuristics for the connected assignment problem in arrays (Q6092548) (← links)