default search action
Ronald de Haan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c43]Ari Conati
, Andreas Niskanen
Complexity Results and Algorithms for Manipulation and Bribery in Judgment Aggregation. ECAI 2024: 3597-3604 - [i22]Julian Chingoma, Ulle Endriss, Ronald de Haan, Adrian Haret, Jan Maly
Apportionment with Weighted Seats. CoRR abs/2405.18102 (2024) - 2023
- [j16]Sirin Botan, Ronald de Haan, Marija Slavkovik, Zoi Terzopoulou
Egalitarian judgment aggregation. Auton. Agents Multi Agent Syst. 37(1): 16 (2023) - [j15]Todd Wareham, Ronald de Haan, Andrew Vardy
Swarm Control for Distributed Construction: A Computational Complexity Perspective. ACM Trans. Hum. Robot Interact. 12(1): 6:1-6:45 (2023) - [c42]Daira Pinto Prieto, Ronald de Haan, Aybüke Özgün
A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence. KR 2023: 552-561 - [i21]Daira Pinto Prieto, Ronald de Haan, Aybüke Özgün:
A Belief Model for Conflicting and Uncertain Evidence - Connecting Dempster-Shafer Theory and the Topology of Evidence. CoRR abs/2306.03532 (2023) - [i20]Hannah Van Santvliet, Ronald de Haan:
All instances of MONOTONE 3-SAT-(3, 1) are satisfiable. CoRR abs/2311.06563 (2023) - 2022
- [j14]Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei
Stable matching with uncertain pairwise preferences. Theor. Comput. Sci. 909: 1-11 (2022) - [c41]Arthur Boixel, Ulle Endriss
A Calculus for Computing Structured Justifications for Election Outcomes. AAAI 2022: 4859-4866 - [c40]Julian Chingoma, Ulle Endriss, Ronald de Haan:
Simulating Multiwinner Voting Rules in Judgment Aggregation. AAMAS 2022: 263-271 - [c39]Laura van de Braak, Ronald de Haan, Iris van Rooij, Mark Blokpoel:
Intractability of Bayesian belief-updating during communication. CogSci 2022 - [c38]Daira Pinto Prieto, Ronald de Haan:
Using hierarchies to efficiently combine evidence with Dempster's rule of combination. UAI 2022: 1634-1643 - [i19]Todd Wareham, Ronald de Haan:
Viable Algorithmic Options for Creating and Adapting Emergent Software Systems. CoRR abs/2205.06097 (2022) - 2021
- [j13]Britta Dorn, Ronald de Haan, Ildikó Schlotter
Obtaining a Proportional Allocation by Deleting Items. Algorithmica 83(5): 1559-1603 (2021) - [j12]Ronald de Haan, Iris van de Pol:
On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models. FLAP 8(3): 621-658 (2021) - [j11]Patricia Rich
Naturalism, tractability and the adaptive toolbox. Synth. 198(6): 5749-5784 (2021) - [c37]Arthur Boixel, Ronald de Haan:
On the Complexity of Finding Justifications for Collective Decisions. AAAI 2021: 5194-5201 - [c36]Sirin Botan, Ronald de Haan, Marija Slavkovik, Zoi Terzopoulou:
Egalitarian Judgment Aggregation. AAMAS 2021: 214-222 - [c35]Patricia Rich, Ronald de Haan, Todd Wareham, Iris van Rooij:
How hard is cognitive science? CogSci 2021 - [c34]Marieke Woensdregt, Matthew Spike, Ronald de Haan, Todd Wareham, Iris van Rooij, Mark Blokpoel:
Why is scaling up models of language evolution hard? CogSci 2021 - [c33]Simon Rey, Ulle Endriss
Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting. IJCAI 2021: 370-376 - [i18]Sirin Botan, Ronald de Haan, Marija Slavkovik, Zoi Terzopoulou:
Egalitarian Judgment Aggregation. CoRR abs/2102.02785 (2021) - 2020
- [j10]Haris Aziz
Stable Matching with Uncertain Linear Preferences. Algorithmica 82(5): 1410-1433 (2020) - [j9]Ulle Endriss
The Complexity Landscape of Outcome Determination in Judgment Aggregation. J. Artif. Intell. Res. 69: 687-731 (2020) - [j8]Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
On Existential MSO and Its Relation to ETH. ACM Trans. Comput. Theory 12(4): 22:1-22:32 (2020) - [j7]Patricia Rich
How Intractability Spans the Cognitive and Evolutionary Levels of Explanation. Top. Cogn. Sci. 12(4): 1382-1402 (2020) - [c32]Simon Rey, Ulle Endriss
Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation. KR 2020: 692-702 - [c31]Andrea Bracciali
Decentralization in Open Quorum Systems: Limitative Results for Ripple and Stellar. Tokenomics 2020: 5:1-5:20 - [i17]Simon Rey, Ulle Endriss, Ronald de Haan:
Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting. CoRR abs/2010.10309 (2020)
2010 – 2019
- 2019
- [b1]Ronald de Haan:
Parameterized Complexity in the Polynomial Hierarchy - Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy. TU Wien, Vienna, Austria, Lecture Notes in Computer Science 11880, Springer 2019, ISBN 978-3-662-60669-8, pp. 1-353 - [j6]Haris Aziz
Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity. Artif. Intell. 276: 57-78 (2019) - [j5]Ronald de Haan
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms 12(9): 188 (2019) - [j4]Ronald de Haan, Jakub Szymanik:
Characterizing polynomial Ramsey quantifiers. Math. Struct. Comput. Sci. 29(6): 896-908 (2019) - [c30]Haris Aziz
Pareto Optimal Allocation under Compact Uncertain Preferences. AAAI 2019: 1740-1747 - [c29]Ronald de Haan, Marija Slavkovik:
Answer Set Programming for Judgment Aggregation. IJCAI 2019: 1668-1674 - [i16]Andrea Bracciali, Davide Grossi, Ronald de Haan:
Decentralization in Open Quorum Systems. CoRR abs/1911.08182 (2019) - 2018
- [c28]Janosch Döcker, Britta Dorn, Ulle Endriss, Ronald de Haan, Sebastian Schneckenburger:
Tool Auctions. AAAI 2018: 1015-1022 - [c27]Ronald de Haan, Petra Wolf:
Restricted Power - Computational Complexity Results for Strategic Defense Games. FUN 2018: 17:1-17:14 - [c26]Ronald de Haan:
Hunting for Tractable Languages for Judgment Aggregation. KR 2018: 194-203 - [c25]Ronald de Haan:
A Parameterized Complexity View on Description Logic Reasoning. KR 2018: 359-368 - [i15]Ronald de Haan, Iris van de Pol:
On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models. CoRR abs/1805.09880 (2018) - [i14]Ronald de Haan:
Expressing Linear Orders Requires Exponential-Size DNNFs. CoRR abs/1807.06397 (2018) - [i13]Ronald de Haan:
Hunting for Tractable Languages for Judgment Aggregation. CoRR abs/1808.03043 (2018) - [i12]Ronald de Haan:
A Parameterized Complexity View on Description Logic Reasoning. CoRR abs/1808.03852 (2018) - 2017
- [j3]Ronald de Haan
Parameterized complexity classes beyond para-NP. J. Comput. Syst. Sci. 87: 16-57 (2017) - [j2]Ronald de Haan, Iyad A. Kanj, Stefan Szeider
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. ACM Trans. Comput. Log. 18(3): 21:1-21:46 (2017) - [c24]Britta Dorn, Ronald de Haan, Ildikó Schlotter:
Obtaining a Proportional Allocation by Deleting Items. ADT 2017: 284-299 - [c23]Haris Aziz
Stable Matching with Uncertain Pairwise Preferences. AAMAS 2017: 344-352 - [c22]Ronald de Haan, Marija Slavkovik:
Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures. AAMAS 2017: 952-961 - [c21]Ronald de Haan:
Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure. AAMAS 2017: 1151-1159 - [c20]Haris Aziz
Pareto Optimal Allocation under Uncertain Preferences. AAMAS 2017: 1472-1474 - [c19]Haris Aziz
Pareto Optimal Allocation under Uncertain Preferences. IJCAI 2017: 77-83 - [i11]Britta Dorn, Ronald de Haan, Ildikó Schlotter:
Obtaining a Proportional Allocation by Deleting Items. CoRR abs/1705.11060 (2017) - 2016
- [c18]Ronald de Haan:
Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation. ECAI 2016: 1502-1510 - [c17]Ulle Endriss, Umberto Grandi, Ronald de Haan, Jérôme Lang:
Succinctness of Languages for Judgment Aggregation. KR 2016: 176-186 - [c16]Ronald de Haan, Stefan Szeider:
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. KR 2016: 453-462 - [c15]Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider
On Existential MSO and its Relation to ETH. MFCS 2016: 42:1-42:14 - [c14]Haris Aziz
Stable Matching with Uncertain Linear Preferences. SAGT 2016: 195-206 - [p1]Ronald de Haan:
Parametrisierte Komplexität in der polynomiellen Hierarchie. Ausgezeichnete Informatikdissertationen 2016: 31-40 - [i10]Ronald de Haan, Jakub Szymanik:
Characterizing Polynomial Ramsey Quantifiers. CoRR abs/1601.02258 (2016) - [i9]Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Linear Preferences. CoRR abs/1607.02917 (2016) - [i8]Ronald de Haan:
Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation. CoRR abs/1608.02406 (2016) - 2015
- [j1]Ronald de Haan, Iyad A. Kanj, Stefan Szeider
On the Subexponential-Time Complexity of CSP. J. Artif. Intell. Res. 52: 203-234 (2015) - [c13]Ulle Endriss, Ronald de Haan:
Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young. AAMAS 2015: 117-125 - [c12]Ulle Endriss, Ronald de Haan, Stefan Szeider:
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. AAMAS 2015: 127-136 - [c11]Ronald de Haan, Martin Kronegger, Andreas Pfandler:
Fixed-Parameter Tractable Reductions to SAT for Planning. IJCAI 2015: 2897-2903 - [c10]Ronald de Haan, Stefan Szeider
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. SOFSEM 2015: 217-229 - [c9]Ronald de Haan, Jakub Szymanik:
A Dichotomy Result for Ramsey Quantifiers. WoLLIC 2015: 69-80 - [i7]Ronald de Haan:
An Overview of Non-Uniform Parameterized Complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c8]Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Subexponential Time Complexity of CSP with Global Constraints. CP 2014: 272-288 - [c7]Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Small Unsatisfiable Subsets in Constraint Satisfaction. ICTAI 2014: 429-436 - [c6]Ronald de Haan, Stefan Szeider:
The Parameterized Complexity of Reasoning Problems Beyond NP. KR 2014 - [c5]Ronald de Haan, Stefan Szeider
Fixed-Parameter Tractable Reductions to SAT. SAT 2014: 85-102 - [i6]Ronald de Haan, Stefan Szeider:
Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c4]Ronald de Haan, Anna Roubícková, Stefan Szeider:
Parameterized Complexity Results for Plan Reuse. AAAI 2013: 224-231 - [c3]Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Local Backbones. SAT 2013: 377-393 - [i5]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Local Backbones. CoRR abs/1304.5479 (2013) - [i4]Ronald de Haan, Anna Roubícková, Stefan Szeider:
Parameterized Complexity Results for Plan Reuse. CoRR abs/1307.4440 (2013) - [i3]Ronald de Haan, Stefan Szeider:
The Parameterized Complexity of Reasoning Problems Beyond NP. CoRR abs/1312.1672 (2013) - 2012
- [c2]Ronald de Haan, Nina Narodytska, Toby Walsh:
The RegularGcc Matrix Constraint. Australasian Conference on Artificial Intelligence 2012: 206-217 - [c1]Ronald de Haan, Mikhail Roshchin:
Detecting Temporally Related Arithmetical Patterns - An Extension of Complex Event Processing. KDIR 2012: 329-332 - [i2]Ronald de Haan, Nina Narodytska, Toby Walsh:
The RegularGcc Matrix Constraint. CoRR abs/1201.0564 (2012) - [i1]Ronald de Haan:
Functional Logic Programming with Generalized Circular Coinduction. CoRR abs/1203.0835 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: