Skip to main content

4 Result(s)

within Computer Science Remove this filter Algorithm Analysis and Problem Complexity 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

    Partitioning Graphs into Induced Subgraphs

    We study the Partition into  \(H\) problem from the parametrized complexity point of view. In the Partition ...

    Dušan Knop in Language and Automata Theory and Applications (2017)

  2. No Access

    Chapter and Conference Paper

    Computational Complexity of Distance Edge Labeling

    The problem of Distance Edge Labeling is a variant of Distance Vertex Labeling (also known as \(\mathrm{L}_{2,1}\) la...

    Dušan Knop, Tomáš Masařík in Combinatorial Algorithms (2016)

  3. 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)

  4. No Access

    Chapter and Conference Paper

    Parametrized Complexity of Length-Bounded Cuts and Multi-cuts

    We show that the minimal length-bounded \(L\) -cut can be computed in linear time with respect to

    Pavel Dvořák, Dušan Knop in Theory and Applications of Models of Computation (2015)