Ronald De Haan

Recent Publications

Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures

2017

Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure

2017

Parameterized Complexity Classes Beyond Para-NP

2017

Pareto Optimal Allocation under Uncertain Preferences

2017

Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract)

2017

Stable Matching with Uncertain Pairwise Preferences

2017

Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation

2016

On Existential MSO and its Relation to ETH

2016

Parameterized Complexity in the Polynomial Hierarchy

2016

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics

2016

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation

2016

Positive and Negative Results for Parameterized Compilability

2016

Stable Matching with Uncertain Linear Preferences

2016

Succinctness of Languages for Judgment Aggregation

2016

A Dichotomy Result for Ramsey Quantifiers

2015

Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young

2015

Fixed-parameter Tractable Reductions to SAT for Planning

2015

Subexponential Time Complexity of CSP with Global Constraints

2014

Local Backbones

2013

Parameterized Complexity Results for Plan Reuse

2013

Description Logic Based Reasoning on Programming Languages

2012