Markus Kirchweger

Markus Kirchweger is a PreDoc Researcher at the Department of Algorithms and Complexity, Faculty of Informatics, Technische Universität Wien. His work spans Satisfiability (SAT) solving, graph theory, and combinatorial optimization, with a focus on symmetry breaking and SAT modulo theories.

Research Interests:

• Developing SAT-based frameworks for graph generation and enumeration
• Dynamic symmetry breaking in combinatorial problem encodings
• Integrating user propagators into CDCL solvers
• Applying SAT techniques to conjectures like Erdős-Faber-Lovász and Rota’s Basis
• Co-certificate learning and shortest common supersequence optimization

Projects: INCR (2021–2024), REVEAL-AI (2020–2024), SLIM (2019–2024), ASK-SAT (2024–2027).