Biography

• Since Sep 2023 I’m a University Assistant in the AC group. I teach Algorithms and Data Structures, Algorithmics, Algorithmic Encoding Techniques, and Seminar in Theoretical Computer Science Algorithms. Until 2025 I taught Structural Decompositions and Algorithms.
• Between Nov 2021 and Aug 2023 I was a Postdoc in the AC group, funded by the return phase of my FWF Erwin Schrödinger Fellowship and other FWF grants.
• Between Nov 2019 and Oct 2021 I was a Postdoc in the group of Olaf Beyersdorff at Friedrich Schiller University in Jena, Germany, funded by an FWF Erwin Schrödinger Fellowship.
• Until October 2019 I was a PhD student funded by FWF project P27721 and partially by the Doctoral College Logical Methods in Computer Science. I completed my PhD in October 2019 under the supervision of Prof. Dr. Stefan Szeider.

Research Interests

• QBF, DQBF, SAT, Proof Complexity, Complexity Theory, Graph Theory.
• Theory, solver development, applications (solving math problems, chess, and more).

Education

• 2015–2019: PhD in Computer Science, TU Wien (PhD thesis; with a research stay with Holger Hoos at the University of British Columbia, Vancouver, Canada).
• 2013–2015: Master’s in Mathematics, Comenius University, Bratislava, Slovakia (with an Erasmus stay at the University of Primorska, Koper, Slovenia).
• 2010–2013: Bachelor’s in Mathematics, Comenius University, Bratislava, Slovakia.

Software

• SAT Modulo Symmetries: Isomorph-free constrained graph-generation package.
• Qute: QBF solver implementing QCDCL with dependency learning and the reflexive resolution-path dependency scheme.
• short.py: SAT-based tool to compute shortest proofs of minimally unsatisfiable formulas.
• qrp2rup: Long-distance Q-resolution strategy extractor.