Partial Kernelization for Rank Aggregation: Theory and Experiments. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier (IPEC, 2010)

Fixed-Parameter Algorithms for Computing Kemeny Scores - Theory and Practice - Robert Bredereck (CoRR, 2010)

The Effect of Homogeneity on the Complexity of k-Anonymity. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (FCT, 2011)

Pattern-Guided Data Anonymization and Clustering. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (MFCS, 2011)

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (SOFSEM, 2011)

Graph and Election Problems Parameterized by Feedback Set Numbers - Robert Bredereck (CoRR, 2011)

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Rolf Niedermeier; Ondrej Suchý 001; Stefan Kratsch (AAAI, 2012)

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. - Nadja Betzler; Robert Bredereck; Jiehua Chen 001; Rolf Niedermeier (The Multivariate Algorithmic Revolution and Beyond, 2012)

On Bounded-Degree Vertex Deletion parameterized by treewidth. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (Discret. Appl. Math., 2012)

Parameterized Complexity of DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (CIAC, 2013)

The Complexity of Finding a Large Subgraph under Anonymity Constraints. - Robert Bredereck; Sepp Hartung; André Nichterlein; Gerhard J. Woeginger (ISAAC, 2013)

On Explaining Integer Vectors by Few Homogenous Segments. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Christian Komusiewicz; Rolf Niedermeier; Ondrej Suchý 001 (WADS, 2013)

Pattern-Guided k-Anonymity. - Robert Bredereck; André Nichterlein; Rolf Niedermeier (Algorithms, 2013)

A characterization of the single-crossing domain. - Robert Bredereck; Jiehua Chen 001; Gerhard J. Woeginger (Soc. Choice Welf., 2013)

Star Partitions of Perfect Graphs. - René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (ICALP (1), 2014)

Network-Based Dissolution. - René van Bevern; Robert Bredereck; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (MFCS (2), 2014)

Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. - Nadja Betzler; Robert Bredereck; Rolf Niedermeier (Auton. Agents Multi Agent Syst., 2014)

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. - Nadja Betzler; Hans L. Bodlaender; Robert Bredereck; Rolf Niedermeier; Johannes Uhlmann (Algorithmica, 2014)

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. - Robert Bredereck; Jiehua Chen 001; Piotr Faliszewski; Jiong Guo; Rolf Niedermeier; Gerhard J. Woeginger (CoRR, 2014)

The effect of homogeneity on the computational complexity of combinatorial data anonymization. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (Data Min. Knowl. Discov., 2014)

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Stefan Kratsch; Rolf Niedermeier; Ondrej Suchý 001; Gerhard J. Woeginger (J. Artif. Intell. Res., 2014)

Elections with Few Candidates: Prices, Weights, and Covering Problems. - Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier; Piotr Skowron 001; Nimrod Talmon (ADT, 2015)

Using Patterns to Form Homogeneous Teams. - Robert Bredereck; Thomas Köhler; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (Algorithmica, 2015)

On explaining integer vectors by few homogeneous segments. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Christian Komusiewicz; Rolf Niedermeier; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2015)

Network-Based Vertex Dissolution. - René van Bevern; Robert Bredereck; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (SIAM J. Discret. Math., 2015)

The complexity of degree anonymization by vertex addition. - Robert Bredereck; Vincent Froese; Sepp Hartung; André Nichterlein; Rolf Niedermeier; Nimrod Talmon (Theor. Comput. Sci., 2015)

How to Put Through Your Agenda in Collective Binary Decisions. - Noga Alon; Robert Bredereck; Jiehua Chen 001; Stefan Kratsch; Rolf Niedermeier; Gerhard J. Woeginger (ACM Trans. Economics and Comput., 2015)

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. - René van Bevern; Robert Bredereck; Laurent Bulteau; Christian Komusiewicz; Nimrod Talmon; Gerhard J. Woeginger (DOOR, 2016)

Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. - Bernhard Bliem; Robert Bredereck; Rolf Niedermeier (IJCAI, 2016)

A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. - Robert Bredereck; Vincent Froese; Marcel Koseler; Marcelo Garlet Millani; André Nichterlein; Rolf Niedermeier (CoRR, 2016)

Prices matter for the parameterized complexity of shift bribery. - Robert Bredereck; Jiehua Chen 001; Piotr Faliszewski; André Nichterlein; Rolf Niedermeier (Inf. Comput., 2016)

NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting. - Robert Bredereck; Nimrod Talmon (Inf. Process. Lett., 2016)

Large-Scale Election Campaigns: Combinatorial Shift Bribery. - Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier; Nimrod Talmon (J. Artif. Intell. Res., 2016)

Are there any nicely structured preference profiles nearby? - Robert Bredereck; Jiehua Chen 001; Gerhard J. Woeginger (Math. Soc. Sci., 2016)

