Aurélie Lagoutte

According to our database, Aurélie Lagoutte authored at least 24 papers between 2010 and 2024.

Collaborative distances:

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

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

The Canadian Traveller Problem on outerplanar graphs.

Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor

CoRR, 2024

2023

On Vizing's edge colouring question.

Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni

J. Comb. Theory, Ser. B, March, 2023

Local certification of geometric graph classes.

Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond

CoRR, 2023

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

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

2018

Decomposition techniques applied to the Clique-Stable set separation problem.

Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor

Discret. Math., 2018

2017

Colouring perfect graphs with bounded clique number.

Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl

J. Comb. Theory, Ser. B, 2017

Coloring Graphs with no Even Hole of Length at Least 6: the Triangle-Free Case.

Aurélie Lagoutte

Electron. J. Comb., 2017

2016

Clique-Stable Set separation in perfect graphs with no balanced skew-partitions.

Aurélie Lagoutte, Théophile Trunck

Discret. Math., 2016

Strong edge-coloring of (3, Δ)-bipartite graphs.

Julien Bensmail, Aurélie Lagoutte, Petru Valicov

Discret. Math., 2016

2015

Interactions between Cliques and Stable Sets in a Graph. (Interactions entre les Cliques et les Stables dans un Graphe).

Aurélie Lagoutte

PhD thesis, 2015

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension.

Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé

SIAM J. Discret. Math., 2015

The Erdős-Hajnal conjecture for paths and antipaths.

Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé

J. Comb. Theory, Ser. B, 2015

Coloring graphs with no even holes ≥ 6: the triangle-free case.

Aurélie Lagoutte

CoRR, 2015

2014

Clique versus independent set.

Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé

Eur. J. Comb., 2014

Flooding games on graphs.

Aurélie Lagoutte, Mathilde Noual, Eric Thierry

Discret. Appl. Math., 2014

2013

The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters.

Aurélie Lagoutte, Sébastien Tavenas

CoRR, 2013

Graph coloring, communication complexity and the stubborn problem (Invited talk).

Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Composing extended top-down tree transducers.

Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti

Proceedings of the EACL 2012, 2012

2011

Alternative method for Hamilton-Jacobi PDEs in image processing.

Aurélie Lagoutte, Hadrien Salat, Corinne Vachier

Proceedings of the Image Processing: Algorithms and Systems IX, 2011

Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition.

Aurélie Lagoutte, Andreas Maletti

Proceedings of the Algebraic Foundations in Computer Science, 2011

2010

2-FREE-FLOOD-IT is polynomial

Aurélie Lagoutte

CoRR, 2010