ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1407.2143
  4. Cited By
Parameterized Algorithmics for Computational Social Choice: Nine
  Research Challenges

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

8 July 2014
Robert Bredereck
Jiehua Chen
Piotr Faliszewski
Jiong Guo
R. Niedermeier
G. Woeginger
ArXiv (abs)PDFHTML

Papers citing "Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges"

13 / 13 papers shown
Title
Computational Social Choice: Parameterized Complexity and Challenges
Computational Social Choice: Parameterized Complexity and Challenges
Jiehua Chena
Christian Hatschka
Sofia Simola
70
1
0
17 Oct 2024
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules
Krzysztof Sornat
Virginia Vassilevska Williams
Yinzhan Xu
57
11
0
29 Dec 2022
Fine-Grained Complexity and Algorithms for the Schulze Voting Method
Fine-Grained Complexity and Algorithms for the Schulze Voting Method
Krzysztof Sornat
Virginia Vassilevska Williams
Yinzhan Xu
47
3
0
05 Mar 2021
Participatory Budgeting with Project Groups
Participatory Budgeting with Project Groups
P. Jain
Krzysztof Sornat
Nimrod Talmon
M. Zehavi
44
14
0
09 Dec 2020
A Unifying Framework for Manipulation Problems
A Unifying Framework for Manipulation Problems
D. Knop
Martin Koutecký
Matthias Mnich
78
16
0
29 Jan 2018
Stable Marriage with Multi-Modal Preferences
Stable Marriage with Multi-Modal Preferences
Jiehua Chen
R. Niedermeier
P. Skowron
116
45
0
08 Jan 2018
Resolving the Complexity of Some Fundamental Problems in Computational
  Social Choice
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
P. Dey
40
1
0
23 Mar 2017
On the Computational Complexity of Variants of Combinatorial Voter
  Control in Elections
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
Chen Wang
Viatcheslav Korenwein
Junsong Yuan
Robert Bredereck
Jiehua Chen
65
3
0
18 Jan 2017
Approximation and Parameterized Complexity of Minimax Approval Voting
Approximation and Parameterized Complexity of Minimax Approval Voting
Marek Cygan
Lukasz Kowalik
Arkadiusz Socala
Krzysztof Sornat
59
15
0
26 Jul 2016
Complexity of Shift Bribery in Committee Elections
Complexity of Shift Bribery in Committee Elections
Robert Bredereck
Piotr Faliszewski
R. Niedermeier
Nimrod Talmon
89
45
0
07 Jan 2016
Parliamentary Voting Procedures: Agenda Control, Manipulation, and
  Uncertainty
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty
Robert Bredereck
Jiehua Chen
R. Niedermeier
T. Walsh
45
17
0
08 Sep 2015
Prices Matter for the Parameterized Complexity of Shift Bribery
Prices Matter for the Parameterized Complexity of Shift Bribery
Robert Bredereck
Jiehua Chen
Piotr Faliszewski
A. Nichterlein
R. Niedermeier
100
62
0
04 Feb 2015
Elections with Few Voters: Candidate Control Can Be Easy
Elections with Few Voters: Candidate Control Can Be Easy
Jiehua Chen
Piotr Faliszewski
R. Niedermeier
Nimrod Talmon
109
65
0
28 Nov 2014
1