Research

New Frontiers for Parameterized Complexity
FWF Project P31336 investigating the parameterized complexity of integer linear programming and machine learning.
Optimization Challenges in the Future Federated Internet
WWTF Project ICT10-024 on innovative algorithmic approaches for complex optimization problems.
Overcoming Intractability in the Knowledge Compilation Map
FWF ESPRIT Project ESP 479 on overcoming intractability in the knowledge compilation map.
Overcoming Intractability in the Knowledge Compilation Map
Parameterized Analysis in Artificial Intelligence
FWF START Project Y1329 on parameterized analysis and structure exploitation in artificial intelligence.
Parameterized Analysis in Artificial Intelligence
Parameterized Compilation
FWF Project P26200 on parameterized compilation and knowledge representation.
Parameterized Compilation
QBF Proofs and Certificates
FWF ESPRIT Project ESP 197 on proof systems and certificate extraction for Quantified Boolean Formulas.
QBF Proofs and Certificates
REVEAL-AI: Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI
WWTF Project ICT19-065 on revealing and utilizing hidden structure for solving hard problems in AI.
REVEAL-AI: Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI
SLIM: SAT Based Local Improvement
FWF Project P32441 on SAT-based local improvement and combinatorial optimization.
SLIM: SAT Based Local Improvement
STRIDES: Structure Identification with SAT
FWF Project P36420 on structure identification with SAT for algorithmic tractability.
STRIDES: Structure Identification with SAT
The Parameterized Complexity of Reasoning Problems
ERC Starting Grant 239962 on the parameterized complexity of reasoning problems in AI.
The Parameterized Complexity of Reasoning Problems