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)

Polynomial Delay Algorithm for Minimal Chordal Completions. - Caroline Brosse; Vincent Limouzy; Arnaud Mary (ICALP, 2022)

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 (Discret. Math. Theor. Comput. Sci., 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 (2023)

Locating-dominating sets in local tournaments. - Thomas Bellitto; Caroline Brosse; Benjamin Lévêque; Aline Parreau (Discret. Appl. Math., 2023)

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. - Caroline Brosse; Alessio Conte; Vincent Limouzy; Giulia Punzi; Davide Rucci (IWOCA, 2024)

The Graph Coloring Game on 4⨉n-Grids. - Caroline Brosse; Nicolas Almeida Martins; Nicolas Nisse; Rudini Menezes Sampaio (CoRR, 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., 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., 2024)

The Convex Set Forming Game. - Caroline Brosse; Nicolas Almeida Martins; Nicolas Nisse; Rudini Menezes Sampaio (Theor. Comput. Sci., 2025)

Determining a graph from its reconfiguration graph. - Gaétan Berthe; Caroline Brosse; Brian Hearn; Jan van den Heuvel; Pierre Hoppenot; Théo Pierron (CoRR, 2025)