Multiwinner voting: A new challenge for social choice theory P Faliszewski, P Skowron, A Slinko, N Talmon Trends in computational social choice 74, 27-47, 2017 | 105 | 2017 |

The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration H Dell, C Komusiewicz, N Talmon, M Weller 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018 | 45 | 2018 |

Committee Scoring Rules: Axiomatic Classification and Hierarchy P Faliszewski, P Skowron, A Slinko, N Talmon IJCAI, 250-256, 2016 | 45 | 2016 |

Elections with Few Voters: Candidate Control Can Be Easy J Chen, P Faliszewski, R Niedermeier, N Talmon AAAI 15, 2045-2051, 2015 | 44 | 2015 |

What do multiwinner voting rules do? An experiment over the two-dimensional euclidean domain E Elkind, P Faliszewski, JF Laslier, P Skowron, A Slinko, N Talmon Thirty-First AAAI Conference on Artificial Intelligence, 2017 | 36 | 2017 |

Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives P Faliszewski, P Skowron, AM Slinko, N Talmon AAAI, 482-488, 2016 | 36 | 2016 |

Large-scale election campaigns: Combinatorial shift bribery R Bredereck, P Faliszewski, R Niedermeier, N Talmon Journal of Artificial Intelligence Research 55, 603-652, 2016 | 30 | 2016 |

Elections with few candidates: Prices, weights, and covering problems R Bredereck, P Faliszewski, R Niedermeier, P Skowron, N Talmon International Conference on Algorithmic DecisionTheory, 414-431, 2015 | 27 | 2015 |

Combinatorial voter control in elections J Chen, P Faliszewski, R Niedermeier, N Talmon International Symposium on Mathematical Foundations of Computer Science, 153-164, 2014 | 27* | 2014 |

Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. P Faliszewski, P Skowron, A Slinko, N Talmon IJCAI, 192-198, 2017 | 26 | 2017 |

The complexity of degree anonymization by vertex addition R Bredereck, V Froese, S Hartung, A Nichterlein, R Niedermeier, ... Theoretical Computer Science 607, 16-34, 2015 | 25 | 2015 |

Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules P Faliszewski, P Skowron, N Talmon Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017 | 24 | 2017 |

Complexity of shift bribery in committee elections R Bredereck, P Faliszewski, R Niedermeier, N Talmon Thirtieth AAAI Conference on Artificial Intelligence, 2016 | 24 | 2016 |

Proportionally representative participatory budgeting: Axioms and algorithms H Aziz, B Lee, N Talmon arXiv preprint arXiv:1711.08226, 2017 | 23 | 2017 |

Robustness among multiwinner voting rules R Bredereck, P Faliszewski, A Kaczmarczyk, R Niedermeier, P Skowron, ... International Symposium on Algorithmic Game Theory, 80-92, 2017 | 23 | 2017 |

Achieving fully proportional representation by clustering voters P Faliszewski, A Slinko, K Stahl, N Talmon Journal of Heuristics 24 (5), 725-756, 2018 | 19 | 2018 |

When can graph hyperbolicity be computed in linear time? T Fluschnik, C Komusiewicz, GB Mertzios, A Nichterlein, R Niedermeier, ... Workshop on Algorithms and Data Structures, 397-408, 2017 | 17 | 2017 |

Opinion Diffusion and Campaigning on Society Graphs. P Faliszewski, R Gonen, M Koutecký, N Talmon IJCAI, 219-225, 2018 | 16 | 2018 |

Pairwise Liquid Democracy. M Brill, N Talmon IJCAI 18, 137-143, 2018 | 16 | 2018 |

The complexity of multiwinner voting rules with variable number of winners P Faliszewski, A Slinko, N Talmon arXiv preprint arXiv:1711.06641, 2017 | 15 | 2017 |