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)

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

The complexity of the Bondage problem in planar graphs. - Valentin Bouquet (CoRR, 2021)

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

Problèmes de domination et partitionnement de graphes : complexité, structure, criticité. (Domination problems and partitions of graphs : complexity, structure, criticality). - Valentin Bouquet (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)

The complexity of the perfect matching-cut problem. - Valentin Bouquet; Christophe Picouleau (J. Graph Theory, 2025)

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