Skip to Main content
Number of documents

15

CV

Journal articles10 documents

  • Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwénaël Joret, Aurélie Lagoutte, et al.. Revisiting a theorem by Folkman on graph colouring. The Electronic Journal of Combinatorics, Open Journal Systems, 2020, 27 (1), pp.P1.56. ⟨10.37236/8899⟩. ⟨hal-02194900v2⟩
  • Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor. Decomposition techniques applied to the Clique-Stable set separation problem. Discrete Mathematics, Elsevier, 2018, 341 (5), pp.1492 - 1501. ⟨10.1016/j.disc.2017.10.014⟩. ⟨hal-01804017⟩
  • Maria Chudnovsky, Aurélie Lagoutte, Paul Seymour, Sophie Spirkl. Colouring perfect graphs with bounded clique number. Journal of Combinatorial Theory, Series B, Elsevier, 2017, 122, pp.757-775. ⟨10.1016/j.jctb.2016.09.006⟩. ⟨hal-01561528⟩
  • Aurélie Lagoutte. Coloring graphs with no even hole ≥ 6: the triangle-free case. The Electronic Journal of Combinatorics, Open Journal Systems, 2017, 24 (3), pp.#P3.8. ⟨hal-01566608⟩
  • Aurélie Lagoutte, Théophile Trunck. Clique-Stable Set Separation in Perfect Graphs with no Balanced Skew-Partitions. Discrete Mathematics, Elsevier, 2016, 339, pp.1809 - 1825. ⟨10.1016/j.disc.2016.02.005⟩. ⟨hal-01508655⟩
  • Julien Bensmail, Aurélie Lagoutte, Petru Valicov. Strong edge-coloring of $(3, \Delta)$-bipartite graphs. Discrete Mathematics, Elsevier, 2016, 339 (1), ⟨10.1016/j.disc.2015.08.026⟩. ⟨hal-01080279v2⟩
  • Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé. The Erdős–Hajnal conjecture for paths and antipaths. Journal of Combinatorial Theory, Series B, Elsevier, 2015, 113, pp.261-264. ⟨10.1016/j.jctb.2015.01.001⟩. ⟨hal-01134469⟩
  • Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé. Identifying codes in hereditary classes of graphs and VC-dimension. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (4), pp.2047-2064. ⟨10.1137/14097879X⟩. ⟨hal-01038012v2⟩
  • Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé. Clique versus Independent Set. European Journal of Combinatorics, Elsevier, 2014, 40, pp.73-92. ⟨10.1016/j.ejc.2014.02.003⟩. ⟨hal-00958647⟩
  • Aurélie Lagoutte, Mathilde Noual, Eric Thierry. Flooding games on graphs. Discrete Applied Mathematics, Elsevier, 2014, LAGOS’11, Part 2, 164, pp.532-538. ⟨10.1016/j.dam.2013.09.024⟩. ⟨hal-00653714⟩

Conference papers2 documents

  • Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti. Composing extended top-down tree transducers. European Chapter of the Association for Computational Linguistics (EACL), 2012, Avignon, France. pp.808-817. ⟨hal-01508546⟩
  • Aurélie Lagoutte, Hadrien Salat, Corinne Vachier. Alternative method for Hamilton-Jacobi PDEs in image processing. Image Processing: Algorithms and Systems IX, Jan 2011, San Francisco, CA, United States. pp.787010, ⟨10.1117/12.872591⟩. ⟨hal-01508512⟩

Book sections1 document

Preprints, Working Papers, ...2 documents

  • Aurélie Lagoutte, Sébastien Tavenas. The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters. 2017. ⟨hal-01508495⟩
  • Aurélie Lagoutte. Jeux d'inondation dans les graphes. 2010. ⟨hal-00509488⟩