We stand with Ukraine

We stand with Ukraine

Ronald de Haan

Orcid: 0000-0003-2023-0586

According to our database¹, Ronald de Haan authored at least 57 papers between 2012 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Egalitarian judgment aggregation.

[BibT_eX]

[DOI]

,

,

Marija Slavkovik

,

Zoi Terzopoulou

Auton. Agents Multi Agent Syst., June, 2023

All instances of MONOTONE 3-SAT-(3, 1) are satisfiable.

[BibT_eX]

[DOI]

Hannah Van Santvliet

,

CoRR, 2023

A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence.

[BibT_eX]

[DOI]

Daira Pinto Prieto

,

,

Aybüke Özgün

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

2022

Stable matching with uncertain pairwise preferences.

[BibT_eX]

[DOI]

,

,

,

,

,

Nicholas Mattei

,

Baharak Rastegari

Theor. Comput. Sci., 2022

Viable Algorithmic Options for Creating and Adapting Emergent Software Systems.

[BibT_eX]

[DOI]

,

CoRR, 2022

Using hierarchies to efficiently combine evidence with Dempster's rule of combination.

[BibT_eX]

[DOI]

Daira Pinto Prieto

,

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Simulating Multiwinner Voting Rules in Judgment Aggregation.

[BibT_eX]

[DOI]

Julian Chingoma

,

,

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

A Calculus for Computing Structured Justifications for Election Outcomes.

[BibT_eX]

[DOI]

,

,

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Naturalism, tractability and the adaptive toolbox.

[BibT_eX]

[DOI]

,

,

,

Maria Otworowska

,

,

,

Synth., 2021

On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models.

[BibT_eX]

[DOI]

,

Iris van de Pol

FLAP, 2021

Obtaining a Proportional Allocation by Deleting Items.

[BibT_eX]

[DOI]

,

,

Ildikó Schlotter

Algorithmica, 2021

Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting.

[BibT_eX]

[DOI]

,

,

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

On the Complexity of Finding Justifications for Collective Decisions.

[BibT_eX]

[DOI]

,

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

How Intractability Spans the Cognitive and Evolutionary Levels of Explanation.

[BibT_eX]

[DOI]

,

,

,

Top. Cogn. Sci., 2020

On Existential MSO and Its Relation to ETH.

[BibT_eX]

[DOI]

,

,

,

ACM Trans. Comput. Theory, 2020

The Complexity Landscape of Outcome Determination in Judgment Aggregation.

[BibT_eX]

[DOI]

,

,

,

Marija Slavkovik

J. Artif. Intell. Res., 2020

Stable Matching with Uncertain Linear Preferences.

[BibT_eX]

[DOI]

,

,

,

,

Nicholas Mattei

,

Baharak Rastegari

Algorithmica, 2020

Decentralization in Open Quorum Systems: Limitative Results for Ripple and Stellar.

[BibT_eX]

[DOI]

Andrea Bracciali

,

,

Proceedings of the 2nd International Conference on Blockchain Economics, 2020

Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation.

[BibT_eX]

[DOI]

,

,

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019

Parameterized Complexity in the Polynomial Hierarchy - Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 11880, Springer, ISBN: 978-3-662-60669-8, 2019

Characterizing polynomial Ramsey quantifiers.

[BibT_eX]

[DOI]

,

Math. Struct. Comput. Sci., 2019

Decentralization in Open Quorum Systems.

[BibT_eX]

[DOI]

Andrea Bracciali

,

,

CoRR, 2019

Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity.

[BibT_eX]

[DOI]

,

,

,

Baharak Rastegari

Artif. Intell., 2019

Answer Set Programming for Judgment Aggregation.

[BibT_eX]

[DOI]

,

Marija Slavkovik

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Pareto Optimal Allocation under Compact Uncertain Preferences.

[BibT_eX]

[DOI]

,

,

,

Baharak Rastegari

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Expressing Linear Orders Requires Exponential-Size DNNFs.

[BibT_eX]

[DOI]

CoRR, 2018

A Parameterized Complexity View on Description Logic Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Hunting for Tractable Languages for Judgment Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Restricted Power - Computational Complexity Results for Strategic Defense Games.

[BibT_eX]

[DOI]

,

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Tool Auctions.

[BibT_eX]

[DOI]

Janosch Döcker

,

,

,

,

Sebastian Schneckenburger

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances.

[BibT_eX]

[DOI]

,

,

ACM Trans. Comput. Log., 2017

Parameterized complexity classes beyond para-NP.

[BibT_eX]

[DOI]

,

J. Comput. Syst. Sci., 2017

Pareto Optimal Allocation under Uncertain Preferences.

[BibT_eX]

[DOI]

,

,

Baharak Rastegari

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

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

[BibT_eX]

[DOI]

,

Marija Slavkovik

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

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

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics.

[BibT_eX]

[DOI]

,

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Succinctness of Languages for Judgment Aggregation.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Parametrisierte Komplexität in der polynomiellen Hierarchie.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2016, 2016

Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

On the Subexponential-Time Complexity of CSP.

[BibT_eX]

[DOI]

,

,

J. Artif. Intell. Res., 2015

An Overview of Non-Uniform Parameterized Complexity.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

A Dichotomy Result for Ramsey Quantifiers.

[BibT_eX]

[DOI]

,

Proceedings of the Logic, Language, Information, and Computation, 2015

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP.

[BibT_eX]

[DOI]

,

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Fixed-Parameter Tractable Reductions to SAT for Planning.

[BibT_eX]

[DOI]

,

Martin Kronegger

,

Andreas Pfandler

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation.

[BibT_eX]

[DOI]

,

,

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

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

[BibT_eX]

[DOI]

,

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy.

[BibT_eX]

[DOI]

,

Electron. Colloquium Comput. Complex., 2014

Fixed-Parameter Tractable Reductions to SAT.

[BibT_eX]

[DOI]

,

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

The Parameterized Complexity of Reasoning Problems Beyond NP.

[BibT_eX]

[DOI]

,

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Small Unsatisfiable Subsets in Constraint Satisfaction.

[BibT_eX]

[DOI]

,

,

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Subexponential Time Complexity of CSP with Global Constraints.

[BibT_eX]

[DOI]

,

,

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Local Backbones.

[BibT_eX]

[DOI]

,

,

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Parameterized Complexity Results for Plan Reuse.

[BibT_eX]

[DOI]

,

Anna Roubícková

,

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Functional Logic Programming with Generalized Circular Coinduction

[BibT_eX]

[DOI]

CoRR, 2012

Detecting Temporally Related Arithmetical Patterns - An Extension of Complex Event Processing.

[BibT_eX]

,

Mikhail Roshchin

Proceedings of the KDIR 2012 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Barcelona, Spain, 4, 2012

The RegularGcc Matrix Constraint.

[BibT_eX]

[DOI]

,

Nina Narodytska

,

Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012

Loading...