2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.MA2018
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…
cs.DS2017
Combinatorial n-fold Integer Programming and Applications
Dušan Knop, Martin Koutecký, Matthias Mnich
Many fundamental NP-hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the dimension o…
cs.DM2015★ 2 cited
IV-matching is strongly NP-hard
Lukáš Folwarczný, Dušan Knop
IV-matching is a generalization of perfect bipartite matching. The complexity of finding IV-matching in a graph was posted as an open problem at the ICALP 2014 conference. In this…