Publications

Export 12 results:
Title Year
Filters: First Letter Of Title is C  [Clear All Filters]
2022 - Conference articles
Combating Collusion Rings is Hard but Possible.
Boehmer, Niclas; Bredereck, Robert; Nichterlein, André.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), , 2022.
Accepted for publication.
2019 - Conference articles
Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas.
Bredereck, Robert; Luo, Junjie.
In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '19), pages 819–827, IFAAMAS, 2019.
2017 - Conference articles
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.
Kellerhals, Leon; Korenwein, Viatcheslav; Zschoche, Philipp; Bredereck, Robert; Chen, Jiehua.
In Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC '17), pages 348–361, 2017.
On Coalitional Manipulation for Multiwinner Elections: Shortlisting.
Bredereck, Robert; Kaczmarczyk, Andrzej; Niedermeier, Rolf.
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 887-893, AAAI Press, 2017.
2016 - Conference articles
Complexity of Shift Bribery in Committee Elections.
Bredereck, Robert; Faliszewski, Piotr; Niedermeier, Rolf; Skowron, Piotr; Talmon, Nimrod.
In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI '16), pages 2452--2458, AAAI Press, 2016.
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.
Bliem, Berhard; Bredereck, Robert; Niedermeier, Rolf.
In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI '16), pages 102-108, AAAI Press, 2016.
2014 - Conference articles
The Complexity of Degree Anonymization by Vertex Addition.
Bredereck, Robert; Froese, Vincent; Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod.
In Proceedings of the International Conference on Algorithmic Aspects of Information and Management (AAIM '14), volume 8546 of LNCS, pages 44–55, Springer, 2014.
2013 - Conference articles
The complexity of finding a large subgraph under anonymity constraints.
Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J.
Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13) LNCS 8283:152–162.