default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNimrod Talmon
Person information
- affiliation: Ben-Gurion University of the Negev, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j33]Stanislaw Szufa, Niclas Boehmer, Robert Bredereck
, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Drawing a map of elections. Artif. Intell. 343: 104332 (2025)- [j32]Joanna Kaczmarek, Jörg Rothe, Nimrod Talmon:
Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games. J. Artif. Intell. Res. 82 (2025) - [j31]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Krzysztof Sornat, Stanislaw Szufa, Nimrod Talmon:
How similar are two elections? J. Comput. Syst. Sci. 150: 103632 (2025) - [c82]Daniel Halpern, Ariel D. Procaccia, Ehud Shapiro, Nimrod Talmon:
Federated Assemblies. AAAI 2025: 13897-13904 - 2024
- [j30]Senjuti Basu Roy, Baruch Schieber, Nimrod Talmon:
Fairness in Preference Queries: Social Choice Theories Meet Data Management. Proc. VLDB Endow. 17(12): 4225-4228 (2024) - [j29]Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
United for change: deliberative coalition formation to change the status quo. Soc. Choice Welf. 63(3): 717-746 (2024) - [c81]Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon:
Fine-Grained Liquid Democracy for Cumulative Ballots. AAMAS 2024: 1029-1037 - [c80]Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Nimrod Talmon, Yash More Hiren:
Controlling Delegations in Liquid Democracy. AAMAS 2024: 2624-2632 - [c79]Ben Armstrong, Shiri Alouf-Heffetz, Nimrod Talmon:
Optimizing Viscous Democracy. IJCAI 2024: 2643-2650 - [c78]Alberto Del Pia, Dusan Knop, Alexandra Lassota, Krzysztof Sornat, Nimrod Talmon:
Aggregation of Continuous Preferences in One Dimension. IJCAI 2024: 2748-2756 - [i58]Davide Grossi, Ulrike Hahn, Michael Mäs, Andreas Nitsche, Jan Behrens, Niclas Boehmer, Markus Brill, Ulle Endriss, Umberto Grandi, Adrian Haret, Jobst Heitzig, Nicolien Janssens, Catholijn M. Jonker, Marijn A. Keijzer, Axel Kistner, Martin Lackner, Alexandra Lieben, Anna Mikhaylovskaya, Pradeep K. Murukannaiah, Carlo Proietti, Manon Revel, Élise Rouméas, Ehud Shapiro, Gogulapati Sreedurga, Björn Swierczek, Nimrod Talmon, Paolo Turrini, Zoi Terzopoulou, Frederik Van De Putte:
Enabling the Digital Democratic Revival: A Research Program for Digital Democracy. CoRR abs/2401.16863 (2024) - [i57]Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, Nimrod Talmon:
Controlling Delegations in Liquid Democracy. CoRR abs/2403.07558 (2024) - [i56]Daniel Halpern, Ariel D. Procaccia, Ehud Shapiro, Nimrod Talmon:
Federated Assemblies. CoRR abs/2405.19129 (2024) - 2023
- [j28]Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 85(12): 3717-3740 (2023) - [j27]Daniel Reichman, Falk Lieder, David D. Bourgin, Nimrod Talmon, Thomas L. Griffiths:
The Computational Challenges of Means Selection Problems: Network Structure of Goal Systems Predicts Human Performance. Cogn. Sci. 47(8) (2023) - [j26]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Correction to: Opinion diffusion and campaigning on society graphs. J. Log. Comput. 33(3): 706 (2023) - [j25]Davide Grossi, Ariel Rosenfeld, Nimrod Talmon:
Advances in Multi-agent Systems Research: EUMAS 2021 Extended Selected Papers. SN Comput. Sci. 4(5): 587 (2023) - [c77]Nimrod Talmon:
Social Choice Around Decentralized Autonomous Organizations: On the Computational Social Choice of Digital Communities. AAMAS 2023: 1768-1773 - [c76]Robert Bredereck, Till Fluschnik, Nimrod Talmon:
Efficiently Computing Smallest Agreeable Sets. ECAI 2023: 311-318 - [c75]Joanna Kaczmarek, Jörg Rothe, Nimrod Talmon:
Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games. ECAI 2023: 1190-1197 - [c74]Eyal Briman, Nimrod Talmon:
Multiple Attribute List Aggregation and an Application to Democratic Playlist Editing. EUMAS 2023: 1-16 - [c73]Piotr Faliszewski, Jaroslaw Flis, Dominik Peters, Grzegorz Pierczynski, Piotr Skowron, Dariusz Stolicki, Stanislaw Szufa, Nimrod Talmon:
Participatory Budgeting: Data, Tools and Analysis. IJCAI 2023: 2667-2674 - [c72]Rica Gonen, Martin Koutecký, Roei Menashof, Nimrod Talmon:
Heuristics for Opinion Diffusion via Local Elections. SOFSEM 2023: 144-158 - [i55]Piotr Faliszewski, Jaroslaw Flis, Dominik Peters, Grzegorz Pierczynski, Piotr Skowron, Dariusz Stolicki, Stanislaw Szufa, Nimrod Talmon:
Participatory Budgeting: Data, Tools, and Analysis. CoRR abs/2305.11035 (2023) - [i54]Lior Ashkenazy, Nimrod Talmon:
Efficient Social Choice via NLP and Sampling. CoRR abs/2309.12360 (2023) - 2022
- [j24]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion diffusion and campaigning on society graphs. J. Log. Comput. 32(6): 1162-1194 (2022) - [c71]Ehud Shapiro, Nimrod Talmon:
Foundations for Grassroots Democratic Metaverse. AAMAS 2022: 1814-1818 - [c70]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Preserving Consistency for Liquid Knapsack Voting. EUMAS 2022: 221-238 - [c69]Reshef Meir, Nimrod Talmon, Gal Shahaf, Ehud Shapiro:
Sybil-Resilient Social Choice with Low Voter Turnout. EUMAS 2022: 257-274 - [c68]Ouri Poupko, Ehud Shapiro, Nimrod Talmon:
Self-Sovereign Digital Agents for a Grassroots Digital Society. ICDCS 2022: 202-212 - [c67]Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh:
Better Collective Decisions via Uncertainty Reduction. IJCAI 2022: 24-30 - [c66]Shiri Alouf-Heffetz, Ben Armstrong, Kate Larson, Nimrod Talmon:
How Should We Vote? A Comparison of Voting Systems within Social Networks. IJCAI 2022: 31-38 - [c65]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon:
How to Sample Approval Elections? IJCAI 2022: 496-502 - [i53]Ariel Rosenfeld, Ehud Shapiro, Nimrod Talmon:
Proportional Ranking in Primary Elections: A Case Study. CoRR abs/2201.07305 (2022) - [i52]Nimrod Talmon, Ehud Shapiro:
Foundations for Grassroots Democratic Metaverse. CoRR abs/2203.04090 (2022) - [i51]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon:
How to Sample Approval Elections? CoRR abs/2207.01140 (2022) - [i50]Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh:
Better Collective Decisions via Uncertainty Reduction. CoRR abs/2207.04983 (2022) - [i49]Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon:
Fine-Grained Liquid Democracy for Cumulative Ballots. CoRR abs/2208.14441 (2022) - 2021
- [j23]Laurent Bulteau, Noam Hazon, Rutvik Page, Ariel Rosenfeld, Nimrod Talmon:
Justified Representation for Perpetual Voting. IEEE Access 9: 96598-96612 (2021) - [j22]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness among multiwinner voting rules. Artif. Intell. 290: 103403 (2021) - [j21]Laurent Bulteau, Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation. J. Artif. Intell. Res. 70: 1413-1439 (2021) - [j20]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13(3): 20:1-20:25 (2021) - [j19]Ouri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Building a Sybil-Resilient Digital Community Utilizing Trust-Graph Connectivity. IEEE/ACM Trans. Netw. 29(5): 2215-2227 (2021) - [c64]Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
United for Change: Deliberative Coalition Formation to Change the Status Quo. AAAI 2021: 5339-5346 - [c63]Martin Koutecký, Nimrod Talmon:
Multi-Party Campaigning. AAAI 2021: 5506-5513 - [c62]Ben Abramowitz, Ehud Shapiro, Nimrod Talmon:
In the Beginning There Were n Agents: Founding and Amending a Constitution. ADT 2021: 119-131 - [c61]Gil Ben Zvi, Eyal Leizerovich, Nimrod Talmon:
Iterative Deliberation via Metric Aggregation. ADT 2021: 162-176 - [c60]Ben Abramowitz, Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
Democratic Forking: Choosing Sides with Social Choice. ADT 2021: 341-356 - [c59]Pallavi Jain, Nimrod Talmon, Laurent Bulteau:
Partition Aggregation for Participatory Budgeting. AAMAS 2021: 665-673 - [c58]Ben Abramowitz, Ehud Shapiro, Nimrod Talmon:
How to Amend a Constitution? Model, Axioms, and Supermajority Rules. AAMAS 2021: 1443-1445 - [c57]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Preserving Consistency for Liquid Knapsack Voting. AAMAS 2021: 1542-1544 - [c56]Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Egalitarian and Just Digital Currency Networks. AAMAS 2021: 1649-1651 - [c55]Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI 2021: 217-223 - [c54]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory Budgeting with Project Groups. IJCAI 2021: 276-282 - [e1]Ariel Rosenfeld, Nimrod Talmon:
Multi-Agent Systems - 18th European Conference, EUMAS 2021, Virtual Event, June 28-29, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12802, Springer 2021, ISBN 978-3-030-82253-8 [contents] - [i48]Nimrod Talmon, Rutvik Page:
Proportionality in Committee Selection with Negative Feelings. CoRR abs/2101.01435 (2021) - [i47]Ben Abramowitz, Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
Democratic Forking: Choosing Sides with Social Choice. CoRR abs/2103.03652 (2021) - [i46]Piotr Faliszewski, Piotr Skowron, Nimrod Talmon:
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. CoRR abs/2104.09130 (2021) - [i45]Gil Ben Zvi, Eyal Leizerovich, Nimrod Talmon:
Iterative Deliberation via Metric Aggregation. CoRR abs/2108.00314 (2021) - [i44]Ariel Rosenfeld, Nimrod Talmon:
What Should We Optimize in Participatory Budgeting? An Experimental Study. CoRR abs/2111.07308 (2021) - 2020
- [j18]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. 814: 86-105 (2020) - [c53]Stanislaw Szufa, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Drawing a Map of Elections in the Space of Statistical Cultures. AAMAS 2020: 1341-1349 - [c52]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
Isomorphic Distances Among Elections. CSR 2020: 64-78 - [c51]Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
Multiwinner Rules with Variable Number of Winners. ECAI 2020: 67-74 - [c50]Pallavi Jain, Nimrod Talmon:
Committee Selection with Multimodal Preferences. ECAI 2020: 123-130 - [c49]Nimrod Talmon, Ehud Shapiro, Gal Shahaf, Luca Cardelli, Liav Orgad:
Digital Social Contracts: A Foundation for an Egalitarian and Just Digital Society. IFDaD 2020: 51-60 - [c48]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Participatory Budgeting with Project Interactions. IJCAI 2020: 386-392 - [c47]Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Genuine Personal Identifiers and Mutual Sureties for Sybil-Resilient Community Growth. SocInfo 2020: 320-332 - [i43]Reshef Meir, Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Sybil-Resilient Social Choice with Partial Participation. CoRR abs/2001.05271 (2020) - [i42]Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon:
Egalitarian Deliberative Decision Making. CoRR abs/2001.08031 (2020) - [i41]Martin Koutecký, Nimrod Talmon:
Multi-Party Campaigning. CoRR abs/2005.04455 (2020) - [i40]Luca Cardelli, Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Digital Social Contracts: A Foundation for an Egalitarian and Just Digital Society. CoRR abs/2005.06261 (2020) - [i39]Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Egalitarian and Just Digital Currency Networks. CoRR abs/2005.14631 (2020) - [i38]Ouri Poupko, Nimrod Talmon:
Sybil Resilient Money Minting. CoRR abs/2007.15536 (2020) - [i37]Ouri Poupko, Nimrod Talmon:
A Consensus Protocol for e-Democracy. CoRR abs/2007.15949 (2020) - [i36]Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
Participatory Budgeting with Cumulative Votes. CoRR abs/2009.02690 (2020) - [i35]Ehud Shapiro, Nimrod Talmon:
Electing the Executive Branch. CoRR abs/2009.09734 (2020) - [i34]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. CoRR abs/2010.00651 (2020) - [i33]Ben Abramowitz, Ehud Shapiro, Nimrod Talmon:
How to Amend a Constitution? Model, Axioms, and Supermajority Rules. CoRR abs/2011.03111 (2020) - [i32]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory Budgeting with Project Groups. CoRR abs/2012.05213 (2020) - [i31]Dariusz Stolicki, Stanislaw Szufa, Nimrod Talmon:
Pabulib: A Participatory Budgeting Library. CoRR abs/2012.06539 (2020)
2010 – 2019
- 2019
- [j17]Arnold Filtser, Nimrod Talmon:
Distributed monitoring of election winners. Artif. Intell. 276: 79-104 (2019) - [j16]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica 81(5): 2016-2045 (2019) - [j15]Danny Hermelin, Michael L. Pinedo, Dvir Shabtay, Nimrod Talmon:
On the parameterized tractability of single machine scheduling with rejection. Eur. J. Oper. Res. 273(1): 67-73 (2019) - [j14]Danny Hermelin, Dvir Shabtay, Nimrod Talmon:
On the parameterized tractability of the just-in-time flow-shop scheduling problem. J. Sched. 22(6): 663-676 (2019) - [j13]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. ACM Trans. Economics and Comput. 7(1): 3:1-3:39 (2019) - [c46]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
How Similar Are Two Elections? AAAI 2019: 1909-1916 - [c45]Nimrod Talmon, Piotr Faliszewski:
A Framework for Approval-Based Budgeting Methods. AAAI 2019: 2181-2188 - [c44]Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon:
Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS 2019: 494-502 - [c43]Piotr Faliszewski, Piotr Skowron, Stanislaw Szufa, Nimrod Talmon:
Proportional Representation in Elections: STV vs PAV. AAMAS 2019: 1946-1948 - [c42]Ouri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Sybil-Resilient Conductance-Based Community Growth. CSR 2019: 359-371 - [c41]Maciej Kocot, Anna Kolonko, Edith Elkind, Piotr Faliszewski, Nimrod Talmon:
Multigoal Committee Selection. IJCAI 2019: 385-391 - [c40]Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Sybil-Resilient Reality-Aware Social Choice. IJCAI 2019: 572-579 - [i30]Ouri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Sybil-Resilient Conductance-Based Community Growth. CoRR abs/1901.00752 (2019) - [i29]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. CoRR abs/1901.09217 (2019) - [i28]Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Foundation for Genuine Global Identities. CoRR abs/1904.09630 (2019) - 2018
- [j12]Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving fully proportional representation by clustering voters. J. Heuristics 24(5): 725-756 (2018) - [j11]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives. Soc. Choice Welf. 51(3): 513-550 (2018) - [j10]Nimrod Talmon:
Structured proportional representation. Theor. Comput. Sci. 708: 58-74 (2018) - [c39]Piotr Faliszewski, Martin Lackner, Dominik Peters, Nimrod Talmon:
Effective Heuristics for Committee Scoring Rules. AAAI 2018: 1023-1030 - [c38]Rani Izsak, Nimrod Talmon, Gerhard J. Woeginger:
Committee Selection with Intraclass and Interclass Synergies. AAAI 2018: 1071-1078 - [c37]Piotr Faliszewski, Nimrod Talmon:
Between Proportionality and Diversity: Balancing District Sizes under the Chamberlin-Courant Rule. AAMAS 2018: 14-22 - [c36]Haris Aziz, Barton E. Lee, Nimrod Talmon:
Proportionally Representative Participatory Budgeting: Axioms and Algorithms. AAMAS 2018: 23-31 - [c35]Piotr Faliszewski, Stanislaw Szufa, Nimrod Talmon:
Optimization-Based Voting Rule Design: The Closer to Utopia the Better. AAMAS 2018: 32-40 - [c34]Ehud Shapiro, Nimrod Talmon:
Incorporating Reality into Social Choice. AAMAS 2018: 1188-1192 - [c33]Rajesh Chitnis, Nimrod Talmon:
Can We Create Large k-Cores by Adding Few Edges? CSR 2018: 78-89 - [c32]Haris Aziz, Piotr Faliszewski, Bernard Grofman, Arkadii Slinko, Nimrod Talmon:
Egalitarian Committee Scoring Rules. IJCAI 2018: 56-62 - [c31]Markus Brill, Nimrod Talmon:
Pairwise Liquid Democracy. IJCAI 2018: 137-143 - [c30]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. IJCAI 2018: 219-225 - [i27]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. CoRR abs/1802.06483 (2018) - [i26]Arnold Filtser, Nimrod Talmon:
Distributed Monitoring of Election Winners. CoRR abs/1805.02206 (2018) - [i25]Ehud Shapiro, Nimrod Talmon:
Integrating Deliberation and Voting in Participatory Drafting of Legislation. CoRR abs/1806.06277 (2018) - [i24]Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Reality-aware Sybil-Resilient Voting. CoRR abs/1807.11105 (2018) - [i23]Piotr Faliszewski, Nimrod Talmon:
A Framework for Approval-based Budgeting Methods. CoRR abs/1809.04382 (2018) - 2017
- [j9]Nimrod Talmon, Sepp Hartung:
The complexity of degree anonymization by graph contractions. Inf. Comput. 256: 212-225 (2017) - [j8]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. J. Artif. Intell. Res. 60: 937-1002 (2017) - [j7]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. Theory Comput. Syst. 60(2): 253-279 (2017) - [c29]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. AAAI 2017: 390-396 - [c28]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. AAAI 2017: 494-501 - [c27]Piotr Faliszewski, Piotr Skowron, Nimrod Talmon:
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. AAMAS 2017: 6-14 - [c26]Palash Dey, Nimrod Talmon, Otniel van Handel:
Proportional Representation in Vote Streams. AAMAS 2017: 15-23 - [c25]Nimrod Talmon:
Structured Proportional Representation. AAMAS 2017: 633-641 - [c24]Arnold Filtser, Nimrod Talmon:
Distributed Monitoring of Election Winners. AAMAS 2017: 1160-1168 - [c23]David Bourgin, Falk Lieder, Daniel Reichman, Nimrod Talmon, Tom Griffiths:
The Structure of Goal Systems Predicts Human Performance. CogSci 2017 - [c22]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. IJCAI 2017: 192-198 - [c21]Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller:
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. IPEC 2017: 30:1-30:12 - [c20]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. SAGT 2017: 80-92 - [c19]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS 2017: 397-408 - [i22]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When can Graph Hyperbolicity be computed in Linear Time? CoRR abs/1702.06503 (2017) - [i21]Palash Dey, Nimrod Talmon, Otniel van Handel:
Proportional Representation in Vote Streams. CoRR abs/1702.08862 (2017) - [i20]Roee David, Nimrod Talmon:
Balanced Facilities on Random Graphs. CoRR abs/1706.01347 (2017) - [i19]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. CoRR abs/1707.01417 (2017) - [i18]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting. CoRR abs/1709.02850 (2017) - [i17]Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems. CoRR abs/1709.04161 (2017) - [i16]Danny Hermelin, Dvir Shabtay, Nimrod Talmon:
On The Parameterized Tractability of the Just-In-Time Flow-Shop Scheduling Problem. CoRR abs/1709.04169 (2017) - [i15]Ehud Shapiro, Nimrod Talmon:
A Democratically-Optimal Budgeting Algorithm. CoRR abs/1709.05839 (2017) - [i14]Ehud Shapiro, Nimrod Talmon:
Incorporating Reality into Social Choice. CoRR abs/1710.10117 (2017) - [i13]Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
The Complexity of Multiwinner Voting Rules with Variable Number of Winners. CoRR abs/1711.06641 (2017) - [i12]Haris Aziz, Barton Lee, Nimrod Talmon:
Proportionally Representative Participatory Budgeting: Axioms and Algorithms. CoRR abs/1711.08226 (2017) - 2016
- [b1]Nimrod Talmon:
Algorithmic aspects of manipulation and anonymization in social choice and social networks. Technical University of Berlin, Germany, 2016, ISBN 978-3-7983-2804-4, pp. 1-275 - [j6]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-Player Diffusion Games on Graph Classes. Internet Math. 12(6): 363-380 (2016) - [j5]Robert Bredereck, Nimrod Talmon:
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting. Inf. Process. Lett. 116(2): 147-152 (2016) - [j4]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. J. Artif. Intell. Res. 55: 603-652 (2016) - [c18]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives. AAAI 2016: 482-488 - [c17]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. AAAI 2016: 2452-2458 - [c16]Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving Fully Proportional Representation by Clustering Voters. AAMAS 2016: 296-304 - [c15]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR 2016: 105-120 - [c14]Piotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon:
Voting-Based Group Formation. IJCAI 2016: 243-249 - [c13]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Classification and Hierarchy. IJCAI 2016: 250-256 - [c12]Tomer Ashur, Orr Dunkelman, Nimrod Talmon:
Breaching the Privacy of Israel's Paper Ballot Voting System. E-VOTE-ID 2016: 108-124 - [i11]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. CoRR abs/1601.01492 (2016) - [i10]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives. CoRR abs/1602.08687 (2016) - [i9]Piotr Faliszewski, Jean-François Laslier, Robert Schaefer, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Modeling Representation of Minorities Under Multiwinner Voting Rules. CoRR abs/1604.02364 (2016) - [i8]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-constrained scheduling problems parameterized by partial order width. CoRR abs/1605.00901 (2016) - [i7]Tomer Ashur, Orr Dunkelman, Nimrod Talmon:
Breaching the Privacy of Israel's Paper Ballot Voting System. CoRR abs/1608.08020 (2016) - [i6]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. CoRR abs/1611.08892 (2016) - 2015
- [j3]René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger:
Approximability and parameterized complexity of multicover by c-intervals. Inf. Process. Lett. 115(10): 744-749 (2015) - [j2]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial voter control in elections. Theor. Comput. Sci. 589: 99-120 (2015) - [j1]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607: 16-34 (2015) - [c11]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. AAAI 2015: 2045-2051 - [c10]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Elections with Few Candidates: Prices, Weights, and Covering Problems. ADT 2015: 414-431 - [c9]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. AAMAS 2015: 67-75 - [c8]Nimrod Talmon:
Privacy in Elections: k-Anonymizing Preference Orders. FCT 2015: 299-310 - [c7]Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. IPEC 2015: 55-65 - [c6]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-player Diffusion Games on Graph Classes. TAMC 2015: 200-211 - [c5]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. TAMC 2015: 224-235 - [c4]Sepp Hartung, Nimrod Talmon:
The Complexity of Degree Anonymization by Graph Contractions. TAMC 2015: 260-271 - 2014
- [c3]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Degree Anonymization by Vertex Addition. AAIM 2014: 44-55 - [c2]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. MFCS (2) 2014: 153-164 - [i5]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. CoRR abs/1406.6859 (2014) - [i4]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. CoRR abs/1411.7812 (2014) - [i3]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. CoRR abs/1411.7838 (2014) - [i2]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-Player Diffusion Games on Graph Classes. CoRR abs/1412.2544 (2014) - 2012
- [c1]Tsvi Kopelowitz, Nimrod Talmon:
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting. ISAAC 2012: 558-567 - [i1]Tsvi Kopelowitz, Nimrod Talmon:
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting. CoRR abs/1204.5229 (2012)
Coauthor Index
[j33] [j31] [j26] [c73] [i55] [j24] [c65] [i51] [j22] [j20] [i46] [j18] [c53] [c52] [c51] [i34] [j13] [c46] [c45] [c44] [c43] [c41] [i29] [j12] [j11] [c39] [c37] [c35] [c32] [c30] [i27] [i23] [j8] [c28] [c27] [c22] [c20] [i19] [i18] [i13] [j4] [c18] [c17] [c16] [c14] [c13] [i11] [i10] [i9] [j2] [c11] [c10] [c9] [c2] [i5] [i4]
Arkadii M. Slinko
aka: Arkadii Slinko
aka: Arkadii Slinko
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-02 23:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
