Titlebook: ;

省略

LIMN

Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results,dering the problem of saving colors/weight with respect to a better bound on the chromatic number. Finally, we consider the fixed parameterized tractability of Max Coloring in restricted graph classes under standard parameterization.

Amenable

Finding Two Edge-Disjoint Paths with Length Constraints,btain FPT algorithms for seven of them. Our algorithms uses random partition backed by some structural results. On the other hand, we prove that the problem admits no polynomial kernel for all nine cases unless ..