Caroline Brosse

17 papers A* 1C 2Journal 13
YearRankTypeTitle / Venue / Authors
2025 J jnl
Determining a graph from its reconfiguration graph.
CoRR
Gaétan Berthe, Caroline Brosse, Brian Hearn, Jan van den Heuvel, Pierre Hoppenot, Théo Pierron
2025 J jnl
The Convex Set Forming Game.
Theor. Comput. Sci.
Caroline Brosse, Nicolas Almeida Martins, Nicolas Nisse, Rudini Menezes Sampaio
2025 C conf
The Graph Coloring Game on 4 x n-Grids.
LAGOS
Caroline Brosse, Nicolas Almeida Martins, Nicolas Nisse, Rudini M. Sampaio
2024 J jnl
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes.
Discret. Appl. Math.
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor
2024 J jnl
On the hardness of inclusion-wise minimal separators enumeration.
Inf. Process. Lett.
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
2024 C conf
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
IWOCA
Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci
2024 J jnl
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
CoRR
Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci
2024 J jnl
The Graph Coloring Game on 4⨉n-Grids.
CoRR
Caroline Brosse, Nicolas Almeida Martins, Nicolas Nisse, Rudini Menezes Sampaio
2023 J jnl
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly.
Discret. Math. Theor. Comput. Sci.
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
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 J jnl
Locating-dominating sets in local tournaments.
Discret. Appl. Math.
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
2023 J jnl
On the hardness of inclusion-wise minimal separators enumeration.
CoRR
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
2022 A* conf
Polynomial Delay Algorithm for Minimal Chordal Completions.
ICALP
Caroline Brosse, Vincent Limouzy, Arnaud Mary
2021 J jnl
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly.
CoRR
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2021 J jnl
Locating Dominating Sets in local tournaments.
CoRR
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
2021 J jnl
Polynomial delay algorithm for minimal chordal completions.
CoRR
Caroline Brosse, Vincent Limouzy, Arnaud Mary
2020 J jnl
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes.
CoRR
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor