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)

Algorithms for destructive shift bribery. - Andrzej Kaczmarczyk 001; Piotr Faliszewski (Auton. Agents Multi Agent Syst., 2019)

Electing Successive Committees: Complexity and Algorithms. - Robert Bredereck; Andrzej Kaczmarczyk 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)

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

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

High-Multiplicity Fair Allocation Made More Practical. - Robert Bredereck; Aleksander Figiel; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (AAMAS, 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)

Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments. - Andrzej Kaczmarczyk 001 (2021)

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

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

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

Properties of Position Matrices and Their Elections. - Niclas Boehmer; Jin-Yi Cai; Piotr Faliszewski; Austen Z. Fan; Lukasz Janeczko; Andrzej Kaczmarczyk 001; Tomasz Was (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)

Diversity, Agreement, and Polarization in Elections. - Piotr Faliszewski; Andrzej Kaczmarczyk 001; Krzysztof Sornat; Stanislaw Szufa; Tomasz Was (IJCAI, 2023)

Robustness of Participatory Budgeting Outcomes: Complexity and Experiments. - Niclas Boehmer; Piotr Faliszewski; Lukasz Janeczko; Andrzej Kaczmarczyk 001 (SAGT, 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)

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)

Strategic Cost Selection in Participatory Budgeting. - Piotr Faliszewski; Lukasz Janeczko; Andrzej Kaczmarczyk 001; Grzegorz Lisowski; Piotr Skowron 001; Stanislaw Szufa (AAMAS, 2024)

Guide to Numerical Experiments on Elections in Computational Social Choice. - Niclas Boehmer; Piotr Faliszewski; Lukasz Janeczko; Andrzej Kaczmarczyk 001; Grzegorz Lisowski; Grzegorz Pierczynski; Simon Rey; Dariusz Stolicki; Stanislaw Szufa; Tomasz Was (IJCAI, 2024)

Selecting the Most Conflicting Pair of Candidates. - Théo Delemazure; Lukasz Janeczko; Andrzej Kaczmarczyk 001; Stanislaw Szufa (IJCAI, 2024)

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

Learning Real-Life Approval Elections. - Piotr Faliszewski; Lukasz Janeczko; Andrzej Kaczmarczyk 001; Marcin Kurdziel; Grzegorz Pierczynski; Stanislaw Szufa (AAMAS, 2025)

On Sequential Fault-Intolerant Process Planning. - Andrzej Kaczmarczyk 001; Davin Choo; Niclas Boehmer; Milind Tambe; Haifeng Xu (CoRR, 2025)

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

Project Submission Games in Participatory Budgeting. - Piotr Faliszewski; Lukasz Janeczko; Andrzej Kaczmarczyk 001; Grzegorz Lisowski; Grzegorz Pierczynski (CoRR, 2025)

How to tamper with a Parliament: Strategic campaigns in apportionment elections. - Robert Bredereck; Piotr Faliszewski; Michal Furdyna; Andrzej Kaczmarczyk 001; Joanna Kaczmarek 001; Martin Lackner; Christian Laußmann; Jörg Rothe; Tessa Seeger (J. Comput. Syst. Sci., 2026)