Since June 2025, I am a PhD student in the Cluster of Excellence Bilateral Artificial Intelligence.
My supervisor is Prof. Robert Ganian.

---

Publications

Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy
with Robert Ganian and Simon Wietheger. to appear at ICML 2026

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
with Robert Ganian. to appear at SAT 2026

---

Awards

• Ada-Lovelace Prize 2026
  This prize is awarded once a year to a student who combines academic success with exceptional commitment to the welfare of others and to the Institute of Computer Science at Friedrich Schiller University Jena, Germany.
• Honours Student 2024 - 2025
  The Honours Programme selects and supports research-oriented students.
• Dean's Examination Prize for Bachelor Thesis 2023
• Deutschlandstipendium (2022 - 2025)
  Scholarship

---

Education

• PhD student
  Algorithms and Complexity Group, TU Wien, Vienna, Austria
  Since June 2025
  supervised by Prof. Robert Ganian
• M.Sc. in Computer Science
  Friedrich Schiller University Jena, Germany
  September 2022 – March 2025
  Thesis: On the Relation between Descriptive and Parameterized Complexity in Graph Modification Problems,
  supervised by Prof. Christian Komusiewicz
• Visiting Graduate Student
  Simons Institute for the Theory of Computing, Berkeley, US
  March 2023 – May 2023
  Program: Satisfiability: Theory, Practice, and Beyond
• B.Sc. in Computer Science
  Friedrich Schiller University Jena, Germany
  October 2019 – August 2022
  Thesis: Feasible Interpolation as a Lower Bound Technique for Resolution and QBF Proof Systems,
  supervised by Prof. Olaf Beyersdorff

---

Organised Conferences

• Co-Organiser of ParamSAT 2027
  A special workshop to honour the scientific contribution of Prof. Stefan Szeider.
• Chair of Local Organisation Committee of STACS 2025
  Hosted at Friedrich Schiller University in Jena.

---

Reviewing

ICML 2026, STOC 2026

---

Teaching

Algorithmen und Datenstrukturen 2026