Valentin Bouquet

Orcid: 0000-0003-4681-5910

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
1
1
2
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
The complexity of the perfect matching-cut problem.
J. Graph Theory, March, 2025

2024
On the complexity of Dominating Set for graphs with fixed diameter.
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).
PhD thesis, 2022

2021
On the vertices belonging to all, some, none minimum dominating set.
Discret. Appl. Math., 2021

The complexity of the Bondage problem in planar graphs.
CoRR, 2021

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

2018
Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks.
Proceedings of the Operations Research Proceedings 2018, 2018


  Loading...