Robert Bredereck

24 papers · 2013–2026 · 3 conferences · across top CS/AI conferences

Achievements

🌍 Conference Polyglot (3) 🗺️ Taxonomy Completionist (25) 🌈 Renaissance Researcher (5) 🐝 Cross-Pollinator (7) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🏃 Academic Marathon (12) 🤝 Dynamic Duo (11) 🧬 Topic Evolution 🏆 Keyword Champion (3) 🚀 Conference Pioneer ⚡ Prolific Year (6) 🗃️ Keyword Collector (92) ❓ The Questioner 💎 Century Club (23) 🔥 Unstoppable (5)

Conferences

IJCAI (15) AAAI (8) NIPS (1)

Top co-authors

Rolf Niedermeier (11) Andrzej Kaczmarczyk (9) Piotr Faliszewski (6) Niclas Boehmer (6) Dusan Knop (3) Jiehua Chen (3) Stanisław Szufa (3) Junjie Luo (3) Leon Kellerhals (3) Matthias Bentert (2)

Research topics

Discrete Mathematics (1)

Keywords

parameterized complexity (7) computational complexity (5) social network (4) opinion diffusion (3) combinatorial optimization (3) voting rule (3) vote distribution (2) strategic voting (2) bribery problem (2) resource allocation (2) preference learning (2) multi-agent system (2) fixed-parameter tractability (2) committee election (2) algorithmic complexity (2) fair division (2) social choice (2) parameterized algorithm (2) election analysis (2) discrete mathematics (1)

Papers

Putting Fair Division on the Map AAAI 2026

How to Resolve Envy by Adding Goods IJCAI 2025

Rank Aggregation Using Scoring Rules AAAI 2023

Algorithmics of Egalitarian versus Equitable Sequences of Committees IJCAI 2023

Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning NIPS 2022

Combating Collusion Rings Is Hard but Possible AAAI 2022

On Improving Resource Allocations by Sharing AAAI 2022

Single-Peaked Opinion Updates IJCAI 2022

When Votes Change and Committees Should (Not) IJCAI 2022

Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments IJCAI 2021

A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem AAAI 2021

Putting a Compass on the Map of Elections IJCAI 2021

Electing Successive Committees: Complexity and Algorithms AAAI 2020

Strategic Campaign Management in Apportionment Elections IJCAI 2020

Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks IJCAI 2020

Parameterized Algorithms for Finding a Collective Set of Items AAAI 2020

Adapting Stable Matchings to Evolving Preferences AAAI 2020

Fine-Grained View on Bribery for Group Identification IJCAI 2020

An Experimental View on Committees Providing Justified Representation IJCAI 2019

Manipulating Opinion Diffusion in Social Networks IJCAI 2017

On Coalitional Manipulation for Multiwinner Elections: Shortlisting IJCAI 2017

Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels IJCAI 2016

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty IJCAI 2015

Are There Any Nicely Structured Preference Profiles Nearby? IJCAI 2013