Papers & Presentations

Research

How Hard Is It to Explain Preferences Using Few Boolean Attributes
Proceedings of the AAAI Conference on Artificial Intelligence, March 2026

Seminar papers

Hardness and The Exponential Time Hypothesis: Classical, Fine Grained and Parameterized Complexity
"Seminar aus Algorithmik, SS2024"

Deriving BLOSUM-like Matrices for Protein-Coding DNA
Bachelor thesis/project at JKU Linz, 2023

Lattice Methods for Numerical Integration
"Seminar in Mathematics, SS2021"

Talks

Über Parameterisierte Aufzählkomplexität (About Parameterized Enumeration Complexity)
"Seminar in Complexity Theory, SS2024"