Peeling Digital Potatoes. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (CCCG, 2019)

Efficient Algorithms to Test Digital Convexity. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gérard (DGCI, 2019)

Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (J. Math. Imaging Vis., 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)

Digital Convex + Unimodular Mapping = 8-Connected (All Points but One 4-Connected). - Loïc Crombez (DGMM, 2021)

Efficient Algorithms for Battleship. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (FUN, 2021)

Finding Digital convexity. (Le monde de la Convexité DiscrèTE). - Loïc Crombez (2021)

Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo (SoCG, 2022)

Greedy and Local Search Heuristics to Build Area-Optimal Polygons. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (ACM J. Exp. Algorithmics, 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)

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)