Robert Bredereck

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 117

Top Venues

Publications

Robert Bredereck, Junjie Luo
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas. Inf. Comput. 296 (2024)
Robert Bredereck, Junjie Luo
Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas. CoRR (2024)
Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
Improving Resource Allocations by Sharing in Pairs. J. Artif. Intell. Res. 78 (2023)
Eva Michelle Deltl, Till Fluschnik, Robert Bredereck
Algorithmics of Egalitarian versus Equitable Sequences of Committees. CoRR (2023)
Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
Fine-grained view on bribery for group identification. Auton. Agents Multi Agent Syst. 37 (1) (2023)
Eva Michelle Deltl, Till Fluschnik, Robert Bredereck
Algorithmics of Egalitarian versus Equitable Sequences of Committees. IJCAI (2023)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26 (4) (2023)
Niclas Boehmer, Robert Bredereck, Dominik Peters
Rank Aggregation Using Scoring Rules. AAAI (2023)
Bartosz Kusek, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop
Bribery Can Get Harder in Structured Multiwinner Approval Election. AAMAS (2023)
Robert Bredereck, Till Fluschnik, Nimrod Talmon
Efficiently Computing Smallest Agreeable Sets. ECAI (2023)
Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI (2023)
Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
On Improving Resource Allocations by Sharing. AAAI (2022)
Bartosz Kusek, Robert Bredereck, Piotr Faliszewski
Bribery Can Get Harder in Structured Multiwinner Approval Election. CoRR (2022)
Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
Multivariate Algorithmics for Eliminating Envy by Donating Goods. AAMAS (2022)
Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk
When Votes Change and Committees Should (Not). IJCAI (2022)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
Envy-free allocations respecting social networks. Artif. Intell. 305 (2022)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. EAAMO (2022)
Niclas Boehmer, Robert Bredereck, Dominik Peters
Rank Aggregation Using Scoring Rules. CoRR (2022)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. CoRR (2022)
Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. NeurIPS (2022)
Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. CoRR (2022)
Niclas Boehmer, Robert Bredereck, André Nichterlein
Combating Collusion Rings Is Hard but Possible. AAAI (2022)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. 289 (Part) (2022)
Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
Multivariate Algorithmics for Eliminating Envy by Donating Goods. CoRR (2022)
Robert Bredereck, Anne-Marie George, Jonas Israel, Leon Kellerhals
Single-Peaked Opinion Updates. IJCAI (2022)
Robert Bredereck, Anne-Marie George, Jonas Israel, Leon Kellerhals
Single-Peaked Opinion Updates. CoRR (2022)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa
Putting a Compass on the Map of Elections. CoRR (2021)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI (2021)
Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation Made More Practical. AAMAS (2021)
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
Robustness among multiwinner voting rules. Artif. Intell. 290 (2021)
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13 (3) (2021)
Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
Fine-Grained View on Bribery for Group Identification. CoRR (2021)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR (2021)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa
Putting a Compass on the Map of Elections. IJCAI (2021)
Niclas Boehmer, Robert Bredereck, André Nichterlein
Combating Collusion Rings is Hard but Possible. CoRR (2021)
Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
Bribery and Control in Stable Marriage. J. Artif. Intell. Res. 71 (2021)
Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable. CoRR (2021)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
On coalitional manipulation for multiwinner elections: shortlisting. Auton. Agents Multi Agent Syst. 35 (2) (2021)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. IJCAI (2021)
Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse
On Improving Resource Allocations by Sharing. CoRR (2021)
Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
Fine-Grained View on Bribery for Group Identification. IJCAI (2020)
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. 814 (2020)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Multidimensional Stable Roommates with Master List. WINE (2020)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR (2020)
Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk
Multistage Committee Election. CoRR (2020)
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
Parameterized Algorithms for Finding a Collective Set of Items. AAAI (2020)
Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
Bribery and Control in Stable Marriage. SAGT (2020)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Multidimensional Stable Roommates with Master List. CoRR (2020)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
On the Robustness of Winners: Counting Briberies in Elections. CoRR (2020)
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
Line-Up Elections: Parallel Voting with Shared Candidate Pool. SAGT (2020)
Robert Bredereck, Lilian Jacobs, Leon Kellerhals
Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks. IJCAI (2020)
Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR (2020)
Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Martin Lackner
Strategic Campaign Management in Apportionment Elections. IJCAI (2020)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
Electing Successive Committees: Complexity and Algorithms. AAAI (2020)
Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
Bribery and Control in Stable Marriage. CoRR (2020)
Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
Adapting Stable Matchings to Evolving Preferences. AAAI (2020)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
Envy-Free Allocations Respecting Social Networks. CoRR (2020)
Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier
Stable roommates with narcissistic, single-peaked, and single-crossing preferences. Auton. Agents Multi Agent Syst. 34 (2) (2020)
Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. EC (2019)
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier
An Experimental View on Committees Providing Justified Representation. IJCAI (2019)
Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier
Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences. CoRR (2019)
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7 (2) (2019)
Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica 81 (4) (2019)
Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
Adapting Stable Matchings to Evolving Preferences. CoRR (2019)
Robert Bredereck, Edith Elkind, Ayumi Igarashi
Hedonic Diversity Games. AAMAS (2019)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC (2019)
Robert Bredereck, Junjie Luo
Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas. AAMAS (2019)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR (2019)
Robert Bredereck, Edith Elkind, Ayumi Igarashi
Hedonic Diversity Games. CoRR (2019)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. CoRR (2018)
Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch
Parameterized complexity of team formation in social networks. Theor. Comput. Sci. 717 (2018)
Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron
Multiwinner Elections With Diversity Constraints. AAAI (2018)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
Envy-Free Allocations Respecting Social Networks. AAMAS (2018)
Robert Bredereck, Jiehua Chen, Ugo Paavo Finnendahl, Rolf Niedermeier
Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. ADT (2017)
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
Robustness Among Multiwinner Voting Rules. CoRR (2017)
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. IJCAI (2017)
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
Robustness Among Multiwinner Voting Rules. SAGT (2017)
Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. CoRR (2017)
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting. CoRR (2017)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Partitioning Perfect Graphs into Stars. J. Graph Theory 85 (2) (2017)
Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon
Teams in Online Scheduling Polls: Game-Theoretic Aspects. AAAI (2017)
Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. TAMC (2017)
Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron
Multiwinner Elections with Diversity Constraints. CoRR (2017)
Ayumi Igarashi, Robert Bredereck, Edith Elkind
On Parameterized Complexity of Group Activity Selection Problems on Social Networks. AAMAS (2017)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220 (2017)
Robert Bredereck, Edith Elkind
Manipulating Opinion Diffusion in Social Networks. IJCAI (2017)
Ayumi Igarashi, Robert Bredereck, Dominik Peters, Edith Elkind
Group Activity Selection on Social Networks. CoRR (2017)
Ayumi Igarashi, Robert Bredereck, Edith Elkind
On Parameterized Complexity of Group Activity Selection Problems on Social Networks. CoRR (2017)
Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Toby Walsh
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. J. Artif. Intell. Res. 59 (2017)
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC (2017)
Bernhard Bliem, Robert Bredereck, Rolf Niedermeier
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. IJCAI (2016)
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR (2016)
Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR (2016)
Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
Complexity of Shift Bribery in Committee Elections. AAAI (2016)
Robert Bredereck, Nimrod Talmon
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting. Inf. Process. Lett. 116 (2) (2016)
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
Fixed-Parameter Algorithms for DAG Partitioning. CoRR (2016)
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
Precedence-constrained scheduling problems parameterized by partial order width. CoRR (2016)
Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622 (2016)
Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC (2016)
Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon
Teams in Online Scheduling Polls: Game-Theoretic Aspects. CoRR (2016)

Robert Bredereck.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Robert Bredereck