Associate professor - LIFO, Université d'Orléans
Since 2024, I am a permanent member of the LIFO's GAMoC research team.
I am interested in many problems of graph theory. My research is mostly about enumeration algorithms for structures in graphs, in particular maximal induced subgraphs, minimal completions and deletions. I also work on location problems on graphs, digraphs and oriented graphs.
I prepared my thesis at LIMOS (Clermont-Ferrand, France) between September 2019 and September 2023 under the supervision of Vincent Limouzy, Aurélie Lagoutte and Lucas Pastor.
[Read the manuscript] (mostly in English).
After that, I was a post-doctoral researcher in the COATI team of Inria, Université Côte d'Azur. I worked for the ANR project DIGRAPHS with Frédéric Havet.
I was also there : EJCIM 2019, CoRe 2019, EJCIM 2020, JGA 2020, WEPA 2020 (OC), JGA 2021, Workshop on enumeration and databases (Lyon, 2023), EPIT 2023, STRUG (Warsaw, 2023), JCALM 2023, JNIM 2024, JGA 2024.
Determining a graph from its reconfiguration graph, with Gaétan Berthe, Brian Hearn, Jan van den Heuvel, Pierre Hoppenot, and Théo Pierron; 2025, preprint. [arXiv]
The Graph Coloring Game on 4×n-Grids, with Nicolas Martins, Nicolas Nisse, and Rudini Sampaio; 2024, preprint. [arXiv]
The Convex Set Forming Game, with Nicolas Martins, Nicolas Nisse, and Rudini Sampaio; accepted at Theoretical Computer Science, 2024. [hal]
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space, with Alessio Conte, Vincent Limouzy, Giulia Punzi, and Davide Rucci; IWOCA 2024. [arXiv]
On the hardness of inclusion-wise minimal separators enumeration, with Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, and Kunihiro Wasa; Information Processing Letters, 185, 106469. 2023. [arXiv]
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly, with Laurent Beaudou, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, and Lucas Pastor; Discrete Mathematics & Theoretical Computer Science 25(2):25. 2023. [arXiv]
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes, with Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, and Lucas Pastor; Discrete Applied Mathematics, 345, 34-51. 2023. [arXiv]
Locating-dominating sets in local tournaments, with Thomas Bellitto, Benjamin Lévêque, and Aline Parreau ; Discrete Applied Mathematics, 337, 14-24. 2023. [arXiv]
Polynomial delay algorithm for minimal chordal completions, with Vincent Limouzy and Arnaud Mary ; ICALP 2022. [pdf]
During my PhD, I had the opportunity to teach several subjects to under-graduate university students. For example, I taught graph theory, databases with SQL, C and Python programming, or binary representations.
I now teach at the Faculty of Law, Economics and Management of the University of Orléans.
In 2023-2024, I took part to Terra Numerica (Sophia-Antipolis).
We welcomed the general audience for visits and games around digital sciences.
I also gave talks for secondary school pupils.
In 2021-2022, I was a volunteer at Maison des Mathématiques et de l'Informatique (Lyon)
I animated workshops for secondary school pupils on the theme of Artificial Intelligence.
I also gave some "non-specialist" talks (in French) in several occasions, such as the Séminaire de la Détente Mathématique ("chill maths seminar") held in Lyon since 2014, or the Girls' Math Days.
caroline.brosse[at]univ-orleans.fr
LIFO
Bâtiment IIIA
Rue Léonard de Vinci
45067 Orléans Cedex 2
FRANCE
Office B10