Research.
Research.
I am actively engaged as a PhD student at the Algorithms and Complexity Group at the Technical University of Vienna, where I explore how Large Language Models (LLMs) can be used to solve Constraint Programming instances more efficiently. Topics of interest:
Large Language Models (LLMs)
Constraint Programming (CP)
Boolean satisfiability (SAT)
Graphs
Algorithms and Complexity
Generating Streamlining Constraints with Large Language Models
Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
arXiv preprint, January 2025
SAT-based Local Improvement for the Closest String Problem
Florentina Voboril
Master's Thesis, Technische Universität Wien, 2024
Algorithms for Satisfiability Testing
Florentina Voboril
pages 51-62, September 2023, SKILL 2023, Gesellschaft für Informatik, Bonn.
Computing Treewidth with Constraint Programming
Florentina Voboril
pages 115–126, September 2022, SKILL 2022, Gesellschaft für Informatik, Bonn.
Initial Learning of Textual Programming at School: Evolution of Outreach Activities
Martina Landman, Gerald Futschek, Svetlana Unkovic, Florentina Voboril
OLYMPIADS IN INFORMATICS, pages 43–53, January 2022.