Ronald de Haan

86 papers A* 16A 16B 7C 1Misc 1Journal 39Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A general framework for participatory budgeting with additional constraints. Soc. Choice Welf. Simon Rey, Ulle Endriss, Ronald de Haan
2025	A	`conf`	Apportionment with Weighted Seats. ECAI Julian Chingoma, Ulle Endriss, Ronald de Haan, Adrian Haret, Jan Maly
2025	A	`conf`	Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT. AAMAS Ari Conati, Andreas Niskanen, Ronald de Haan, Matti Järvisalo
2024	J	`jnl`	Apportionment with Weighted Seats. CoRR Julian Chingoma, Ulle Endriss, Ronald de Haan, Adrian Haret, Jan Maly
2024	A	`conf`	Complexity Results and Algorithms for Manipulation and Bribery in Judgment Aggregation. ECAI Ari Conati, Andreas Niskanen, Ronald de Haan, Matti Järvisalo
2023	J	`jnl`	A Belief Model for Conflicting and Uncertain Evidence - Connecting Dempster-Shafer Theory and the Topology of Evidence. CoRR Daira Pinto Prieto, Ronald de Haan, Aybüke Özgün
2023	A*	`conf`	A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence. KR Daira Pinto Prieto, Ronald de Haan, Aybüke Özgün
2023	J	`jnl`	All instances of MONOTONE 3-SAT-(3, 1) are satisfiable. CoRR Hannah Van Santvliet, Ronald de Haan
2023	J	`jnl`	Egalitarian judgment aggregation. Auton. Agents Multi Agent Syst. Sirin Botan, Ronald de Haan, Marija Slavkovik, Zoi Terzopoulou
2023	J	`jnl`	Swarm Control for Distributed Construction: A Computational Complexity Perspective. ACM Trans. Hum. Robot Interact. Todd Wareham, Ronald de Haan, Andrew Vardy, Iris van Rooij
2022	A*	`conf`	A Calculus for Computing Structured Justifications for Election Outcomes. AAAI Arthur Boixel, Ulle Endriss, Ronald de Haan
2022	B	`conf`	Intractability of Bayesian belief-updating during communication. CogSci Laura van de Braak, Ronald de Haan, Iris van Rooij, Mark Blokpoel
2022	A	`conf`	Simulating Multiwinner Voting Rules in Judgment Aggregation. AAMAS Julian Chingoma, Ulle Endriss, Ronald de Haan
2022	J	`jnl`	Stable matching with uncertain pairwise preferences. Theor. Comput. Sci. Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2022	A	`conf`	Using hierarchies to efficiently combine evidence with Dempster's rule of combination. UAI Daira Pinto Prieto, Ronald de Haan
2022	J	`jnl`	Viable Algorithmic Options for Creating and Adapting Emergent Software Systems. CoRR Todd Wareham, Ronald de Haan
2021	A	`conf`	Egalitarian Judgment Aggregation. AAMAS Sirin Botan, Ronald de Haan, Marija Slavkovik, Zoi Terzopoulou
2021	J	`jnl`	Egalitarian Judgment Aggregation. CoRR Sirin Botan, Ronald de Haan, Marija Slavkovik, Zoi Terzopoulou
2021	B	`conf`	How hard is cognitive science? CogSci Patricia Rich, Ronald de Haan, Todd Wareham, Iris van Rooij
2021	J	`jnl`	Naturalism, tractability and the adaptive toolbox. Synth. Patricia Rich, Mark Blokpoel, Ronald de Haan, Maria Otworowska, Marieke Sweers, Todd Wareham, Iris van Rooij
2021	J	`jnl`	Obtaining a Proportional Allocation by Deleting Items. Algorithmica Britta Dorn, Ronald de Haan, Ildikó Schlotter
2021	A*	`conf`	On the Complexity of Finding Justifications for Collective Decisions. AAAI Arthur Boixel, Ronald de Haan
2021	J	`jnl`	On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models. FLAP Ronald de Haan, Iris van de Pol
2021	A*	`conf`	Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting. IJCAI Simon Rey, Ulle Endriss, Ronald de Haan
2021	B	`conf`	Why is scaling up models of language evolution hard? CogSci Marieke Woensdregt, Matthew Spike, Ronald de Haan, Todd Wareham, Iris van Rooij, Mark Blokpoel
2020	—	`conf`	Decentralization in Open Quorum Systems: Limitative Results for Ripple and Stellar. Tokenomics Andrea Bracciali, Davide Grossi, Ronald de Haan
2020	A*	`conf`	Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation. KR Simon Rey, Ulle Endriss, Ronald de Haan
2020	J	`jnl`	How Intractability Spans the Cognitive and Evolutionary Levels of Explanation. Top. Cogn. Sci. Patricia Rich, Mark Blokpoel, Ronald de Haan, Iris van Rooij
2020	J	`jnl`	On Existential MSO and Its Relation to ETH. ACM Trans. Comput. Theory Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
2020	J	`jnl`	Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting. CoRR Simon Rey, Ulle Endriss, Ronald de Haan
2020	J	`jnl`	Stable Matching with Uncertain Linear Preferences. Algorithmica Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2020	J	`jnl`	The Complexity Landscape of Outcome Determination in Judgment Aggregation. J. Artif. Intell. Res. Ulle Endriss, Ronald de Haan, Jérôme Lang, Marija Slavkovik
2019	J	`jnl`	A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms Ronald de Haan, Stefan Szeider
2019	A*	`conf`	Answer Set Programming for Judgment Aggregation. IJCAI Ronald de Haan, Marija Slavkovik
2019	J	`jnl`	Characterizing polynomial Ramsey quantifiers. Math. Struct. Comput. Sci. Ronald de Haan, Jakub Szymanik
2019	J	`jnl`	Decentralization in Open Quorum Systems. CoRR Andrea Bracciali, Davide Grossi, Ronald de Haan
2019	—	`book`	Parameterized Complexity in the Polynomial Hierarchy - Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy Ronald de Haan
2019	A*	`conf`	Pareto Optimal Allocation under Compact Uncertain Preferences. AAAI Haris Aziz, Péter Biró, Ronald de Haan, Baharak Rastegari
2019	J	`jnl`	Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity. Artif. Intell. Haris Aziz, Péter Biró, Ronald de Haan, Baharak Rastegari
2018	A*	`conf`	A Parameterized Complexity View on Description Logic Reasoning. KR Ronald de Haan
2018	J	`jnl`	A Parameterized Complexity View on Description Logic Reasoning. CoRR Ronald de Haan
2018	J	`jnl`	Expressing Linear Orders Requires Exponential-Size DNNFs. CoRR Ronald de Haan
2018	A*	`conf`	Hunting for Tractable Languages for Judgment Aggregation. KR Ronald de Haan
2018	J	`jnl`	Hunting for Tractable Languages for Judgment Aggregation. CoRR Ronald de Haan
2018	J	`jnl`	On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models. CoRR Ronald de Haan, Iris van de Pol
2018	Misc	`conf`	Restricted Power - Computational Complexity Results for Strategic Defense Games. FUN Ronald de Haan, Petra Wolf
2018	A*	`conf`	Tool Auctions. AAAI Janosch Döcker, Britta Dorn, Ulle Endriss, Ronald de Haan, Sebastian Schneckenburger
2017	A	`conf`	Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures. AAMAS Ronald de Haan, Marija Slavkovik
2017	A	`conf`	Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure. AAMAS Ronald de Haan
2017	—	`conf`	Obtaining a Proportional Allocation by Deleting Items. ADT Britta Dorn, Ronald de Haan, Ildikó Schlotter
2017	J	`jnl`	Obtaining a Proportional Allocation by Deleting Items. CoRR Britta Dorn, Ronald de Haan, Ildikó Schlotter
2017	J	`jnl`	On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. ACM Trans. Comput. Log. Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2017	J	`jnl`	Parameterized complexity classes beyond para-NP. J. Comput. Syst. Sci. Ronald de Haan, Stefan Szeider
2017	A	`conf`	Pareto Optimal Allocation under Uncertain Preferences. AAMAS Haris Aziz, Ronald de Haan, Baharak Rastegari
2017	A*	`conf`	Pareto Optimal Allocation under Uncertain Preferences. IJCAI Haris Aziz, Ronald de Haan, Baharak Rastegari
2017	A	`conf`	Stable Matching with Uncertain Pairwise Preferences. AAMAS Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2016	J	`jnl`	Characterizing Polynomial Ramsey Quantifiers. CoRR Ronald de Haan, Jakub Szymanik
2016	J	`jnl`	Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation. CoRR Ronald de Haan
2016	B	`conf`	On Existential MSO and its Relation to ETH. MFCS Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2016	A*	`conf`	Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. KR Ronald de Haan, Stefan Szeider
2016	A	`conf`	Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation. ECAI Ronald de Haan
2016	—	`ch.`	Parametrisierte Komplexität in der polynomiellen Hierarchie. Ausgezeichnete Informatikdissertationen Ronald de Haan
2016	B	`conf`	Stable Matching with Uncertain Linear Preferences. SAGT Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2016	J	`jnl`	Stable Matching with Uncertain Linear Preferences. CoRR Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
2016	A*	`conf`	Succinctness of Languages for Judgment Aggregation. KR Ulle Endriss, Umberto Grandi, Ronald de Haan, Jérôme Lang
2015	C	`conf`	A Dichotomy Result for Ramsey Quantifiers. WoLLIC Ronald de Haan, Jakub Szymanik
2015	J	`jnl`	An Overview of Non-Uniform Parameterized Complexity. Electron. Colloquium Comput. Complex. Ronald de Haan
2015	A	`conf`	Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young. AAMAS Ulle Endriss, Ronald de Haan
2015	A*	`conf`	Fixed-Parameter Tractable Reductions to SAT for Planning. IJCAI Ronald de Haan, Martin Kronegger, Andreas Pfandler
2015	B	`conf`	Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. SOFSEM Ronald de Haan, Stefan Szeider
2015	J	`jnl`	On the Subexponential-Time Complexity of CSP. J. Artif. Intell. Res. Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2015	A	`conf`	Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. AAMAS Ulle Endriss, Ronald de Haan, Stefan Szeider
2014	J	`jnl`	Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. Ronald de Haan, Stefan Szeider
2014	A	`conf`	Fixed-Parameter Tractable Reductions to SAT. SAT Ronald de Haan, Stefan Szeider
2014	B	`conf`	Small Unsatisfiable Subsets in Constraint Satisfaction. ICTAI Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2014	A	`conf`	Subexponential Time Complexity of CSP with Global Constraints. CP Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2014	A*	`conf`	The Parameterized Complexity of Reasoning Problems Beyond NP. KR Ronald de Haan, Stefan Szeider
2013	J	`jnl`	Local Backbones CoRR Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2013	A	`conf`	Local Backbones. SAT Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2013	A*	`conf`	Parameterized Complexity Results for Plan Reuse. AAAI Ronald de Haan, Anna Roubícková, Stefan Szeider
2013	J	`jnl`	Parameterized Complexity Results for Plan Reuse. CoRR Ronald de Haan, Anna Roubícková, Stefan Szeider
2013	J	`jnl`	The Parameterized Complexity of Reasoning Problems Beyond NP. CoRR Ronald de Haan, Stefan Szeider
2012	—	`conf`	Detecting Temporally Related Arithmetical Patterns - An Extension of Complex Event Processing. KDIR Ronald de Haan, Mikhail Roshchin
2012	J	`jnl`	Functional Logic Programming with Generalized Circular Coinduction CoRR Ronald de Haan
2012	J	`jnl`	The RegularGcc Matrix Constraint CoRR Ronald de Haan, Nina Narodytska, Toby Walsh
2012	—	`conf`	The RegularGcc Matrix Constraint. Australasian Conference on Artificial Intelligence Ronald de Haan, Nina Narodytska, Toby Walsh