The RegularGcc Matrix Constraint. - Ronald de Haan; Nina Narodytska; Toby Walsh (Australasian Conference on Artificial Intelligence, 2012)

Detecting Temporally Related Arithmetical Patterns - An Extension of Complex Event Processing. - Ronald de Haan; Mikhail Roshchin (KDIR, 2012)

Functional Logic Programming with Generalized Circular Coinduction - Ronald de Haan (CoRR, 2012)

Parameterized Complexity Results for Plan Reuse. - Ronald de Haan; Anna Roubícková; Stefan Szeider (AAAI, 2013)

Local Backbones. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (SAT, 2013)

Subexponential Time Complexity of CSP with Global Constraints. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (CP, 2014)

Small Unsatisfiable Subsets in Constraint Satisfaction. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (ICTAI, 2014)

The Parameterized Complexity of Reasoning Problems Beyond NP. - Ronald de Haan; Stefan Szeider (KR, 2014)

Fixed-Parameter Tractable Reductions to SAT. - Ronald de Haan; Stefan Szeider (SAT, 2014)

Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young. - Ulle Endriss; Ronald de Haan (AAMAS, 2015)

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. - Ulle Endriss; Ronald de Haan; Stefan Szeider (AAMAS, 2015)

Fixed-Parameter Tractable Reductions to SAT for Planning. - Ronald de Haan; Martin Kronegger; Andreas Pfandler (IJCAI, 2015)

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. - Ronald de Haan; Stefan Szeider (SOFSEM, 2015)

A Dichotomy Result for Ramsey Quantifiers. - Ronald de Haan; Jakub Szymanik (WoLLIC, 2015)

An Overview of Non-Uniform Parameterized Complexity. - Ronald de Haan (Electron. Colloquium Comput. Complex., 2015)

On the Subexponential-Time Complexity of CSP. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (J. Artif. Intell. Res., 2015)

Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation. - Ronald de Haan (ECAI, 2016)

Parametrisierte Komplexität in der polynomiellen Hierarchie. - Ronald de Haan (Ausgezeichnete Informatikdissertationen, 2016)

Succinctness of Languages for Judgment Aggregation. - Ulle Endriss; Umberto Grandi; Ronald de Haan; Jérôme Lang (KR, 2016)

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. - Ronald de Haan; Stefan Szeider (KR, 2016)

Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation. - Ronald de Haan (CoRR, 2016)

Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure. - Ronald de Haan (AAMAS, 2017)

Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures. - Ronald de Haan; Marija Slavkovik 001 (AAMAS, 2017)

Pareto Optimal Allocation under Uncertain Preferences. - Haris Aziz 001; Ronald de Haan; Baharak Rastegari (IJCAI, 2017)

Parameterized complexity classes beyond para-NP. - Ronald de Haan; Stefan Szeider (J. Comput. Syst. Sci., 2017)

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (ACM Trans. Comput. Log., 2017)

Tool Auctions. - Janosch Döcker; Britta Dorn; Ulle Endriss; Ronald de Haan; Sebastian Schneckenburger (AAAI, 2018)

Restricted Power - Computational Complexity Results for Strategic Defense Games. - Ronald de Haan; Petra Wolf 002 (FUN, 2018)

Hunting for Tractable Languages for Judgment Aggregation. - Ronald de Haan (KR, 2018)

A Parameterized Complexity View on Description Logic Reasoning. - Ronald de Haan (KR, 2018)

Expressing Linear Orders Requires Exponential-Size DNNFs. - Ronald de Haan (CoRR, 2018)

Pareto Optimal Allocation under Compact Uncertain Preferences. - Haris Aziz 001; Péter Biró 001; Ronald de Haan; Baharak Rastegari (AAAI, 2019)

Answer Set Programming for Judgment Aggregation. - Ronald de Haan; Marija Slavkovik 001 (IJCAI, 2019)

Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity. - Haris Aziz 001; Péter Biró 001; Ronald de Haan; Baharak Rastegari (Artif. Intell., 2019)

A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. - Ronald de Haan; Stefan Szeider (Algorithms, 2019)

Decentralization in Open Quorum Systems. - Andrea Bracciali; Davide Grossi; Ronald de Haan (CoRR, 2019)

Characterizing polynomial Ramsey quantifiers. - Ronald de Haan; Jakub Szymanik (Math. Struct. Comput. Sci., 2019)

Parameterized Complexity in the Polynomial Hierarchy - Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy - Ronald de Haan (Springer, 2019)

Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation. - Simon Rey; Ulle Endriss; Ronald de Haan (KR, 2020)

