Skip to main content

1 Result(s)

within Computer Science Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Computer Communication Networks Remove this filter Mathematical Logic and Formal Languages Remove this filter Dušan Knop Remove this filter Conference Paper Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems

    We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neighborhood diversity and clique ...

    Jiří Fiala, Tomáš Gavenčiak, Dušan Knop, Martin Koutecký… in Computing and Combinatorics (2016)