Participatory budgeting with project groups
Open Access
- 28 August 2025
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 156
Abstract
No abstract availableFunding Information
- IIT Jodhpur (I/SEED/PJ/20210119)
- Anusandhan National Research Foundation (SPR/2021/000860)
- SNSF (200021_200731/1)
- European Research Council (101002854)
- Israel Science Foundation (630/19)
- Israel Science Foundation (101039913)
- Horizon 2020 Framework Programme
- European Research Council
This publication has 13 references indexed in Scilit:
- Electing a committee with dominance constraintsAnnals of Operations Research, 2021
- Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and votingTheoretical Computer Science, 2020
- Gehrlein stability in committee selection: parameterized hardness and algorithmsAutonomous Agents and Multi-Agent Systems, 2020
- Parameterized algorithmics for computational social choice: Nine research challengesTsinghua Science and Technology, 2014
- There is no EPTAS for two-dimensional knapsackInformation Processing Letters, 2010
- Fault-tolerant facility locationACM Transactions on Algorithms, 2008
- Participatory budgeting: a significant contribution to participatory democracyEnvironment & Urbanization, 2004
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975