Aurélie Lagoutte

37 papers A 2B 2Journal 30Unranked 2

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