De Haan, Ronald

Recent Publications

On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances
De Haan, Ronald, Kanj, Iyad, Stefan Szeider
ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017.
Cite DOI
Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
De Haan, Ronald
Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016) (Gal A. Kaminka and Maria Fox and Paolo Bouquet and Eyke Hüllermeier and Virginia Dignum and Frank Dignum and Frank van Harmelen), volume 285 of Frontiers in Artificial Intelligence and Applications, pages 1502-1510, 2016.
PDF Cite
Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
De Haan, Ronald
Proceedings of ComSoc 2016, the Sixth International Workshop on Computational Social Choice, 2016.
PDF Cite
An Overview of Non-Uniform Parameterized Complexity
De Haan, Ronald
2015, Technical report TR15-130, Electronic Colloquium on Computational Complexity (ECCC).
PDF Cite
The Parameterized Complexity of Reasoning Problems Beyond NP
De Haan, Ronald, Stefan Szeider
Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral and Giuseppe De Giacomo and Thomas Eiter), pages 82-91, 2014, AAAI Press.
PDF Cite