Ronald de Haan
Ronald de Haan
University of Amsterdam
Geverifieerd e-mailadres voor ronalddehaan.eu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Complexity of the winner determination problem in judgment aggregation: Kemeny, Slater, Tideman, Young
U Endriss, R de Haan
252016
Stable matching with uncertain linear preferences
H Aziz, P Biró, S Gaspers, R De Haan, N Mattei, B Rastegari
Algorithmica, 1-24, 2019
212019
Fixed-parameter tractable reductions to SAT
R de Haan, S Szeider
International Conference on Theory and Applications of Satisfiability …, 2014
202014
The parameterized complexity of reasoning problems beyond NP
R de Haan, S Szeider
Fourteenth International Conference on the Principles of Knowledge …, 2014
202014
Stable matching with uncertain pairwise preferences
H Aziz, P Biró, T Fleiner, S Gaspers, R Haan
192017
Succinctness of languages for judgment aggregation
U Endriss, U Grandi, R De Haan, J Lang
Fifteenth International Conference on the Principles of Knowledge …, 2016
172016
Parameterized complexity results for agenda safety in judgment aggregation
U Endriss, R De Haan, S Szeider
172014
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
R de Haan, S Szeider
Algorithms 12 (9), 188, 2019
112019
Machine characterizations for parameterized complexity classes beyond para-NP
R de Haan, S Szeider
International Conference on Current Trends in Theory and Practice of …, 2015
92015
Parameterized complexity classes beyond para-NP
R de Haan, S Szeider
Journal of Computer and System Sciences 87, 16-57, 2017
82017
Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure.
R de Haan
AAMAS, 1151-1159, 2017
82017
Parameterized complexity results for the Kemeny rule in judgment aggregation
R de Haan
Proceedings of the Twenty-second European Conference on Artificial …, 2016
82016
Fixed-parameter tractable reductions to SAT for planning
R De Haan, M Kronegger, A Pfandler
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
82015
Pareto optimal allocation under uncertain preferences
H Aziz, R De Haan, B Rastegari
arXiv preprint arXiv:1609.02795, 2016
72016
Parameterized complexity results for symbolic model checking of temporal logics
R de Haan, S Szeider
Fifteenth International Conference on the Principles of Knowledge …, 2016
72016
On the subexponential-time complexity of CSP
R De Haan, I Kanj, S Szeider
Journal of Artificial Intelligence Research 52, 203-234, 2015
72015
Parameterized complexity results for plan reuse
R De Haan, A Roubickova, S Szeider
Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013
72013
Complexity results for aggregating judgments using scoring or distance-based procedures
R de Haan, M Slavkovik
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017
62017
An Overview of Non-Uniform Parameterized Complexity.
R De Haan
Electronic Colloquium on Computational Complexity (ECCC) 22, 130, 2015
62015
Aggregating incomplete judgments: axiomatisations for scoring rules
Z Terzopoulou, U Endriss, R de Haan
Proceedings of the 7th international workshop on computational social choice …, 2018
52018
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20