Skip to main content

4 Result(s)

within Chapter Remove this filter Dušan Knop Remove this filter Computer Communication Networks Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Establishing Herd Immunity is Hard Even in Simple Geometric Networks

    We study the following model of disease spread in a social network. In the beginning, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to ...

    Michal Dvořák, Dušan Knop, Šimon Schierreich in Algorithms and Models for the Web Graph (2023)

  2. No Access

    Chapter and Conference Paper

    Multidimensional Stable Roommates with Master List

    Since the early days of research in algorithms and complexity, the computation of stable matchings is a core topic. While in the classic setting the goal is to match up two agents (either from different “gende...

    Robert Bredereck, Klaus Heeger, Dušan Knop, Rolf Niedermeier in Web and Internet Economics (2020)

  3. No Access

    Chapter and Conference Paper

    Kernelization of Graph Hamiltonicity: Proper H-Graphs

    We obtain new polynomial kernels and compression algorithms for Pat...

    Steven Chaplick, Fedor V. Fomin, Petr A. Golovach… in Algorithms and Data Structures (2019)

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