( en | de | ru )

 

Disambiguation of "de Haan, Ronald"

Author of the publication

copydeleteadd this publication to your clipboard
Fixed-Parameter Tractable Reductions to SAT for Planning.

, , and . IJCAI, page 2897-2903. AAAI Press, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nathalie de Haan

Martha Lanwer-de Haan

Arnim Haan

Thomas Haan

Gerhard Haan

 

Other publications of authors with the same name

Parameterized complexity classes beyond para-NP., and . J. Comput. Syst. Sci., (2017)Decentralization in Open Quorum Systems., , and . CoRR, (2019)On Existential MSO and its Relation to ETH., , , and . MFCS, volume 58 of LIPIcs, page 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting., , and . CoRR, (2020)Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity., , , and . Artif. Intell., (2019)The Complexity Landscape of Outcome Determination in Judgment Aggregation., , , and . J. Artif. Intell. Res., (2020)Parameterized Complexity in the Polynomial Hierarchy - Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy. Lecture Notes in Computer Science Springer, (2019)On the Complexity of Finding Justifications for Collective Decisions., and . AAAI, page 5194-5201. AAAI Press, (2021)A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence., , and . KR, page 552-561. (2023)Small Unsatisfiable Subsets in Constraint Satisfaction., , and . ICTAI, page 429-436. IEEE Computer Society, (2014)