13 citations · 21 across the 4 of their papers we have counts for
6 papers
Group Activity Selection on Social Networks
Ayumi Igarashi, Robert Bredereck, Dominik Peters +1
We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups…
Multiwinner Elections with Diversity Constraints
Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi +2
We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with div…
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier +2
A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of…
On Parameterized Complexity of Group Activity Selection Problems on Social Networks
Ayumi Igarashi, Robert Bredereck, Edith Elkind
In Group Activity Selection Problem (GASP), players form coalitions to participate in activities and have preferences over pairs of the form (activity, group size). Recently, Igara…
Precedence-constrained scheduling problems parameterized by partial order width
René van Bevern, Robert Bredereck, Laurent Bulteau +3
Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,|, the problem of finding a non-preempti…
Graph and Election Problems Parameterized by Feedback Set Numbers
Robert Bredereck
This work investigates the parameterized complexity of three related graph modification problems. Given a directed graph, a distinguished vertex, and a positive integer k, Minimum…