Research Topics

My research focuses on the theoretical aspects of combinatorial optimization, in particular on the polyhedral structures arising in combinatorial optimization problems. I obtained my PhD at the LIPN, with a dissertation on (box-)total dual integrality. My ongoing research explores:

Concurrent Open Shop Coloring

This project focuses on the Concurrent Open Shop Coloring Problem, a variant of the Open Shop Scheduling Problem. We investigate it from both computational and algorithmic perspectives, motivated by its applications in maintenance scheduling, frequency assignment, and privacy-oriented learning.
[Barbato, Delle Donne]

Box-TDIness of the Stable Matching Polytope

This project explores the polyhedral properties of the Stable Matching Problem and the Stable Admissions Problem, with a particular focus on the notion of box-TDIness.
[Barbato]

A Compact Formulation of the Edge Coloring Polytope

This project aims to explore the structure of the Edge Coloring Polytope and to provide a compact formulation for some graph classes.
[Barbato, Pisanu]

Mixed Dominating Set of Bipartite Graphs

This project focuses on the theoretical aspects of the Mixed Dominating Set for some classes of bipartite graphs from both an algorithmic and polyhedral point of view.
[Ferrarini, Kober, Yudisky]

Sequential Picking Games on Matroids against Greedy

In this project, we study the complexity and optimization aspects of a sequential picking game against a greedy player, where the underlying set forms a matroid.
[Cornaz, Gourvès, Lampis]

Publications

Here is a list of my publications.
For each element, the title links to an open-access version of the paper (not peer-reviewed). The journal name links to the official publication.

Journal Articles

Conference Papers

Preprints

Ph.D. Thesis

Teaching