| Stable matching with uncertain linear preferences H Aziz, P Biró, S Gaspers, R De Haan, N Mattei, B Rastegari Algorithmic Game Theory: 9th International Symposium, SAGT 2016, Liverpool …, 2016 | 63* | 2016 |
| Complexity of the winner determination problem in judgment aggregation: Kemeny, Slater, Tideman, Young U Endriss, R De Haan | 41 | 2016 |
| Stable matching with uncertain pairwise preferences H Aziz, P Biró, T Fleiner, S Gaspers, R Haan | 34 | 2017 |
| Succinctness of languages for judgment aggregation U Endriss, U Grandi, R De Haan, J Lang AAAI Press, 2016 | 30 | 2016 |
| Designing participatory budgeting mechanisms grounded in judgment aggregation S Rey, U Endriss, R de Haan Proceedings of the International Conference on Principles of Knowledge …, 2020 | 22 | 2020 |
| Fixed-parameter tractable reductions to SAT R de Haan, S Szeider International Conference on Theory and Applications of Satisfiability …, 2014 | 22 | 2014 |
| The parameterized complexity of reasoning problems beyond NP R de Haan, S Szeider Fourteenth International Conference on the Principles of Knowledge …, 2014 | 22 | 2014 |
| How intractability spans the cognitive and evolutionary levels of explanation P Rich, M Blokpoel, R de Haan, I van Rooij Topics in cognitive science 12 (4), 1382-1402, 2020 | 19 | 2020 |
| Parameterized complexity results for agenda safety in judgment aggregation U Endriss, R De Haan, S Szeider | 19 | 2014 |
| A compendium of parameterized problems at higher levels of the polynomial hierarchy R de Haan, S Szeider Algorithms 12 (9), 188, 2019 | 17 | 2019 |
| Hunting for tractable languages for judgment aggregation R De Haan Sixteenth International Conference on Principles of Knowledge Representation …, 2018 | 17 | 2018 |
| Complexity results for aggregating judgments using scoring or distance-based procedures R de Haan, M Slavkovik Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017 | 16 | 2017 |
| How hard is cognitive science? P Rich, R de Haan, T Wareham, I van Rooij Proceedings of the annual meeting of the cognitive science society 43 (43), 2021 | 15 | 2021 |
| On the complexity of finding justifications for collective decisions A Boixel, R de Haan Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5194-5201, 2021 | 13 | 2021 |
| The complexity landscape of outcome determination in judgment aggregation U Endriss, R de Haan, J Lang, M Slavkovik Journal of Artificial Intelligence Research 69, 687–731-687–731, 2020 | 13 | 2020 |
| Parameterized Complexity in the Polynomial Hierarchy R de Haan Springer Berlin Heidelberg, 2019 | 13 | 2019 |
| Pareto optimal allocation under uncertain preferences H Aziz, R De Haan, B Rastegari arXiv preprint arXiv:1609.02795, 2016 | 13 | 2016 |
| Aggregating incomplete judgments: Axiomatisations for scoring rules Z Terzopoulou, U Endriss, R de Haan Proceedings of the 7th international workshop on computational social choice …, 2018 | 12 | 2018 |
| Parameterized complexity classes beyond para-NP R de Haan, S Szeider Journal of Computer and System Sciences 87, 16-57, 2017 | 12 | 2017 |
| A calculus for computing structured justifications for election outcomes A Boixel, U Endriss, R de Haan Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 4859-4866, 2022 | 11 | 2022 |
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
