| Publication | Date of Publication | Type |
|---|
| Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules | 2023-12-13 | Paper |
| Heuristics for opinion diffusion via local elections | 2023-08-14 | Paper |
| Correction to: Opinion diffusion and campaigning on society graphs | 2023-05-16 | Paper |
| In the beginning there were \(n\) agents: founding and amending a constitution | 2023-03-31 | Paper |
| Iterative deliberation via metric aggregation | 2023-03-31 | Paper |
| Democratic forking: choosing sides with social choice | 2023-03-31 | Paper |
| Isomorphic Distances Among Elections | 2022-10-19 | Paper |
| Complexity of Shift Bribery in Committee Elections | 2022-09-24 | Paper |
| Opinion diffusion and campaigning on society graphs | 2022-09-08 | Paper |
| Robustness among multiwinner voting rules | 2021-08-16 | Paper |
| Multiwinner Rules with Variable Number of Winners | 2021-07-06 | Paper |
| Committee selection with multimodal preferences | 2021-07-06 | Paper |
| Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation | 2021-05-25 | Paper |
| Multi-Player Diffusion Games on Graph Classes | 2021-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111890 | 2020-05-27 | Paper |
| Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting | 2020-03-12 | Paper |
| On the parameterized tractability of the just-in-time flow-shop scheduling problem | 2020-02-12 | Paper |
| Distributed monitoring of election winners | 2020-01-20 | Paper |
| Sybil-resilient conductance-based community growth | 2019-10-22 | Paper |
| Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives | 2019-06-12 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2019-05-07 | Paper |
| Can we create large \(k\)-cores by adding few edges? | 2018-11-28 | Paper |
| On the parameterized tractability of single machine scheduling with rejection | 2018-10-30 | Paper |
| Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width | 2018-02-13 | Paper |
| Robustness among multiwinner voting rules | 2018-02-13 | Paper |
| Elections with Few Voters: Candidate Control Can Be Easy | 2018-01-12 | Paper |
| Structured proportional representation | 2017-12-20 | Paper |
| Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs | 2017-09-29 | Paper |
| The complexity of degree anonymization by graph contractions | 2017-09-28 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2017-09-22 | Paper |
| The complexity of finding effectors | 2017-03-31 | Paper |
| Large-Scale Election Campaigns: Combinatorial Shift Bribery | 2016-04-19 | Paper |
| The complexity of degree anonymization by vertex addition | 2015-12-08 | Paper |
| NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting | 2015-12-01 | Paper |
| Elections with Few Candidates: Prices, Weights, and Covering Problems | 2015-11-04 | Paper |
| The complexity of finding effectors | 2015-09-30 | Paper |
| Multi-player Diffusion Games on Graph Classes | 2015-09-30 | Paper |
| The Complexity of Degree Anonymization by Graph Contractions | 2015-09-30 | Paper |
| Privacy in Elections: k-Anonymizing Preference Orders | 2015-09-29 | Paper |
| Approximability and parameterized complexity of multicover by \(c\)-intervals | 2015-06-15 | Paper |
| Combinatorial voter control in elections | 2015-06-01 | Paper |
| The Complexity of Degree Anonymization by Vertex Addition | 2015-05-20 | Paper |
| Combinatorial Voter Control in Elections | 2014-10-14 | Paper |
| Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting | 2013-03-21 | Paper |
