Stefan Szeider | |
|---|---|
| Nationality | Austrian |
| Alma mater | University of Vienna |
| Scientific career | |
| Fields | Algorithms Complexity Theoretical computer science Boolean satisfiability Constraint satisfaction Parameterized complexity |
| Institutions | TU Wien University of Durham University of Toronto Austrian Academy of Sciences |
| Doctoral advisors | Herbert Fleischner Georg Gottlob |
Stefan Szeider is an Austrian computer scientist who works on the areas of algorithms, computational complexity, theoretical computer science, and more specifically on propositional satisfiability, constraint satisfaction problems, and parameterised complexity. He is a full professor at the Faculty of Informatics[1] at the Vienna University of Technology (TU Wien), the head of the Algorithms and Complexity Group, and co-chair of the Vienna Center for Logic and Algorithms (VCLA) of TU Wien.[2][3]