Ronald de Haan

Ronald de Haan is an Assistant Professor at the Institute for Logic, Language & Computation (ILLC), University of Amsterdam, with primary affiliation in Theoretical Computer Science (TCS) and secondary affiliation in Mathematical & Computational Logic (MCL). Since December 2019, he has held this position, following a postdoctoral role at the same institution from 2017 to 2019. He completed his PhD at the Algorithms and Complexity Group at Technische Universität Wien in 2016.

Education:

• PhD in Computer Science, Technische Universität Wien (2016)
• MSc in Computational Logic, European Master's Program in Computational Logic (2010–2012)
• BSc in Cognitive Artificial Intelligence & BA in Linguistics, Utrecht University (2007–2010)

Research Interests:
His work lies at the intersection of theoretical computer science and artificial intelligence, with a strong emphasis on parameterized complexity theory. He explores the computational complexity of problems in AI, knowledge representation & reasoning, and computational logic. Specific areas include the Polynomial Hierarchy, subexponential-time complexity, the Exponential Time Hypothesis, and parameterized compilability.

Scientific Awards:

• E.W. Beth Dissertation Prize 2017 for his PhD thesis "Parameterized Complexity in the Polynomial Hierarchy"
• Shortlisted for the Heinz Zemanek Prize 2018
• Nominated for the GI-Dissertationspreis 2016 by the German Informatics Society

Teaching & Supervision:
He has taught a wide range of courses at the University of Amsterdam, including Computational Complexity, Knowledge Representation and Reasoning, and Recursion Theory for MSc Logic and MSc AI programs. He also supervises student research projects and theses, offering topics in ASP, complexity theory, and logic programming.

Academic Service:
He has served on the program committees of top-tier AI and logic conferences such as AAAI, IJCAI, KR, ECAI, and AAMAS, and co-organized events like PhDs in Logic VII.