Stefan Szeider
Has grant
Professor and Chair
AustriaResearch Interests
Explore related searches
Contact this professor
Get a free first email built on one of their papers, ready for you to edit and send yourself.
About
Stefan Szeider is a Professor and Chair at TU Wien in Austria. His research interests include computational complexity, graph theory, and decision tree learning, which are reflected in his recent articles on topics such as twin-width, SAT modulo symmetries, and hypertree decompositions. Professor Szeider's work often integrates advanced logical techniques with practical applications in data analysis and algorithm design.
Recent Grants
Grant: Close
SAT-Based Local Improvement Methods (SLIM)
Open Date: 2019-09-01
Close Date: 2022-08-31
Grant: Close
Variable Dependencies of Quantified Boolean Formulas
Open Date: 2015-06-01
Close Date: 2019-08-31
Grant: Close
Exploiting New Types of Structure for Fixed Parameter Tractability (X-TRACT)
Open Date: 2014-07-01
Close Date: 2018-02-28
Grant: Close
Parameterized Compilation
Open Date: 2014-01-01
Close Date: 2018-04-30
Grant: Close
The Parameterized Complexity of Reasoning Problems
Open Date: 2010-01-01
Close Date: 2014-12-31
Articles (14)
Year:
2025
Year:
2024
Year:
2024
Year:
2024
Year:
2024
Year:
2023
Year:
2023
Year:
2023
Year:
2023
Year:
2023
Year:
2023
Year:
2022
Year:
2021
Year:
2021
Collaborators (3)
Jan Dreier
-
Tomáš Peitl
TU Wien
André Schidler
TU Wien
ApplyKite TwinLearns as you applyMake your next move.
Prepare your application
Review drafts before you send them.