Sledovat
Aurélie Lagoutte
Aurélie Lagoutte
LIMOS, Université Clermont Auvergne, France
E-mailová adresa ověřena na: uca.fr - Domovská stránka
Název
Citace
Citace
Rok
Identifying codes in hereditary classes of graphs and VC-dimension
N Bousquet, A Lagoutte, Z Li, A Parreau, S Thomassé
SIAM Journal on Discrete Mathematics 29 (4), 2047-2064, 2015
442015
The Erdős–Hajnal conjecture for paths and antipaths
N Bousquet, A Lagoutte, S Thomassé
Journal of Combinatorial Theory, Series B 113, 261-264, 2015
422015
Clique versus independent set
N Bousquet, A Lagoutte, S Thomassé
European Journal of Combinatorics 40, 73-92, 2014
262014
Flooding games on graphs
A Lagoutte, M Noual, E Thierry
Discrete Applied Mathematics 164, 532-538, 2014
242014
Strong edge-coloring of (3, Δ)-bipartite graphs
J Bensmail, A Lagoutte, P Valicov
Discrete Mathematics 339 (1), 391-398, 2016
172016
Jeux d'inondation dans les graphes
A Lagoutte
112010
On Vizing's edge colouring question
M Bonamy, O Defrain, T Klimošová, A Lagoutte, J Narboni
Journal of Combinatorial Theory, Series B 159, 126-139, 2023
92023
Colouring perfect graphs with bounded clique number
M Chudnovsky, A Lagoutte, P Seymour, S Spirkl
Journal of Combinatorial Theory, Series B 122, 757-775, 2017
92017
Clique–Stable Set separation in perfect graphs with no balanced skew-partitions
A Lagoutte, T Trunck
Discrete Mathematics 339 (6), 1809-1825, 2016
72016
The complexity of shortest common supersequence for inputs with no identical consecutive letters
A Lagoutte, S Tavenas
arXiv preprint arXiv:1309.0422, 2013
72013
Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition
A Lagoutte, A Maletti
Algebraic Foundations in Computer Science: Essays Dedicated to Symeon …, 2011
52011
2-free-flood-it is polynomial
A Lagoutte
arXiv preprint arXiv:1008.3091, 2010
52010
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
L Beaudou, C Brosse, O Defrain, F Foucaud, A Lagoutte, V Limouzy, ...
Discrete Mathematics & Theoretical Computer Science 25 (Graph Theory), 2024
42024
Revisiting a theorem by Folkman on graph colouring
M Bonamy, P Charbit, O Defrain, G Joret, A Lagoutte, V Limouzy, L Pastor, ...
arXiv preprint arXiv:1907.11429, 2019
42019
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes
C Brosse, A Lagoutte, V Limouzy, A Mary, L Pastor
arXiv preprint arXiv:2007.01031, 2020
32020
Coloring graphs with no even hole : the triangle-free case
A Lagoutte
arXiv preprint arXiv:1503.08057, 2015
32015
Quasi-P versus P
A Lagoutte
Manuscript, 2012
32012
Identifying codes in hereditary classes of graphs and VC-dimension. Manuscript, 2014
N Bousquet, A Lagoutte, Z Li, A Parreau, S Thomassé
3
Decomposition techniques applied to the clique-stable set separation problem
N Bousquet, A Lagoutte, F Maffray, L Pastor
Discrete Mathematics 341 (5), 1492-1501, 2018
22018
Identifying codes and VC-dimension
N Bousquet, A Lagoutte, Z Li, A Parreau, S Thomassé
bgw. labri. fr, 61, 2014
22014
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20