Nimrod Talmon
TitleCited byYear
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
722017
Committee Scoring Rules: Axiomatic Classification and Hierarchy
P Faliszewski, P Skowron, A Slinko, N Talmon
IJCAI, 250-256, 2016
392016
Elections with Few Voters: Candidate Control Can Be Easy
J Chen, P Faliszewski, R Niedermeier, N Talmon
AAAI 15, 2045-2051, 2015
342015
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives
P Faliszewski, P Skowron, AM Slinko, N Talmon
AAAI, 482-488, 2016
322016
Large-scale election campaigns: Combinatorial shift bribery
R Bredereck, P Faliszewski, R Niedermeier, N Talmon
Journal of Artificial Intelligence Research 55, 603-652, 2016
312016
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
292017
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
262018
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
262015
Combinatorial voter control in elections
J Chen, P Faliszewski, R Niedermeier, N Talmon
International Symposium on Mathematical Foundations of Computer Science, 153-164, 2014
26*2014
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
222015
Complexity of shift bribery in committee elections
R Bredereck, P Faliszewski, R Niedermeier, N Talmon
Thirtieth AAAI Conference on Artificial Intelligence, 2016
212016
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.
P Faliszewski, P Skowron, A Slinko, N Talmon
IJCAI, 192-198, 2017
202017
Achieving fully proportional representation by clustering voters
P Faliszewski, A Slinko, K Stahl, N Talmon
Journal of Heuristics 24 (5), 725-756, 2018
152018
Robustness among multiwinner voting rules
R Bredereck, P Faliszewski, A Kaczmarczyk, R Niedermeier, P Skowron, ...
International Symposium on Algorithmic Game Theory, 80-92, 2017
142017
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
142017
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
142017
Precedence-constrained scheduling problems parameterized by partial order width
R Van Bevern, R Bredereck, L Bulteau, C Komusiewicz, N Talmon, ...
International conference on discrete optimization and operations research …, 2016
142016
Selection in the presence of memory faults, with applications to in-place resilient sorting
T Kopelowitz, N Talmon
International Symposium on Algorithms and Computation, 558-567, 2012
142012
Opinion Diffusion and Campaigning on Society Graphs.
P Faliszewski, R Gonen, M Koutecký, N Talmon
IJCAI, 219-225, 2018
112018
Scheduling two competing agents when one agent has significantly fewer jobs
D Hermelin, JM Kubitza, D Shabtay, N Talmon, G Woeginger
10th International Symposium on Parameterized and Exact Computation (IPEC 2015), 2015
112015
The system can't perform the operation now. Try again later.
Articles 1–20