Caroline Brosse

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

Collaborative distances:

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

2024

On the hardness of inclusion-wise minimal separators enumeration.

Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa

Inf. Process. Lett., March, 2024

Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes.

Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor

Discret. Appl. Math., March, 2024

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.

Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci

CoRR, 2024

2023

Locating-dominating sets in local tournaments.

Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau

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).

Caroline Brosse

PhD thesis, 2023

2022

Polynomial Delay Algorithm for Minimal Chordal Completions.

Caroline Brosse, Vincent Limouzy, Arnaud Mary

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.

Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor

CoRR, 2021

2020

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

Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor

CoRR, 2020