Christian Hatschka

Projektass. Dipl.-Ing. / BSc

Role

PreDoc Researcher
Algorithms and Complexity, E192-01

Contact

Publications

Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences / Chen, J., Hatschka, C., & Simola, S. (2023). Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences. In ECAI 2023 : 26th European Conference on Artificial Intelligence, September 30–October 4, 2023, Kraków, Poland. Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023). Proceedings (pp. 397–404). IOS Press. https://doi.org/10.3233/FAIA230296
Download: PDF (337 KB)
Project: Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027)
Deontic Paradoxes in ASP with Weak Constraints / Ciabattoni, A., Eiter, T., & Hatschka, C. (2023). Deontic Paradoxes in ASP with Weak Constraints. In Proceedings 39th International Conference on Logic Programming (pp. 367–380).
Project: TAIGER (2023–2027)
Representing Normative Reasoning in Answer Set Programming Using Weak Constraints / Hatschka, C., Ciabattoni, A., & Eiter, T. (2022, November 28). Representing Normative Reasoning in Answer Set Programming Using Weak Constraints [Conference Presentation]. TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien, Austria. http://hdl.handle.net/20.500.12708/154091
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts / Brand, C., Ceylan, E., Ganian, R., Hatschka, C., & Korchemna, V. (2022). Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. In M. A. Bekos & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 98–113). Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-031-15914-5_8
Representing normative reasoning in answer set programming using weak constraints / Hatschka, C. (2022). Representing normative reasoning in answer set programming using weak constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99420
Download: PDF (925 KB)