| Publication | Date of Publication | Type |
|---|
The possible winner with uncertain weights problem
Journal of Computer and System Sciences | 2023-08-21 | Paper |
| Complexity of manipulative interference in participatory budgeting | 2023-03-31 | Paper |
| Collective acceptability in abstract argumentation | 2022-10-12 | Paper |
Acceptance in incomplete argumentation frameworks
Artificial Intelligence | 2021-11-02 | Paper |
Complexity of control in judgment aggregation for uniform premise-based quota rules
Journal of Computer and System Sciences | 2020-06-09 | Paper |
| Credulous and skeptical acceptance in incomplete argumentation frameworks | 2020-02-12 | Paper |
Verification in incomplete argumentation frameworks
Artificial Intelligence | 2019-03-19 | Paper |
| Control in judgment aggregation | 2018-08-29 | Paper |
Strategy-proofness of scoring allocation correspondences for indivisible goods
Social Choice and Welfare | 2018-03-28 | Paper |
| Scoring rules for the allocation of indivisible goods | 2017-07-18 | Paper |
Computational Aspects of Approval Voting
Studies in Choice and Welfare | 2016-11-08 | Paper |
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
Mathematical Social Sciences | 2015-12-18 | Paper |
| The possible winner problem with uncertain weights | 2015-12-11 | Paper |
Verification in attack-incomplete argumentation frameworks
Algorithmic Decision Theory | 2015-11-04 | Paper |
Verification in argument-incomplete argumentation frameworks
Algorithmic Decision Theory | 2015-11-04 | Paper |
Winner determination and manipulation in minisum and minimax committee elections
Algorithmic Decision Theory | 2015-11-04 | Paper |
Complexity of bribery and control for uniform premise-based quota rules under various preference types
Algorithmic Decision Theory | 2015-11-04 | Paper |
Computational aspects of manipulation and control in judgment aggregation
Algorithmic Decision Theory | 2013-12-17 | Paper |
The complexity of computing minimal unidirectional covering sets
Theory of Computing Systems | 2013-10-21 | Paper |
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
Information Processing Letters | 2012-05-04 | Paper |
How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation
Algorithmic Decision Theory | 2011-10-28 | Paper |
The complexity of computing minimal unidirectional covering sets
Lecture Notes in Computer Science | 2010-05-28 | Paper |
The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions
Information and Computation | 2009-11-27 | Paper |
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae | 2009-06-23 | Paper |
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem
Lecture Notes in Computer Science | 2009-03-05 | Paper |
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
Language and Automata Theory and Applications | 2008-11-20 | Paper |
