Parameterized complexity of distance labeling and uniform channel assignment problems

Finally, we show that the uniform variant of the Channel Assignment problem becomes NP-complete when generalized to graphs of bounded clique width.