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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes.
Discret. Appl. Math., March, 2024
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
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
2018
Discret. Math., 2018
2017
Electron. J. Comb., 2017
2016
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
SIAM J. Discret. Math., 2015
2014
2013
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters.
CoRR, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
2012
2011
Proceedings of the Image Processing: Algorithms and Systems IX, 2011
Proceedings of the Algebraic Foundations in Computer Science, 2011
2010