Ronald De Haan

Recent Publications

Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures
Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure
Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
Parameterized Complexity Classes Beyond Para-NP
Journal of Computer and System Sciences, volume 87, number AC-TR-17-004, pages 16-57, 2017.
Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract)
Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
Note: Extended Abstract
Stable Matching with Uncertain Pairwise Preferences
Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
On Existential MSO and its Relation to ETH
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1-42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
2016, Technical report AC-TR-16-005, Algorithms and Complexity Group, TU Wien.
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics
Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral and James P. Delgrande and Frank Wolter), pages 453-462, 2016, AAAI Press.
Positive and Negative Results for Parameterized Compilability
2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien.
Stable Matching with Uncertain Linear Preferences
Proceedings of SAGT 2016, the 9th International Symposium on Algorithmic Game Theory (Martin Gairing and Rahul Savani), volume 9928 of Lecture Notes in Computer Science, pages 195-206, 2016, Springer Verlag.
Succinctness of Languages for Judgment Aggregation
Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral and James P. Delgrande and Frank Wolter), pages 176-186, 2016, AAAI Press.
A Dichotomy Result for Ramsey Quantifiers
Proceedings of WoLLIC 2015, the 22nd International Workshop on Logic, Language, Information, and Computation, 2015, Springer.
Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young
Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems, 2015, IFAAMAS/ACM.
Fixed-parameter Tractable Reductions to SAT for Planning
Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina, 2015.
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
2015, Technical report AC-TR-15-009, Algorithms and Complexity Group, TU Wien.
On the Subexponential-Time Complexity of CSP
Journal of Artificial Intelligence Research, volume 52, pages 203-234, 2015.
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems (Gerhard Weiss and Pinar Yolum and Rafael H. Bordini and Edith Elkind), pages 127-136, 2015, IFAAMAS/ACM.
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics
2015, Technical report AC-TR-15-002, Algorithms and Complexity Group, TU Wien.
Subexponential Time Complexity of CSP with Global Constraints
Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O’Sullivan), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag.
Local Backbones
Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo and Allen Van Gelder), volume 7962 of Lecture Notes in Computer Science, pages 377-393, 2013, Springer Verlag.
Parameterized Complexity Results for Plan Reuse
Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins and Michael L. Littman), pages 224-231, 2013, The AAAI Press.
Description Logic Based Reasoning on Programming Languages
2012, Master’s thesis, Technische Universität Wien.