PackingSolver: a solver for Packing Problems. - Florian Fontan; Luc Libralesso (CoRR, 2020)

An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem. - Luc Libralesso; Florian Fontan (Eur. J. Oper. Res., 2021)

Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge). - Florian Fontan; Pascal Lafourcade 001; Luc Libralesso; Benjamin Momège (SoCG, 2022)

Innovative ideas for teaching supports: Application to Graph theory. - Nicolas Catusse; Hadrien Cambazard; Nadia Brauner; Bernard Penz; Florian Fontan (CoRR, 2022)

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. - Loïc Crombez; Guilherme Dias da Fonseca; Florian Fontan; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso; Benjamin Momège; Jack Spalding-Jamieson; Brandon Zhang; Da Wei Zheng (ACM J. Exp. Algorithmics, 2023)

Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization. - Khadija Hadj Salem; Luc Libralesso; Vincent Jost; Florian Fontan; Frédéric Maffray (Ann. Oper. Res., 2024)