49 citations · 118 across the 24 of their papers we have counts for
34 papers
On the Complexity of Target Set Selection in Simple Geometric Networks
Michal Dvořák, Dušan Knop, Šimon Schierreich
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the n…
Host Community Respecting Refugee Housing
Dušan Knop, Šimon Schierreich
We propose a novel model for refugee housing respecting the preferences of the accepting community and refugees themselves. In particular, we are given a topology representing the…
Bribery Can Get Harder in Structured Multiwinner Approval Election
Bartosz Kusek, Robert Bredereck, Piotr Faliszewski +2
We study the complexity of constructive bribery in the context of structured multiwinner approval elections. Given such an election, we ask whether a certain candidate can join the…
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
Václav Blažej, Pratibha Choudhary, Dušan Knop +3
For many problems, the important instances from practice possess certain structure that one should reflect in the design of specific algorithms. As data reduction is an important a…
Polynomial Kernels for Tracking Shortest Paths
Václav Blažej, Pratibha Choudhary, Dušan Knop +3
Given an undirected graph , vertices , and an integer , Tracking Shortest Paths requires deciding whether there exists a set of vertices su…
Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Robert Ganian, Thekla Hamm, Dušan Knop +2
Hedonic diversity games are a variant of the classical Hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly target…