A better list heuristic for vertex cover. - François Delbot; Christian Laforest (Inf. Process. Lett., 2008)

Mean analysis of an online algorithm for the vertex cover problem. - Etienne Birmelé; François Delbot; Christian Laforest (Inf. Process. Lett., 2009)

Au delà de l'évaluation en pire cas : comparaison et évaluation en moyenne de processus d'optimisation pour le problème du vertex cover et des arbres de connexion de groupes dynamiques. (Beyond the worst case evaluation: Comparison and average evaluation of optimization processes in the case of the vertex cover problem and trees connecting groups). - François Delbot (2009)

Analytical and experimental comparison of six algorithms for the vertex cover problem. - François Delbot; Christian Laforest (ACM J. Exp. Algorithmics, 2010)

Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre. - Etienne Birmelé; François Delbot; Christian Laforest; Nicolas Thibault (Tech. Sci. Informatiques, 2011)

New Approximation Algorithms for the Vertex Cover Problem. - François Delbot; Christian Laforest; Raksmey Phan (IWOCA, 2013)

Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems. - François Delbot; Christian Laforest; Stephane Rovedakis (OPODIS, 2014)

Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks. - Valentin Bouquet; Kymble Christophe; François Delbot; Gaétan Le Chat; Jean-François Pradat-Peyre (OR, 2018)

Manifold Learning for Innovation Funding: Identification of Potential Funding Recipients. - Vincent Grollemund; Gaétan Le Chat; Jean-François Pradat-Peyre; François Delbot (AIAI (1), 2020)

On Minimum Dominating Sets in cubic and (claw, H)-free graphs. - Valentin Bouquet; François Delbot; Christophe Picouleau; Stéphane Rovedakis (CoRR, 2020)

On the vertices belonging to all, some, none minimum dominating set. - Valentin Bouquet; François Delbot; Christophe Picouleau (Discret. Appl. Math., 2021)

Experimental Comparison of Metaheuristics for Feature Selection in Machine Learning in the Medical Context. - Thibault Anani; François Delbot; Jean-François Pradat-Peyre (AIAI (2), 2022)

On the complexity of Dominating Set for graphs with fixed diameter. - Valentin Bouquet; François Delbot; Christophe Picouleau; Stéphane Rovedakis (Theor. Comput. Sci., 2024)

Partition of graphs with maximum degree ratio. - Valentin Bouquet; François Delbot; Christophe Picouleau (Ann. Oper. Res., 2025)