Nimrod Talmon
Title
Cited by
Cited by
Year
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
1492017
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
612018
Elections with Few Voters: Candidate Control Can Be Easy
J Chen, P Faliszewski, R Niedermeier, N Talmon
AAAI 15, 2045-2051, 2015
492015
Committee Scoring Rules: Axiomatic Classification and Hierarchy
P Faliszewski, P Skowron, A Slinko, N Talmon
IJCAI, 250-256, 2016
462016
Proportionally representative participatory budgeting: Axioms and algorithms
H Aziz, B Lee, N Talmon
arXiv preprint arXiv:1711.08226, 2017
452017
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
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
442017
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives
P Faliszewski, P Skowron, AM Slinko, N Talmon
AAAI, 482-488, 2016
402016
Large-scale election campaigns: Combinatorial shift bribery
R Bredereck, P Faliszewski, R Niedermeier, N Talmon
Journal of Artificial Intelligence Research 55, 603-652, 2016
342016
A framework for approval-based budgeting methods
N Talmon, P Faliszewski
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2181-2188, 2019
33*2019
Robustness among multiwinner voting rules
R Bredereck, P Faliszewski, A Kaczmarczyk, R Niedermeier, P Skowron, ...
Artificial Intelligence 290, 103403, 2021
322021
Complexity of shift bribery in committee elections
R Bredereck, P Faliszewski, R Niedermeier, N Talmon
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
312016
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
302015
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.
P Faliszewski, P Skowron, A Slinko, N Talmon
IJCAI, 192-198, 2017
292017
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
292015
Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules
P Faliszewski, P Skowron, N Talmon
arXiv preprint arXiv:2104.09130, 2021
282021
Pairwise Liquid Democracy.
M Brill, N Talmon
IJCAI 18, 137-143, 2018
282018
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
Opinion diffusion and campaigning on society graphs
P Faliszewski, R Gonen, M Koutecký, N Talmon
arXiv preprint arXiv:2010.00651, 2020
262020
Achieving fully proportional representation by clustering voters
P Faliszewski, A Slinko, K Stahl, N Talmon
Journal of Heuristics 24 (5), 725-756, 2018
222018
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
212016
The system can't perform the operation now. Try again later.
Articles 1–20