Caroline Brosse

According to our database1, Caroline Brosse authored at least 8 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the hardness of inclusion-wise minimal separators enumeration.
Inf. Process. Lett., March, 2024

Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes.
Discret. Appl. Math., March, 2024

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023
Locating-dominating sets in local tournaments.
Discret. Appl. Math., October, 2023

Efficient enumeration algorithms for minimal graph completions and deletions. (Algorithmes d'énumération efficaces pour les complétions et délétions minimales de graphes).
PhD thesis, 2023

2022
Polynomial Delay Algorithm for Minimal Chordal Completions.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly.
CoRR, 2021

2020
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes.
CoRR, 2020


  Loading...