Valentin Bouquet

Valentin Bouquet

Attaché temporaire enseignement/recherche
Team: Optimisation combinatoire
Personal website:
Office: 31.1.76

I am a third year Ph.D. student at CEDRIC laboratory (CNAM), supervised by Christophe Picouleau, Stéphane Rovédakis and François Delbot (LIP6 laboratory). I study mainly structural, algorithmic and complexity aspects of the Domination problem in graphs.

2024

Articles de revue

  1. Bouquet, V. and Picouleau, C. The complexity of the perfect matching-cut problem. In Journal of Graph Theory, 2024. doi  www 
  1. Bouquet, V.; Delbot, F. c.; Picouleau, C. and Rovedakis, S. On the complexity of Dominating Set for graphs with fixed diameter. In Theoretical Computer Science: 114561, 2024. doi  www 

2022

Articles de conférence

  1. Bouquet, V. and Picouleau, C. Couplage parfait disconnectant pour les graphes bipartis de diamètre 3. In 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Villeurbanne - Lyon, France, 2022. www 
  1. Picouleau, C. and Bouquet, V. The Perfect Matching-Cut problem in bipartite graphs with diameter three. In ICGT 2022, Montpellier, France, 2022. www 
  1. Bouquet, V.; Delbot, F. and Picouleau, C. Partition de graphe sous contrainte de ratio de degré. In 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Villeurbanne - Lyon, France, 2022. www 

Non publié

  1. Bouquet, V. The bondage number of chordal graphs. , working paper or preprint. www 

2021

Articles de revue

  1. Bouquet, V.; Delbot, F. c. and Picouleau, C. On the vertices belonging to all, some, none minimum dominating set. In Discrete Applied Mathematics, 288: 9-19, 2021. doi  www 

Non publié

  1. Bouquet, V. and Picouleau, C. The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs. , working paper or preprint. www 
  1. Bouquet, V. The complexity of the Bondage problem in planar graphs. , 20 pages, 12 figures. www 

2020

Non publié

  1. Bouquet, V.; Delbot, F. c. and Picouleau, C. Partition of graphs with maximum degree ratio. , working paper or preprint. www 
  1. Bouquet, V. and Picouleau, C. The complexity of the Perfect Matching-Cut problem. , working paper or preprint. www 
  1. Bouquet, V.; Delbot, F. c.; Picouleau, C. and Rovedakis, S. On Minimum Dominating Sets in cubic and (claw,H)-free graphs. , working paper or preprint. www 
Top