2-FREE-FLOOD-IT is polynomial - Aurélie Lagoutte (CoRR, 2010)

Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition. - Aurélie Lagoutte; Andreas Maletti (Algebraic Foundations in Computer Science, 2011)

Alternative method for Hamilton-Jacobi PDEs in image processing. - Aurélie Lagoutte; Hadrien Salat; Corinne Vachier (Image Processing: Algorithms and Systems, 2011)

Composing extended top-down tree transducers. - Aurélie Lagoutte; Fabienne Braune; Daniel Quernheim; Andreas Maletti (EACL, 2012)

Graph coloring, communication complexity and the stubborn problem (Invited talk). - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (STACS, 2013)

The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters. - Aurélie Lagoutte; Sébastien Tavenas (CoRR, 2013)

Flooding games on graphs. - Aurélie Lagoutte; Mathilde Noual; Eric Thierry (Discret. Appl. Math., 2014)

Clique versus independent set. - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (Eur. J. Comb., 2014)

Coloring graphs with no even holes ≥ 6: the triangle-free case. - Aurélie Lagoutte (CoRR, 2015)

The Erdős-Hajnal conjecture for paths and antipaths. - Nicolas Bousquet 001; Aurélie Lagoutte; Stéphan Thomassé (J. Comb. Theory B, 2015)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. - Nicolas Bousquet 001; Aurélie Lagoutte; Zhentao Li; Aline Parreau; Stéphan Thomassé (SIAM J. Discret. Math., 2015)

Interactions between Cliques and Stable Sets in a Graph. (Interactions entre les Cliques et les Stables dans un Graphe). - Aurélie Lagoutte (2015)

Strong edge-coloring of (3, Δ)-bipartite graphs. - Julien Bensmail; Aurélie Lagoutte; Petru Valicov (Discret. Math., 2016)

Clique-Stable Set separation in perfect graphs with no balanced skew-partitions. - Aurélie Lagoutte; Théophile Trunck (Discret. Math., 2016)

Coloring Graphs with no Even Hole of Length at Least 6: the Triangle-Free Case. - Aurélie Lagoutte (Electron. J. Comb., 2017)

Colouring perfect graphs with bounded clique number. - Maria Chudnovsky; Aurélie Lagoutte; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2017)

Decomposition techniques applied to the Clique-Stable set separation problem. - Nicolas Bousquet 001; Aurélie Lagoutte; Frédéric Maffray; Lucas Pastor (Discret. Math., 2018)

Revisiting a Theorem by Folkman on Graph Colouring. - Marthe Bonamy; Pierre Charbit; Oscar Defrain; Gwenaël Joret; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor; Jean-Sébastien Sereni (Electron. J. Comb., 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)

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)

On Vizing's edge colouring question. - Marthe Bonamy; Oscar Defrain; Tereza Klimosová; Aurélie Lagoutte; Jonathan Narboni (J. Comb. Theory B, 2023)

The Canadian Traveller Problem on Outerplanar Graphs. - Laurent Beaudou; Pierre Bergé; Vsevolod Chernyshev; Antoine Dailly; Yan Gerard; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor (MFCS, 2024)

Local Certification of Geometric Graph Classes. - Oscar Defrain; Louis Esperet; Aurélie Lagoutte; Pat Morin; Jean-Florent Raymond (MFCS, 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)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors. - Lucas de Meyer; Frantisek Kardos; Aurélie Lagoutte; Guillem Perarnau (CoRR, 2025)