Finding large degree-anonymous subgraphs is hard. - Cristina Bazgan; Robert Bredereck; Sepp Hartung; André Nichterlein; Gerhard J. Woeginger (Theor. Comput. Sci., 2016)

Teams in Online Scheduling Polls: Game-Theoretic Aspects. - Robert Bredereck; Jiehua Chen 001; Rolf Niedermeier; Svetlana Obraztsova; Nimrod Talmon (AAAI, 2017)

Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. - Robert Bredereck; Jiehua Chen 001; Ugo Paavo Finnendahl; Rolf Niedermeier (ADT, 2017)

On Parameterized Complexity of Group Activity Selection Problems on Social Networks. - Ayumi Igarashi 001; Robert Bredereck; Edith Elkind (AAMAS, 2017)

Assessing the Computational Complexity of Multi-layer Subgraph Detection. - Robert Bredereck; Christian Komusiewicz; Stefan Kratsch; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (CIAC, 2017)

Manipulating Opinion Diffusion in Social Networks. - Robert Bredereck; Edith Elkind (IJCAI, 2017)

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. - Leon Kellerhals; Viatcheslav Korenwein; Philipp Zschoche; Robert Bredereck; Jiehua Chen 001 (TAMC, 2017)

Group Activity Selection on Social Networks. - Ayumi Igarashi 001; Robert Bredereck; Dominik Peters; Edith Elkind (CoRR, 2017)

Fixed-parameter algorithms for DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2017)

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. - Robert Bredereck; Jiehua Chen 001; Rolf Niedermeier; Toby Walsh (J. Artif. Intell. Res., 2017)

Partitioning Perfect Graphs into Stars. - René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (J. Graph Theory, 2017)

Multiwinner Elections With Diversity Constraints. - Robert Bredereck; Piotr Faliszewski; Ayumi Igarashi 001; Martin Lackner; Piotr Skowron 001 (AAAI, 2018)

Parameterized complexity of team formation in social networks. - Robert Bredereck; Jiehua Chen 001; Falk Hüffner; Stefan Kratsch (Theor. Comput. Sci., 2018)

Hedonic Diversity Games. - Robert Bredereck; Edith Elkind; Ayumi Igarashi 001 (AAMAS, 2019)

Complexity of Manipulation in Premise-Based Judgment Aggregation with Simple Formulas. - Robert Bredereck; Junjie Luo 001 (AAMAS, 2019)

High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. - Robert Bredereck; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (EC, 2019)

An Experimental View on Committees Providing Justified Representation. - Robert Bredereck; Piotr Faliszewski; Andrzej Kaczmarczyk 001; Rolf Niedermeier (IJCAI, 2019)

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. - Robert Bredereck; Vincent Froese; Marcel Koseler; Marcelo Garlet Millani; André Nichterlein; Rolf Niedermeier (Algorithmica, 2019)

Assessing the computational complexity of multilayer subgraph detection. - Robert Bredereck; Christian Komusiewicz; Stefan Kratsch; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (Netw. Sci., 2019)

Electing Successive Committees: Complexity and Algorithms. - Robert Bredereck; Andrzej Kaczmarczyk 001; Rolf Niedermeier (AAAI, 2020)

Adapting Stable Matchings to Evolving Preferences. - Robert Bredereck; Jiehua Chen 001; Dusan Knop; Junjie Luo 001; Rolf Niedermeier (AAAI, 2020)

Parameterized Algorithms for Finding a Collective Set of Items. - Robert Bredereck; Piotr Faliszewski; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (AAAI, 2020)

Strategic Campaign Management in Apportionment Elections. - Robert Bredereck; Piotr Faliszewski; Michal Furdyna; Andrzej Kaczmarczyk 001; Martin Lackner (IJCAI, 2020)

Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks. - Robert Bredereck; Lilian Jacobs; Leon Kellerhals (IJCAI, 2020)

Line-Up Elections: Parallel Voting with Shared Candidate Pool. - Niclas Boehmer; Robert Bredereck; Piotr Faliszewski; Andrzej Kaczmarczyk 001; Rolf Niedermeier (SAGT, 2020)

Multidimensional Stable Roommates with Master List. - Robert Bredereck; Klaus Heeger; Dusan Knop; Rolf Niedermeier (WINE, 2020)

Stable roommates with narcissistic, single-peaked, and single-crossing preferences. - Robert Bredereck; Jiehua Chen 001; Ugo Paavo Finnendahl; Rolf Niedermeier (Auton. Agents Multi Agent Syst., 2020)

Multistage Committee Election. - Robert Bredereck; Till Fluschnik; Andrzej Kaczmarczyk 001 (CoRR, 2020)

On the Robustness of Winners: Counting Briberies in Elections. - Niclas Boehmer; Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier (CoRR, 2020)

Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. - Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier; Piotr Skowron 001; Nimrod Talmon (Theor. Comput. Sci., 2020)

