I am actively engaged as a PhD student at the Algorithms and Complexity Group at the Technical University of Vienna, where I explore novel approaches to solving Constraint Programming instances. Topics of interest:

• Algorithms and Complexity

• Boolean satisfiability (SAT)

• Constraint Programming (CP)

• Graphs

• Large Language Models (LLMs)

In my Master's thesis, titled "SAT-based Local Improvement for the Closest String Problem," I investigated a new approach for improving existing heuristics for optimization problems. In my PhD, I research how LLMs could be used for solving CP instances more efficiently.

Algorithms for Satisfiability Testing

Florentina Voboril

September 2023, SKILL 2023, Gesellschaft für Informatik, Bonn.

Note: to appear