Decentralization in Open Quorum Systems: Limitative Results for Ripple and Stellar. - Andrea Bracciali; Davide Grossi; Ronald de Haan (Tokenomics, 2020)

Stable Matching with Uncertain Linear Preferences. - Haris Aziz 001; Péter Biró 001; Serge Gaspers; Ronald de Haan; Nicholas Mattei; Baharak Rastegari (Algorithmica, 2020)

The Complexity Landscape of Outcome Determination in Judgment Aggregation. - Ulle Endriss; Ronald de Haan; Jérôme Lang; Marija Slavkovik 001 (J. Artif. Intell. Res., 2020)

On Existential MSO and Its Relation to ETH. - Robert Ganian; Ronald de Haan; Iyad Kanj; Stefan Szeider (ACM Trans. Comput. Theory, 2020)

How Intractability Spans the Cognitive and Evolutionary Levels of Explanation. - Patricia Rich; Mark Blokpoel; Ronald de Haan; Iris van Rooij (Top. Cogn. Sci., 2020)

On the Complexity of Finding Justifications for Collective Decisions. - Arthur Boixel; Ronald de Haan (AAAI, 2021)

How hard is cognitive science? - Patricia Rich; Ronald de Haan; Todd Wareham; Iris van Rooij (CogSci, 2021)

Why is scaling up models of language evolution hard? - Marieke Woensdregt; Matthew Spike; Ronald de Haan; Todd Wareham; Iris van Rooij; Mark Blokpoel (CogSci, 2021)

Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting. - Simon Rey; Ulle Endriss; Ronald de Haan (IJCAI, 2021)

Obtaining a Proportional Allocation by Deleting Items. - Britta Dorn; Ronald de Haan; Ildikó Schlotter (Algorithmica, 2021)

On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models. - Ronald de Haan; Iris van de Pol (FLAP, 2021)

Naturalism, tractability and the adaptive toolbox. - Patricia Rich; Mark Blokpoel; Ronald de Haan; Maria Otworowska; Marieke Sweers; Todd Wareham; Iris van Rooij (Synth., 2021)

A Calculus for Computing Structured Justifications for Election Outcomes. - Arthur Boixel; Ulle Endriss; Ronald de Haan (AAAI, 2022)

Simulating Multiwinner Voting Rules in Judgment Aggregation. - Julian Chingoma; Ulle Endriss; Ronald de Haan (AAMAS, 2022)

Intractability of Bayesian belief-updating during communication. - Laura van de Braak; Ronald de Haan; Iris van Rooij; Mark Blokpoel (CogSci, 2022)

Using hierarchies to efficiently combine evidence with Dempster's rule of combination. - Daira Pinto Prieto; Ronald de Haan (UAI, 2022)

Viable Algorithmic Options for Creating and Adapting Emergent Software Systems. - Todd Wareham; Ronald de Haan (CoRR, 2022)

Stable matching with uncertain pairwise preferences. - Haris Aziz 001; Péter Biró 001; Tamás Fleiner; Serge Gaspers; Ronald de Haan; Nicholas Mattei; Baharak Rastegari (Theor. Comput. Sci., 2022)

A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence. - Daira Pinto Prieto; Ronald de Haan; Aybüke Özgün (KR, 2023)

All instances of MONOTONE 3-SAT-(3, 1) are satisfiable. - Hannah Van Santvliet; Ronald de Haan (CoRR, 2023)

Swarm Control for Distributed Construction: A Computational Complexity Perspective. - Todd Wareham; Ronald de Haan; Andrew Vardy; Iris van Rooij (ACM Trans. Hum. Robot Interact., 2023)

Egalitarian judgment aggregation. - Sirin Botan; Ronald de Haan; Marija Slavkovik 001; Zoi Terzopoulou (Auton. Agents Multi Agent Syst., 2023)

Complexity Results and Algorithms for Manipulation and Bribery in Judgment Aggregation. - Ari Conati; Andreas Niskanen; Ronald de Haan; Matti Järvisalo (ECAI, 2024)

Apportionment with Weighted Seats. - Julian Chingoma; Ulle Endriss; Ronald de Haan; Adrian Haret; Jan Maly 001 (CoRR, 2024)

Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT. - Ari Conati; Andreas Niskanen; Ronald de Haan; Matti Järvisalo (AAMAS, 2025)

A general framework for participatory budgeting with additional constraints. - Simon Rey; Ulle Endriss; Ronald de Haan (Soc. Choice Welf., 2025)