Sebastian Ordyniak

Sebastian Ordyniak is an Associate Professor in the Department of Algorithms and Complexity at TU Wien. His research focuses on parameterized complexity, algorithms, computational complexity, and applications in artificial intelligence and graph theory. He holds a PhD and the prestigious START Prize (2014–2022), a renowned Austrian award for outstanding researchers.

Key projects include the ERC-funded 'Parameterized Complexity of Local Search' (2010–2014) and ongoing initiatives like 'Parameterized Analysis in Artificial Intelligence' (2021–2026). His work bridges theoretical foundations with practical applications, such as algorithmic fairness, machine learning interpretability, and graph drawing.

Research highlights include contributions to SAT solving, backdoor analysis, and clustering algorithms. He has advised at least one student, Hossein Maleki, on practical algorithms for deletion to small components. His interdisciplinary approach integrates logic, computational geometry, and multi-agent systems.