I am a third year PhD Student at G-SCOP laboratory in Grenoble, France.
My PhD is under the supervision of Nadia Brauner and Nicolas Catusse.
I am particularly interested in computational proofs for online optimization problems. The main idea is that proofs of lower and upper bounds are often fairly long case studies – so perhaps a computer would be better suited to construct such bounds. Online bin stretching is the main problem I tackle as computational proofs are state of the art for it. It is a packing problem where items need to be placed into bins in an online manner. The computational methods consist in viewing this problem as a two-player game between the algorithm and a malicious adversary giving items, and finding strategies for a player via a min-max search. Computation time is the main limiting factor to obtain better results. My work so far has been to extend computational proofs in several directions: improving the search technique itself to reduce computation times and obtain better bounds, proving their convergence, considering randomized algorithms and algorithms augmented with predictions.
Computing performance guarantees for algorithms with predictions in online bin stretching
2025
Robust single-stage selection problems with budgeted interval uncertainty
2025
On the convergence of computational methods for the online bin stretching problem
Computational bounds on randomized algorithms for online bin stretching
Online bin stretching lower bounds: Improved search of computational proofs
Teaching
- Automata and language theory, for second year students at Université Grenoble Alpes
- Mathematics, Modelization and Computer science, for 1st year students at the engineering school of Grenoble INP, Génie Industriel
- Systems and programming environments, for first year students at Université Grenoble Alpes
- Introduction to linear algebra, for first year students at Université Grenoble Alpes