| 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 | 41 | 2015 |
| 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 | 40 | 2015 |
| Clique versus independent set N Bousquet, A Lagoutte, S Thomassé European Journal of Combinatorics 40, 73-92, 2014 | 25 | 2014 |
| Flooding games on graphs A Lagoutte, M Noual, E Thierry Discrete Applied Mathematics 164, 532-538, 2014 | 24 | 2014 |
| Strong edge-coloring of (3, Δ)-bipartite graphs J Bensmail, A Lagoutte, P Valicov Discrete Mathematics 339 (1), 391-398, 2016 | 17 | 2016 |
| Strong edge-coloring of (3, Δ)-bipartite graphs J Bensmail, A Lagoutte, P Valicov Discrete Mathematics 339 (1), 391-398, 2016 | 17 | 2016 |
| Jeux d'inondation dans les graphes A Lagoutte | 11 | 2010 |
| 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 | 10 | 2023 |
| 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 | 8 | 2017 |
| Clique–Stable Set separation in perfect graphs with no balanced skew-partitions A Lagoutte, T Trunck Discrete Mathematics 339 (6), 1809-1825, 2016 | 7 | 2016 |
| The complexity of shortest common supersequence for inputs with no identical consecutive letters A Lagoutte, S Tavenas arXiv preprint arXiv:1309.0422, 2013 | 7 | 2013 |
| Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition A Lagoutte, A Maletti Algebraic Foundations in Computer Science: Essays Dedicated to Symeon …, 2011 | 6 | 2011 |
| 2-free-flood-it is polynomial A Lagoutte arXiv preprint arXiv:1008.3091, 2010 | 5 | 2010 |
| 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 | 3 | 2024 |
| 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 | 3 | 2020 |
| Coloring graphs with no even hole : the triangle-free case A Lagoutte arXiv preprint arXiv:1503.08057, 2015 | 3 | 2015 |
| Identifying codes and VC-dimension N Bousquet, A Lagoutte, Z Li, A Parreau, S Thomassé bgw. labri. fr, 61, 2014 | 3 | 2014 |
| Quasi-P versus P A Lagoutte Manuscript, 2012 | 3 | 2012 |
| 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 | 2 | 2018 |
