Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 56
Number of items: 56
  • Open Access
    Aziz, H., Biró, P., Gaspers, S., de Haan, R., Mattei, N., & Rastegari, B. (2020). Stable Matching with Uncertain Linear Preferences. Algorithmica, 82(5), 1410–1433. https://doi.org/10.1007/s00453-019-00650-0
  • Open Access
    Rey, S., Endriss, U., & de Haan, R. (2020). Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), KR2020 : Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning: Rhodes, Greece, September 12-18, 2020 (pp. 692-702). IJCAI. https://doi.org/10.24963/kr.2020/71
  • de Haan, R., & Szymanik, J. (2019). Characterizing polynomial Ramsey quantifiers. Mathematical Structures in Computer Science, 29(6), 896-908. https://doi.org/10.1017/S0960129518000397
  • Aziz, H., Biro, P., de Haan, R., & Rastegari, B. (2019). Pareto Optimal Allocation under Compact Uncertain Preferences. In Thirty-Third AAAI Conference on Artificial Intelligence, Thirty-First Conference on Innovative Applications of Artificial Intelligence, The Ninth Symposium on Educational Advances in Artificial Intelligence: AAAI-19, IAAI-19, EAAI-20 : January 27-February 1, 2019, Hilton Hawaiian Village, Honolulu, Hawaii, USA (pp. 1740-1747). (Proceedings of the AAAI Conference on Artificial Intelligence; Vol. 33). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33011740
  • de Haan, R. (2019). Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy. (Lecture Notes in Computer Science; Vol. 11880), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-662-60670-4
  • Aziz, H., Biró, P., de Haan, R., & Rastegari, B. (2019). Pareto Optimal Allocation under Uncertain Preferences: Uncertainty Models, Algorithms, and Complexity. Artificial Intelligence, 276, 57-78. https://doi.org/10.1016/j.artint.2019.08.002
  • de Haan, R., & Slavkovik, M. (2019). Answer Set Programming for Judgment Aggregation. In S. Kraus (Ed.), Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence: IJCAI-19 : Macao, 10-16 August 2019 (pp. 1668-1674). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2019/231
  • Open Access
    de Haan, R., & Szeider, S. (2019). A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms, 12(9), Article 188. https://doi.org/10.3390/a12090188
  • Open Access
    van Rooij, I., Blokpoel, M., de Haan, R., & Wareham, T. (2019). Tractable embodied computation needs embeddedness. Reti, Saperi, Linguaggi, 6(1), 25-38. https://doi.org/10.12832/94728, https://doi.org/10.12832/94728
  • Open Access
    de Haan, R. (2018). A Parameterized Complexity View on Description Logic Reasoning. In M. Thielscher, F. Toni, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR2018): Tempe, Arizona, 30 October-2 November 2018 (pp. 359-368). AAAI Press. https://arxiv.org/abs/1808.03852
Page 4 of 6