Robert Bredereck
Citata da
Citata da
Are there any nicely structured preference profiles nearby?
R Bredereck, J Chen, GJ Woeginger
Mathematical Social Sciences 79, 61-73, 2016
A characterization of the single-crossing domain
R Bredereck, J Chen, GJ Woeginger
Social Choice and Welfare 41 (4), 989-998, 2013
Theoretical and empirical evaluation of data reduction for exact Kemeny rank aggregation
N Betzler, R Bredereck, R Niedermeier
Autonomous Agents and Multi-Agent Systems 28 (5), 721-748, 2014
Prices matter for the parameterized complexity of shift bribery
R Bredereck, J Chen, P Faliszewski, A Nichterlein, R Niedermeier
Information and Computation 251, 140-164, 2016
Parameterized algorithmics for computational social choice: Nine research challenges
R Bredereck, J Chen, P Faliszewski, J Guo, R Niedermeier, ...
Tsinghua Science and Technology 19 (4), 358-373, 2014
Manipulating Opinion Diffusion in Social Networks
R Bredereck, E Elkind
IJCAI, 894-900, 2017
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting
R Bredereck, P Faliszewski, R Niedermeier, P Skowron, N Talmon
Theoretical Computer Science, 2020
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
R Bredereck, J Chen, S Hartung, S Kratsch, R Niedermeier, O Suchy, ...
Journal of Artificial Intelligence Research 50, 409-446, 2014
On bounded-degree vertex deletion parameterized by treewidth
N Betzler, R Bredereck, R Niedermeier, J Uhlmann
Discrete Applied Mathematics 160 (1-2), 53-60, 2012
Multiwinner elections with diversity constraints
R Bredereck, P Faliszewski, A Igarashi, M Lackner, P Skowron
arXiv preprint arXiv:1711.06527, 2017
Large-scale election campaigns: Combinatorial shift bribery
R Bredereck, P Faliszewski, R Niedermeier, N Talmon
Journal of Artificial Intelligence Research 55, 603-652, 2016
Group activity selection on social networks
A Igarashi, R Bredereck, D Peters, E Elkind
arXiv preprint arXiv:1712.02712, 2017
The effect of homogeneity on the computational complexity of combinatorial data anonymization
R Bredereck, A Nichterlein, R Niedermeier, G Philip
Data Mining and Knowledge Discovery, 1-27, 2012
Robustness among multiwinner voting rules
R Bredereck, P Faliszewski, A Kaczmarczyk, R Niedermeier, P Skowron, ...
Artificial Intelligence, 103403, 2020
Complexity of shift bribery in committee elections
R Bredereck, P Faliszewski, R Niedermeier, N Talmon
arXiv preprint arXiv:1601.01492, 2016
The complexity of degree anonymization by vertex addition
R Bredereck, V Froese, S Hartung, A Nichterlein, R Niedermeier, ...
Theoretical Computer Science 607, 16-34, 2015
Partial kernelization for rank aggregation: theory and experiments
N Betzler, R Bredereck, R Niedermeier
International Symposium on Parameterized and Exact Computation, 26-37, 2010
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.
B Bliem, R Bredereck, R Niedermeier
IJCAI, 102-108, 2016
Envy-free allocations respecting social networks
R Bredereck, A Kaczmarczyk, R Niedermeier
Proceedings of the 17th International Conference on Autonomous Agents and …, 2018
Partitioning perfect graphs into stars
R Van Bevern, R Bredereck, L Bulteau, J Chen, V Froese, R Niedermeier, ...
Journal of Graph Theory 85 (2), 297-335, 2017
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20