| Publication | Date of Publication | Type |
|---|
Naturalism, tractability and the adaptive toolbox
Synthese | 2023-03-31 | Paper |
On the computational complexity of model checking for dynamic epistemic logic with S5 models
(available as arXiv preprint) | 2022-10-12 | Paper |
On existential MSO and its relation to ETH
ACM Transactions on Computation Theory | 2022-03-07 | Paper |
Stable matching with uncertain pairwise preferences
Theoretical Computer Science | 2022-03-01 | Paper |
Obtaining a proportional allocation by deleting items
Algorithmica | 2021-04-19 | Paper |
The complexity landscape of outcome determination in judgment aggregation
Journal of Artificial Intelligence Research | 2020-12-09 | Paper |
| Restricted Power - Computational Complexity Results for Strategic Defense Games | 2020-08-11 | Paper |
Stable matching with uncertain linear preferences
Algorithmica | 2020-04-01 | Paper |
Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy
Lecture Notes in Computer Science | 2020-01-21 | Paper |
Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity
Artificial Intelligence | 2020-01-20 | Paper |
Characterizing polynomial Ramsey quantifiers
Mathematical Structures in Computer Science | 2019-05-27 | Paper |
Obtaining a proportional allocation by deleting items
Algorithmic Decision Theory | 2018-10-25 | Paper |
| Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation | 2018-07-12 | Paper |
| On existential MSO and its relation to ETH | 2018-03-21 | Paper |
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
Parameterized complexity classes beyond para-NP
Journal of Computer and System Sciences | 2017-05-24 | Paper |
Stable Matching with Uncertain Linear Preferences
Algorithmic Game Theory | 2016-09-29 | Paper |
A dichotomy result for Ramsey quantifiers
Logic, Language, Information, and Computation | 2015-09-24 | Paper |
On the subexponential-time complexity of CSP
Journal of Artificial Intelligence Research | 2015-03-04 | Paper |
Machine characterizations for parameterized complexity classes beyond para-NP
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Fixed-parameter tractable reductions to SAT
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Local backbones
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
