Ronald De Haan | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/ronald-de-haan/Ronald De HaanHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngRonald De Haanhttps://ac.tuwien.ac.at/team/ronald-de-haan/On Existential MSO and Its Relation to ETHhttps://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth/Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchyhttps://ac.tuwien.ac.at/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy-2/Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedureshttps://ac.tuwien.ac.at/publication/complexity-results-for-aggregating-judgments-using-scoring-or-distance-based-procedures/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-results-for-aggregating-judgments-using-scoring-or-distance-based-procedures/Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedurehttps://ac.tuwien.ac.at/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-judgment-aggregation-procedure/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-judgment-aggregation-procedure/On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instanceshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances-2/On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instanceshttps://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances/Parameterized Complexity Classes Beyond Para-NPhttps://ac.tuwien.ac.at/publication/parameterized-complexity-classes-beyond-para-np/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-classes-beyond-para-np/Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract)https://ac.tuwien.ac.at/publication/pareto-optimal-allocation-under-uncertain-preferences-extended-abstract/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/pareto-optimal-allocation-under-uncertain-preferences-extended-abstract/Stable Matching with Uncertain Pairwise Preferenceshttps://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-pairwise-preferences/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-pairwise-preferences/Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-procedure-in-judgment-aggregation/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-results-for-manipulation-bribery-and-control-of-the-kemeny-procedure-in-judgment-aggregation/On Existential MSO and its Relation to ETHhttps://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-existential-mso-and-its-relation-to-eth-2/Parameterized Complexity in the Polynomial Hierarchyhttps://ac.tuwien.ac.at/publication/parameterized-complexity-in-the-polynomial-hierarchy/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-in-the-polynomial-hierarchy/Parameterized Complexity Results for Agenda Safety in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation-3/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation-3/Parameterized Complexity Results for Symbolic Model Checking of Temporal Logicshttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-symbolic-model-checking-of-temporal-logics-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-symbolic-model-checking-of-temporal-logics-2/Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation-2/Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-the-kemeny-rule-in-judgment-aggregation/Positive and Negative Results for Parameterized Compilabilityhttps://ac.tuwien.ac.at/publication/positive-and-negative-results-for-parameterized-compilability/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/positive-and-negative-results-for-parameterized-compilability/Stable Matching with Uncertain Linear Preferenceshttps://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-linear-preferences/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/stable-matching-with-uncertain-linear-preferences/Succinctness of Languages for Judgment Aggregationhttps://ac.tuwien.ac.at/publication/succinctness-of-languages-for-judgment-aggregation/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/succinctness-of-languages-for-judgment-aggregation/A Dichotomy Result for Ramsey Quantifiershttps://ac.tuwien.ac.at/publication/a-dichotomy-result-for-ramsey-quantifiers/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-dichotomy-result-for-ramsey-quantifiers/An Overview of Non-Uniform Parameterized Complexityhttps://ac.tuwien.ac.at/publication/an-overview-of-non-uniform-parameterized-complexity/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-overview-of-non-uniform-parameterized-complexity/Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Younghttps://ac.tuwien.ac.at/publication/complexity-of-the-winner-determination-problem-in-judgment-aggregation-kemeny-slater-tideman-young-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-of-the-winner-determination-problem-in-judgment-aggregation-kemeny-slater-tideman-young-2/Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Younghttps://ac.tuwien.ac.at/publication/complexity-of-the-winner-determination-problem-in-judgment-aggregation-kemeny-slater-tideman-young/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-of-the-winner-determination-problem-in-judgment-aggregation-kemeny-slater-tideman-young/Fixed-parameter Tractable Reductions to SAT for Planninghttps://ac.tuwien.ac.at/publication/fixed-parameter-tractable-reductions-to-sat-for-planning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractable-reductions-to-sat-for-planning/Machine Characterizations for Parameterized Complexity Classes Beyond Para-NPhttps://ac.tuwien.ac.at/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np-2/Machine Characterizations for Parameterized Complexity Classes Beyond Para-NPhttps://ac.tuwien.ac.at/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/machine-characterizations-for-parameterized-complexity-classes-beyond-para-np/On the Subexponential-Time Complexity of CSPhttps://ac.tuwien.ac.at/publication/on-the-subexponential-time-complexity-of-csp/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-subexponential-time-complexity-of-csp/Parameterized Complexity Results for Agenda Safety in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation-2/Parameterized Complexity Results for Symbolic Model Checking of Temporal Logicshttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-symbolic-model-checking-of-temporal-logics/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-symbolic-model-checking-of-temporal-logics/Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchyhttps://ac.tuwien.ac.at/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/compendium-of-parameterized-problems-at-higher-levels-of-the-polynomial-hierarchy/Fixed-Parameter Tractable Reductions to SAThttps://ac.tuwien.ac.at/publication/fixed-parameter-tractable-reductions-to-sat/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractable-reductions-to-sat/Parameterized Complexity Results for Agenda Safety in Judgment Aggregationhttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-agenda-safety-in-judgment-aggregation/Small Unsatisfiable Subsets in Constraint Satisfactionhttps://ac.tuwien.ac.at/publication/small-unsatisfiable-subsets-in-constraint-satisfaction/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/small-unsatisfiable-subsets-in-constraint-satisfaction/Subexponential Time Complexity of CSP with Global Constraintshttps://ac.tuwien.ac.at/publication/subexponential-time-complexity-of-csp-with-global-constraints/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/subexponential-time-complexity-of-csp-with-global-constraints/The Parameterized Complexity of Reasoning Problems Beyond NPhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-reasoning-problems-beyond-np/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-reasoning-problems-beyond-np/Local Backboneshttps://ac.tuwien.ac.at/publication/local-backbones/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/local-backbones/Parameterized Complexity Results for Plan Reusehttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-plan-reuse/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-plan-reuse/Description Logic Based Reasoning on Programming Languageshttps://ac.tuwien.ac.at/publication/description-logic-based-reasoning-on-programming-languages/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/description-logic-based-reasoning-on-programming-languages/