Low temperature direct bonding: An attractive technique for heterostructures build-up. - H. Moriceau; F. Rieutord; F. Fournel; Léa Di Cioccio; C. Moulet; Luc Libralesso; Pierric Gueguen; Rachid Taibi; C. Deguet (Microelectron. Reliab., 2012)

Tree search algorithms for the Sequential Ordering Problem. - Luc Libralesso; Abdel-Malik Bouhassoun; Hadrien Cambazard; Vincent Jost (CoRR, 2019)

Do balanced words have a short period? - Nadia Brauner; Yves Crama; Etienne Delaporte; Vincent Jost; Luc Libralesso (Theor. Comput. Sci., 2019)

Tree Search for the Sequential Ordering Problem. - Luc Libralesso; Abdel-Malik Bouhassoun; Hadrien Cambazard; Vincent Jost (ECAI, 2020)

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

Anytime tree search for combinatorial optimization. (Recherches arborescentes anytime pour l'optimisation combinatoire). - Luc Libralesso (2020)

Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso (SoCG, 2021)

Automatic Generation of Declarative Models For Differential Cryptanalysis. - Luc Libralesso; François Delobel; Pascal Lafourcade 001; Christine Solnon (CP, 2021)

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)

Iterative beam search algorithms for the permutation flowshop. - Luc Libralesso; Pablo Andres Focke; Aurélien Secardin; Vincent Jost (Eur. J. Oper. Res., 2022)

Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle. - Léo Robert; Daiki Miyahara; Pascal Lafourcade 001; Luc Libralesso; Takaaki Mizuki (Inf. Comput., 2022)

Shadoks Approach to Low-Makespan Coordinated Motion Planning. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso (ACM J. Exp. Algorithmics, 2022)

Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance. - Khadija Hadj Salem; Vincent Jost; Yann Kieffer; Luc Libralesso; Stéphane Mancini (Oper. Res., 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)