Havannah and TwixT are PSPACE-complete. - Edouard Bonnet; Florian Jamain; Abdallah Saffidine (Computers and Games, 2013)

On the Complexity of Trick-Taking Card Games. - Edouard Bonnet; Florian Jamain; Abdallah Saffidine (IJCAI, 2013)

On the number of non-dominated points of a multicriteria optimization problem. - Cristina Bazgan; Florian Jamain; Daniel Vanderpooten (Discret. Appl. Math., 2013)

Discrete representations of the nondominated set for multi-objective optimization problems. (Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs). - Florian Jamain (2014)

Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game. - Edouard Bonnet; Florian Jamain; Abdallah Saffidine (ACG, 2015)

Approximate Pareto sets of minimal size for multi-objective optimization problems. - Cristina Bazgan; Florian Jamain; Daniel Vanderpooten (Oper. Res. Lett., 2015)

On the complexity of connection games. - Édouard Bonnet; Florian Jamain; Abdallah Saffidine (Theor. Comput. Sci., 2016)

Discrete representation of the non-dominated set for multi-objective optimization problems using kernels. - Cristina Bazgan; Florian Jamain; Daniel Vanderpooten (Eur. J. Oper. Res., 2017)

Formal Analysis and Monitoring of Legacy Safety-Critical Interlocking Systems with the Use of Certified Industrial Tools. - Dalay Israel de Almeida Pereira; Florian Jamain; Thierry Lecomte (FMICS, 2024)