Valentin Bouquet

According to our database, Valentin Bouquet authored at least 7 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

The complexity of the perfect matching-cut problem.

Valentin Bouquet, Christophe Picouleau

J. Graph Theory, March, 2025

2024

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

2022

Problèmes de domination et partitionnement de graphes : complexité, structure, criticité. (Domination problems and partitions of graphs : complexity, structure, criticality).

Valentin Bouquet

PhD thesis, 2022

2021

On the vertices belonging to all, some, none minimum dominating set.

Valentin Bouquet, François Delbot, Christophe Picouleau

Discret. Appl. Math., 2021

The complexity of the Bondage problem in planar graphs.

Valentin Bouquet

CoRR, 2021

2020

On Minimum Dominating Sets in cubic and (claw, H)-free graphs.

Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis

CoRR, 2020

2018

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

Proceedings of the Operations Research Proceedings 2018, 2018