Aurélie Lagoutte

Orcid: 0009-0009-9351-1099

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes.
Discret. Appl. Math., March, 2024

Local Certification of Geometric Graph Classes.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

The Canadian Traveller Problem on Outerplanar Graphs.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
On Vizing's edge colouring question.
J. Comb. Theory B, March, 2023

2021
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly.
CoRR, 2021

2020
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes.
CoRR, 2020

Revisiting a Theorem by Folkman on Graph Colouring.
Electron. J. Comb., 2020

2018
Decomposition techniques applied to the Clique-Stable set separation problem.
Discret. Math., 2018

2017
Colouring perfect graphs with bounded clique number.
J. Comb. Theory B, 2017

Coloring Graphs with no Even Hole of Length at Least 6: the Triangle-Free Case.
Electron. J. Comb., 2017

2016
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions.
Discret. Math., 2016

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

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

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension.
SIAM J. Discret. Math., 2015

The Erdős-Hajnal conjecture for paths and antipaths.
J. Comb. Theory B, 2015

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

2014
Clique versus independent set.
Eur. J. Comb., 2014

Flooding games on graphs.
Discret. Appl. Math., 2014

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

Graph coloring, communication complexity and the stubborn problem (Invited talk).
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012
Composing extended top-down tree transducers.
Proceedings of the EACL 2012, 2012

2011
Alternative method for Hamilton-Jacobi PDEs in image processing.
Proceedings of the Image Processing: Algorithms and Systems IX, 2011

Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition.
Proceedings of the Algebraic Foundations in Computer Science, 2011

2010
2-FREE-FLOOD-IT is polynomial
CoRR, 2010


  Loading...