Aurélie Lagoutte

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 17

Top Venues

CoRR

J. Comb. Theory, Ser. B

Discret. Math.

Electron. J. Comb.

École normale supérieure de Lyon, France (PHD)

Education History

École normale supérieure de Lyon, France

PHD

Publications

Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
The Canadian Traveller Problem on Outerplanar Graphs. MFCS (2024)
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
The Canadian Traveller Problem on outerplanar graphs. CoRR (2024)
Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
Local Certification of Geometric Graph Classes. MFCS (2024)
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes. Discret. Appl. Math. 345 (2024)
Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
On Vizing's edge colouring question. J. Comb. Theory, Ser. B 159 (2023)
Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
Local certification of geometric graph classes. CoRR (2023)
Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
On Vizing's edge colouring question. CoRR (2021)
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR (2021)
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes. CoRR (2020)
Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27 (1) (2020)
Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor
Decomposition techniques applied to the Clique-Stable set separation problem. Discret. Math. 341 (5) (2018)
Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor
Decomposition techniques applied to the Clique-Stable set Separation problem. CoRR (2017)
Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl
Colouring perfect graphs with bounded clique number. J. Comb. Theory, Ser. B 122 (2017)
Aurélie Lagoutte
Coloring Graphs with no Even Hole of Length at Least 6: the Triangle-Free Case. Electron. J. Comb. 24 (3) (2017)
Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl
Colouring perfect graphs with bounded clique number. CoRR (2017)
Aurélie Lagoutte, Théophile Trunck
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions. Discret. Math. 339 (6) (2016)
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
Strong edge-coloring of (3, Δ)-bipartite graphs. Discret. Math. 339 (1) (2016)
Aurélie Lagoutte
Coloring graphs with no even holes ≥ 6: the triangle-free case. CoRR (2015)
Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
The Erdős-Hajnal conjecture for paths and antipaths. J. Comb. Theory, Ser. B 113 (2015)
Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. SIAM J. Discret. Math. 29 (4) (2015)
Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé
Identifying codes in hereditary classes of graphs and VC-dimension. CoRR (2014)
Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
Clique versus independent set. Eur. J. Comb. 40 (2014)
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
Strong edge-coloring of $(3, Δ)$-bipartite graphs. CoRR (2014)
Aurélie Lagoutte, Mathilde Noual, Eric Thierry
Flooding games on graphs. Discret. Appl. Math. 164 (2014)
Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
Graph coloring, communication complexity and the stubborn problem (Invited talk). STACS (2013)
Aurélie Lagoutte, Sébastien Tavenas
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters. CoRR (2013)
Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
Clique versus Independent Set CoRR (2013)
Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
The Erdős-Hajnal Conjecture for Paths and Antipaths CoRR (2013)
Aurélie Lagoutte, Théophile Trunck
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions. CoRR (2013)
Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti
Composing extended top-down tree transducers. EACL (2012)
Aurélie Lagoutte, Hadrien Salat, Corinne Vachier
Alternative method for Hamilton-Jacobi PDEs in image processing. Image Processing: Algorithms and Systems (2011)
Aurélie Lagoutte, Andreas Maletti
Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition. Algebraic Foundations in Computer Science (2011)
Aurélie Lagoutte
2-FREE-FLOOD-IT is polynomial CoRR (2010)

Aurélie Lagoutte.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Aurélie Lagoutte