Ronald de Haan

Available identifiers

zbMath Open de-haan.ronaldMaRDI QIDQ1990310

List of research outcomes

Publication	Date of Publication	Type
Naturalism, tractability and the adaptive toolbox	2023-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q5039108	2022-10-12	Paper
On Existential MSO and Its Relation to ETH	2022-03-07	Paper
Stable matching with uncertain pairwise preferences	2022-03-01	Paper
Obtaining a proportional allocation by deleting items	2021-04-19	Paper
The Complexity Landscape of Outcome Determination in Judgment Aggregation	2020-12-09	Paper
Restricted Power - Computational Complexity Results for Strategic Defense Games	2020-08-11	Paper
Stable matching with uncertain linear preferences	2020-04-01	Paper
Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy	2020-01-21	Paper
Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity	2020-01-20	Paper
Characterizing polynomial Ramsey quantifiers	2019-05-27	Paper
Obtaining a proportional allocation by deleting items	2018-10-25	Paper
Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation	2018-07-12	Paper
On Existential MSO and its Relation to ETH	2018-03-21	Paper
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances	2017-10-16	Paper
Parameterized complexity classes beyond para-NP	2017-05-24	Paper
Stable Matching with Uncertain Linear Preferences	2016-09-29	Paper
A Dichotomy Result for Ramsey Quantifiers	2015-09-24	Paper
On the Subexponential-Time Complexity of CSP	2015-03-04	Paper
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP	2015-02-20	Paper
Fixed-Parameter Tractable Reductions to SAT	2014-09-26	Paper
Local Backbones	2013-08-05	Paper

Research outcomes over time

This page was built for person: Ronald de Haan