High-Multiplicity Fair Allocation Made More Practical. - Robert Bredereck; Aleksander Figiel; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (AAMAS, 2021)

Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. - Niclas Boehmer; Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier (IJCAI, 2021)

Putting a Compass on the Map of Elections. - Niclas Boehmer; Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier; Stanislaw Szufa (IJCAI, 2021)

On coalitional manipulation for multiwinner elections: shortlisting. - Robert Bredereck; Andrzej Kaczmarczyk 001; Rolf Niedermeier (Auton. Agents Multi Agent Syst., 2021)

Robustness among multiwinner voting rules. - Robert Bredereck; Piotr Faliszewski; Andrzej Kaczmarczyk 001; Rolf Niedermeier; Piotr Skowron 001; Nimrod Talmon (Artif. Intell., 2021)

Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable. - Niclas Boehmer; Robert Bredereck; Dusan Knop; Junjie Luo 001 (CoRR, 2021)

Bribery and Control in Stable Marriage. - Niclas Boehmer; Robert Bredereck; Klaus Heeger; Rolf Niedermeier (J. Artif. Intell. Res., 2021)

Complexity of Shift Bribery in Committee Elections. - Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier; Nimrod Talmon (ACM Trans. Comput. Theory, 2021)

Combating Collusion Rings Is Hard but Possible. - Niclas Boehmer; Robert Bredereck; André Nichterlein (AAAI, 2022)

On Improving Resource Allocations by Sharing. - Robert Bredereck; Andrzej Kaczmarczyk 001; Junjie Luo 001; Rolf Niedermeier; Florian Sachse (AAAI, 2022)

A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. - Niclas Boehmer; Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier (EAAMO, 2022)

When Votes Change and Committees Should (Not). - Robert Bredereck; Till Fluschnik; Andrzej Kaczmarczyk 001 (IJCAI, 2022)

Single-Peaked Opinion Updates. - Robert Bredereck; Anne-Marie George; Jonas Israel; Leon Kellerhals (IJCAI, 2022)

Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. - Niclas Boehmer; Robert Bredereck; Edith Elkind; Piotr Faliszewski; Stanislaw Szufa (NeurIPS, 2022)

Envy-free allocations respecting social networks. - Robert Bredereck; Andrzej Kaczmarczyk 001; Rolf Niedermeier (Artif. Intell., 2022)

Bribery Can Get Harder in Structured Multiwinner Approval Election. - Bartosz Kusek; Robert Bredereck; Piotr Faliszewski (CoRR, 2022)

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. - Robert Bredereck; Klaus Heeger; Dusan Knop; Rolf Niedermeier (Inf. Comput., 2022)

Rank Aggregation Using Scoring Rules. - Niclas Boehmer; Robert Bredereck; Dominik Peters (AAAI, 2023)

Bribery Can Get Harder in Structured Multiwinner Approval Election. - Bartosz Kusek; Robert Bredereck; Piotr Faliszewski; Andrzej Kaczmarczyk 001; Dusan Knop (AAMAS, 2023)

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. - Robert Bredereck; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (ECAI, 2023)

Efficiently Computing Smallest Agreeable Sets. - Robert Bredereck; Till Fluschnik; Nimrod Talmon (ECAI, 2023)

Algorithmics of Egalitarian versus Equitable Sequences of Committees. - Eva Michelle Deltl; Till Fluschnik; Robert Bredereck (IJCAI, 2023)

Improving Resource Allocations by Sharing in Pairs. - Robert Bredereck; Andrzej Kaczmarczyk 001; Junjie Luo 001; Rolf Niedermeier; Florian Sachse (J. Artif. Intell. Res., 2023)

Fine-grained view on bribery for group identification. - Niclas Boehmer; Robert Bredereck; Dusan Knop; Junjie Luo 001 (Auton. Agents Multi Agent Syst., 2023)

A multivariate complexity analysis of the material consumption scheduling problem. - Matthias Bentert; Robert Bredereck; Péter Györgyi; Andrzej Kaczmarczyk 001; Rolf Niedermeier (J. Sched., 2023)

Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas. - Robert Bredereck; Junjie Luo 001 (Inf. Comput., 2024)

Multivariate algorithmics for eliminating envy by donating goods. - Niclas Boehmer; Robert Bredereck; Klaus Heeger; Dusan Knop; Junjie Luo 001 (Auton. Agents Multi Agent Syst., 2024)

Computing Efficient Envy-Free Partial Allocations of Indivisible Goods. - Robert Bredereck; Andrzej Kaczmarczyk 001; Junjie Luo 001; Bin Sun (AAMAS, 2025)

Drawing a map of elections. - Stanislaw Szufa; Niclas Boehmer; Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier; Piotr Skowron 001; Arkadii Slinko; Nimrod Talmon (Artif. Intell., 2025)

Putting Fair Division on the Map. - Paula Böhm; Robert Bredereck; Paul Gölz; Andrzej Kaczmarczyk 001; Stanislaw Szufa (CoRR, 2025)