2 citations · 2 across the 4 of their papers we have counts for
6 papers · 1 filter
Voting and Bribing in Single-Exponential Time
Dušan Knop, Martin Koutecký, Matthias Mnich
We introduce a general problem about bribery in voting systems. In the -Multi-Bribery problem, the goal is to bribe a set of voters at minimum cost such that a desired…
Tight complexity lower bounds for integer linear programming with few constraints
Dušan Knop, Michał Pilipczuk, Marcin Wrochna
We consider the ILP Feasibility problem: given an integer linear program , where is an integer matrix with rows and columns and is a vector…
Parameterized Complexity of Fair Vertex Evaluation Problems
Dušan Knop, Tomáš Masařík, Tomáš Toufar
A prototypical graph problem is centered around a graph-theoretic property for a set of vertices and a solution to it is a set of vertices for which the desired property holds. The…
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
Eduard Eiben, Dušan Knop, Fahad Panolan +1
In the Directed Steiner Network problem we are given an arc-weighted digraph , a set of terminals , and an (unweighted) directed request graph with $V(R)=T…
Evaluating and Tuning n-fold Integer Programming
Kateřina Altmanová, Dušan Knop, Martin Koutecký
In recent years, algorithmic breakthroughs in stringology, computational social choice, scheduling, etc., were achieved by applying the theory of so-called -fold integer program…
A Unifying Framework for Manipulation Problems
Dušan Knop, Martin Koutecký, Matthias Mnich
Manipulation models for electoral systems are a core research theme in social choice theory; they include bribery (unweighted, weighted, swap, shift, ...), control (by adding or de…