{"id":18,"date":"2023-04-27T13:55:11","date_gmt":"2023-04-27T11:55:11","guid":{"rendered":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/?page_id=18"},"modified":"2026-03-19T19:52:20","modified_gmt":"2026-03-19T18:52:20","slug":"research","status":"publish","type":"page","link":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/research\/","title":{"rendered":"Research"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">Publications<\/h2>\n\n\n\n<h3 class=\"wp-block-heading\">Upcoming work<\/h3>\n\n\n\n<p><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>An algorithmic Vizing&rsquo;s theorem: toward efficient edge-coloring sampling with an optimal number of colorsng potential<\/strong>. With L. De Meyer, F. Kardo\u02c7s, G. Perarnau. <em>Submitted<\/em>. [<a href=\"https:\/\/arxiv.org\/abs\/2501.11541\">ArXiV<\/a>]<\/li>\n\n\n\n<li><strong>(2K2, W4)-free graphs are&nbsp;\u03c9&nbsp;+1 colorable<\/strong>. With N.&nbsp;Bousquet.&nbsp;<em>In preparation<\/em>.&nbsp;<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Journal papers<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly<\/strong>. With L. Beaudou,&nbsp;C. Brosse,&nbsp;O. Defrain,&nbsp;F. Foucaud, V. Limouzy,&nbsp;and L. Pastor. <em>Discrete Mathematics &amp; Theoretical Computer Science<\/em>, 25(2), 2024 [<a href=\"https:\/\/doi.org\/10.46298\/dmtcs.8715\">DOI<\/a> | <a href=\"https:\/\/arxiv.org\/abs\/2110.14003\">ArXiV<\/a>]<\/li>\n\n\n\n<li><strong>Efficient enumeration of maximal split subgraphs and sub-cographs and related classes<\/strong>.&nbsp;With C. Brosse, V. Limouzy, A. Mary and L. Pastor.&nbsp;<em>Discrete Applied Mathematics<\/em>, 345:34-51, 2024 [<a href=\"https:\/\/doi.org\/10.1016\/j.dam.2023.10.025\">DOI<\/a>| <a href=\"https:\/\/arxiv.org\/abs\/2007.01031\">ArXiV<\/a>]<\/li>\n\n\n\n<li><strong>On Vizing&rsquo;s edge colouring question<\/strong>. With M. Bonamy, O. Defrain, T. Klimo\u0161ov\u00e1&nbsp;and&nbsp;J. Narboni.&nbsp;<em>Journal of Combinatorial Theory, series B,<\/em>159:126-139, 2023&nbsp;[<a href=\"https:\/\/doi.org\/10.1016\/j.jctb.2022.10.005\">DOI<\/a>&nbsp;|&nbsp;<a href=\"https:\/\/arxiv.org\/abs\/2107.07900\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>Revisiting a theorem by Folkman on graph colouring<\/strong>. With&nbsp;M. Bonamy, P. Charbit, O. Defrain, G. Joret,&nbsp;V. Limouzy, L. Pastor, and J.-S. Sereni.&nbsp;<em>Electronic Journal of Combinatorics,&nbsp;<\/em>27(1), P1.56, 2020&nbsp;[<a href=\"https:\/\/doi.org\/10.37236\/8899\">DOI<\/a>&nbsp;|&nbsp;<a href=\"https:\/\/arxiv.org\/abs\/1907.11429\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>Decomposition techniques for the Clique-Stable set Separation problem<\/strong>. With Nicolas Bousquet, Fr\u00e9d\u00e9ric Maffray and Lucas Pastor.<em>&nbsp;Discrete Mathematics<\/em>, 341(5):1492-1501, 2018. [<a href=\"https:\/\/doi.org\/10.1016\/j.disc.2017.10.014\">DOI<\/a>&nbsp;|&nbsp;<a href=\"https:\/\/arxiv.org\/abs\/1703.07106\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>Coloring graphs with no even hole&nbsp;of length at least 6 : the triangle-free case<\/strong>.&nbsp;<em>Electronic Journal of Combinatorics,&nbsp;<\/em>24(3), #P3.8, 2017. [<a href=\"https:\/\/doi.org\/10.37236\/5351\">DOI<\/a> | <a href=\"http:\/\/arxiv.org\/abs\/1503.08057\">ArXiv<\/a>].<\/li>\n\n\n\n<li><strong>Coloring perfect graphs with bounded clique number<\/strong>.&nbsp;With Maria Chudnovsky, Paul Seymour and Sophie Spirkl.&nbsp;<em>&nbsp;Journal of Combinatorial&nbsp;Theory, Series B,&nbsp;<\/em>122:757-775, 2017 . [<a href=\"https:\/\/doi.org\/10.1016\/j.jctb.2016.09.006\">DOI<\/a> | <a href=\"https:\/\/arxiv.org\/abs\/1707.03747\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>Clique Stable separation in perfect graphs with no balanced skew partition<\/strong>.&nbsp;With Th\u00e9ophile Trunck.&nbsp;<em>Discrete Mathematics,&nbsp;<\/em>339(6):1809-1825, 2016.&nbsp;[<a href=\"http:\/\/dx.doi.org\/10.1016\/j.disc.2016.02.005\">DOI<\/a>&nbsp;|&nbsp;<a href=\"http:\/\/arxiv.org\/abs\/1312.2730\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>Identifying codes and VC-dimension<\/strong>. With Nicolas Bousquet, Zhentao Li, Aline Parreau and St\u00e9phan Thomass\u00e9.&nbsp;<em>SIAM Journal of Discrete Mathematics<\/em>, 29(4):2047-2064, 2015.&nbsp;[<a href=\"https:\/\/doi.org\/10.1137\/14097879X\">DOI<\/a>&nbsp;|&nbsp;<a href=\"http:\/\/arxiv.org\/abs\/1407.5833\">ArXiv<\/a>] (A short conference version appeared in&nbsp;BGW&rsquo;14).<\/li>\n\n\n\n<li><strong>Strong edge-coloring of (3, delta)-bipartite graphs<\/strong>. With Julien Bensmail and Petru Valicov.&nbsp;<em>Discrete Mathematics, 339(1):391-398,<\/em>&nbsp;2015.&nbsp;[<a href=\"http:\/\/dx.doi.org\/10.1016\/j.disc.2015.08.026\">DOI<\/a>&nbsp;|&nbsp;<a href=\"http:\/\/arxiv.org\/abs\/1412.2624\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>The Erd\u00f6s-Hajnal conjecture for&nbsp;paths and antipaths<\/strong>. With Nicolas Bousquet and St\u00e9phan Thomass\u00e9. &nbsp;<em>Journal of Combinatorial Theory, series B,&nbsp;<\/em>113:261-264, 2015. [<a href=\"https:\/\/doi.org\/10.1016\/j.jctb.2015.01.001\">DOI<\/a> | <a href=\"http:\/\/arxiv.org\/abs\/1303.5205\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>Clique versus Independent Set<\/strong>.&nbsp;With Nicolas Bousquet and St\u00e9phan Thomass\u00e9.&nbsp;<em>European Journal of Combinatorics<\/em>, 40:73-92, 2014. [<a href=\"https:\/\/doi.org\/10.1016\/j.ejc.2014.02.003\">DOI<\/a> | <a href=\"http:\/\/arxiv.org\/abs\/1301.2474\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>Flooding games on graphs<\/strong>. With Mathilde Noual and Eric Thierry.<em>&nbsp;Discrete Applied Mathematics,&nbsp;<\/em>164(2):532-538,&nbsp;2014. [<a href=\"http:\/\/dx.doi.org\/10.1016\/j.dam.2013.09.024\">DOI<\/a> | <a href=\"https:\/\/inria.hal.science\/hal-00653714\">HAL<\/a>]<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Conference papers<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>The Canadian Traveller Problem on outerplanar graphs<\/strong>.&nbsp;With L. Beaudou, P. Berg\u00e9, V. Chernyshev, A. Dailly, Y. Gerard, V. Limouzy and L. Pastor.&nbsp;<em>In proceedings of MFCS&rsquo;24<\/em>, volume 306, 19:1-19:16 [<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2024.19\">DOI<\/a> | <a href=\"https:\/\/arxiv.org\/abs\/2403.01872\">ArXiV<\/a>]<\/li>\n\n\n\n<li><strong>Local certification of geometric graph classes<\/strong>.&nbsp;With O. Defrain, L. Esperet, P. Morin, JF. Raymond.&nbsp;<em> In proceedings of MFCS&rsquo;24<\/em>, volume 306, 48:1-48-14 [<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2024.48\">DOI<\/a> | <a href=\"https:\/\/arxiv.org\/abs\/2311.16953\">ArXiV<\/a>]<\/li>\n\n\n\n<li><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/article_EACL.pdf\" data-type=\"attachment\" data-id=\"75\"><strong>Composing extended top-down tree transducers<\/strong>.<\/a> With Fabienne Braune, Daniel Quernheim, Andreas Maletti.&nbsp;<em>In EACL 2012:808-817<\/em>&nbsp;[<a href=\"https:\/\/aclanthology.org\/E12-1082\/\">URL<\/a>]<\/li>\n\n\n\n<li><strong><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/hamilton_spie.pdf\" data-type=\"attachment\" data-id=\"104\">Alternative method for Hamilton-Jacobi PDEs in image processing<\/a><\/strong>. With&nbsp;Hadrien Salat, Corinne Vachier. In&nbsp;Proc. SPIE 7870, Image Processing: Algorithms and Systems IX, 787010, 2011. [<a href=\"http:\/\/dx.doi.org\/10.1117\/12.872591\">DOI<\/a>]<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Book chapter<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/survey-topdown-lagmal11.pdf\" data-type=\"attachment\" data-id=\"74\">Survey: Weighted Extended Top-Down Tree Transducers Part III &#8211; Composition<\/a><\/strong>. With Andreas Maletti. I<em>n Algebraic Foundations in Computer Science,<\/em>&nbsp;272-308, 2011 (invited lecture). [<a href=\"http:\/\/dx.doi.org\/10.1007\/978-3-642-24897-9_13\">DOI<\/a>]<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Unpublished<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters<\/strong>, with S\u00e9bastien Tavenas.&nbsp;[<a href=\"http:\/\/arxiv.org\/abs\/1309.0422\">ArXiv<\/a>]<\/li>\n\n\n\n<li><strong>Master 2 Internship<\/strong>&nbsp;with St\u00e9phan Thomass\u00e9 (Team MC2, LIP , ENS Lyon): Quasi-P versus P (view through the Alon-Saks-Seymour conjecture, and the Clique versus Stable Set problem). My&nbsp;<a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/report_M2.pdf\" data-type=\"attachment\" data-id=\"77\">report<\/a>&nbsp;and my&nbsp;<a href=\"https:\/\/cloud.univ-grenoble-alpes.fr\/s\/EH7SxAdwDAGneWa\">slides<\/a>.<\/li>\n\n\n\n<li><strong>Master 1 Internship<\/strong>&nbsp;with Andreas Maletti (IMS, Universit\u00e4t Stuttgart): Composition of extended top-down tree transducers. My&nbsp;<a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/report_M1.pdf\" data-type=\"attachment\" data-id=\"76\">report<\/a>&nbsp;and my&nbsp;<a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/slides_M1.pdf\" data-type=\"attachment\" data-id=\"78\">slides<\/a>.<\/li>\n\n\n\n<li><strong>Licence 3 Internship<\/strong>&nbsp;with Eric Thierry (Team MC2, LIP , ENS Lyon): Jeux d&rsquo;inondations dans les graphes. My&nbsp;<a href=\"http:\/\/hal.archives-ouvertes.fr\/docs\/00\/50\/94\/88\/PDF\/aurelie-hal-2010-08-12.pdf\">report<\/a>&nbsp;(in french) and my&nbsp;<a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/soutenance_L3.pdf\" data-type=\"attachment\" data-id=\"79\">slides<\/a>&nbsp;(in french).&nbsp;<a href=\"http:\/\/arxiv.org\/abs\/1008.3091\">Partial translation<\/a>&nbsp;of my report (in english) on arXiv.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Some talks:<\/h2>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table><thead><tr><th>Date<\/th><th>Place &amp; Title<\/th><th>Slides<\/th><\/tr><\/thead><tbody><tr><td>2026 &#8211; Mar 19<\/td><td>Journ\u00e9e JCJC des <strong>20 ans du GDR-IFM<\/strong>, Paris<\/td><td><a href=\"https:\/\/cloud.univ-grenoble-alpes.fr\/s\/XaBDzZFMPoZN3rg\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Balade dans les graphes : quand l&rsquo;information nous manque<\/td><td><\/td><\/tr><tr><td>2026 &#8211; Jan 22<\/td><td>G@G Project, Grenoble<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2026\/01\/enumerationChordal.pdf\" data-type=\"attachment\" data-id=\"164\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Enumeration methods in graphs (and focus on chordal graphs)<\/td><td><\/td><\/tr><tr><td>2025 &#8211; Feb 13<\/td><td>OC Seminar, G-SCOP, Grenoble<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2025\/02\/CanadianTraveler.pdf\" data-type=\"attachment\" data-id=\"159\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Online algorithm for the Canadian Traveler Problem on outerplanar graphs<\/td><td><\/td><\/tr><tr><td>2024 &#8211; July 22<\/td><td><strong>Conference ISMP&rsquo;24,<\/strong> stream Combinatorial Optimisation and Graph Theory, <strong>Montr\u00e9al<\/strong>, Canada<\/td><td><a href=\"http:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2024\/10\/LocalCertifLagoutte_ISMP.pdf\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Local certification of geometric graph classes<\/td><td><\/td><\/tr><tr><td>2024 &#8211; June 17<\/td><td>ACRO Seminar, <strong>LIS<\/strong>, Marseille<\/td><td><a href=\"http:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2024\/07\/CanadianTraveler.pdf\" data-type=\"link\" data-id=\"http:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2024\/07\/CanadianTraveler.pdf\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Online algorithm for the Canadian Traveler Problem on outerplanar graphs<\/td><td><\/td><\/tr><tr><td>2023 &#8211; June 2<\/td><td><strong>Journ\u00e9es du laboratoire G-SCOP<\/strong>, Loriol-sur-Dr\u00f4me<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2024\/07\/slides_journeesGSCOP_Lagoutte.pdf\" data-type=\"attachment\" data-id=\"142\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Enumeration et reconfiguration combinatoire dans les graphes<\/td><td><\/td><\/tr><tr><td>2023 &#8211; Apr 5<\/td><td>GT Graphes selected speaker, <strong>Journ\u00e9es Nationales du GDR-IM<\/strong>, Paris<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/enumeration-JNIM.pdf\" data-type=\"attachment\" data-id=\"81\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Enumeration algorithms in graphs<\/td><td><\/td><\/tr><tr><td>2021 &#8211; Nov 17<\/td><td><strong>Invited speaker<\/strong>&nbsp;at&nbsp;<em>Journ\u00e9es Graphes et Algorithmes &rsquo;21<\/em>, online<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/slides_jga2021_Lagoutte.pdf\" data-type=\"attachment\" data-id=\"82\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Algorithmes d&rsquo;\u00e9num\u00e9ration de r\u00e9parations de graphes<\/td><td><\/td><\/tr><tr><td>2018 &#8211; Nov 9<\/td><td>30th <strong>anniversary of the LIP<\/strong>, ENS Lyon<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/30ansLIP_Lagoutte.pdf\" data-type=\"attachment\" data-id=\"83\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Graphes : structure et algorithmes<\/td><td><\/td><\/tr><tr><td>2018 &#8211; June 4<\/td><td><strong>Mini-symposium<\/strong> <strong>on Graph Coloring<\/strong><br>SIAM conference on Discrete Maths &#8211; Denver, USA<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/slides2K2Siam.pdf\" data-type=\"attachment\" data-id=\"84\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Coloring (2K2, W4)-free graphs<\/td><td><\/td><\/tr><tr><td>2017 &#8211; Oct 3<\/td><td>Reading group \u00ab\u00a0Distributed Algorithms and Structures\u00a0\u00bb, <strong>JCRAA<\/strong> &#8211; G-SCOP, Grenoble<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/JCRAA17_LowerBounds.pdf\" data-type=\"attachment\" data-id=\"85\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Lower bounds, <em>based on G\u00f6\u00f6s, Hirvonen and Suomela work<\/em><\/td><td><\/td><\/tr><tr><td>2016&nbsp;&#8211; Nov 17<\/td><td><strong>JGA<\/strong>&nbsp;(Journ\u00e9es Graphes et Algorithmes) &#8211;&nbsp;LAMSADE, Paris<br><em>Charles Delorme Prize<\/em><\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/ColoringPerfectBounded.pdf\" data-type=\"attachment\" data-id=\"86\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Coloring perfect graphs with bounded clique number<\/td><td><\/td><\/tr><tr><td>2015 &#8211; Oct 15<\/td><td>Discrete Mathematics Seminar,&nbsp;<strong>Princeton University<\/strong><\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/slidesPrinceton.pdf\" data-type=\"attachment\" data-id=\"87\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Clique-Stable set Separation<\/td><td><\/td><\/tr><tr><td>2015 &#8211; July 3<\/td><td>GOAL Seminar, LIRIS,&nbsp;<strong>University Lyon 1<\/strong><\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/Yes-C4_Lyon1.pdf\" data-type=\"attachment\" data-id=\"88\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Coloring graphs with no even holes of length at least 6: the triangle-free case<\/td><td><\/td><\/tr><tr><td>2014 &#8211; Dec 4<\/td><td>G-SCOP Seminar,&nbsp;<strong>University of Grenoble<\/strong><\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/SeminaireGSCOP_Lagoutte.pdf\" data-type=\"attachment\" data-id=\"89\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa From extended formulations of polytopes to the Clique-Stablet Set separation<\/td><td><\/td><\/tr><tr><td>2014 &#8211; Nov 19<\/td><td>Conference&nbsp;<strong>BGW&rsquo;2014<\/strong>, Bordeaux<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/BGW_Lagoutte.pdf\" data-type=\"attachment\" data-id=\"90\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Identifying codes and VC-dimension<\/td><td><\/td><\/tr><tr><td>2014 &#8211; Nov 14<\/td><td><strong>2nd Lyon-Sao Paulo Research Workshop<\/strong>, Sao Paulo, Brazil<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/Slides_Sao-Paulo_Lagoutte.pdf\" data-type=\"attachment\" data-id=\"91\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Extended formulations of polytopes and Communication Complexity<\/td><td><\/td><\/tr><tr><td>2013 &#8211; Dec 19<\/td><td><strong>Bertinoro Workshop on Algorithms and Graphs<\/strong>, Bertinoro, Italy<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/Bertinoro_Lagoutte.pdf\" data-type=\"attachment\" data-id=\"92\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Clique Stable Set separation in perfect graphs with no balanced skew partition<\/td><td><\/td><\/tr><tr><td>2013 &#8211; Nov 14<\/td><td><strong>JGA<\/strong>&nbsp;(Journ\u00e9es Graphes et Algorithmes) &#8211;&nbsp;LRI,&nbsp;Orsay<\/td><td><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-content\/uploads\/sites\/20\/2023\/05\/slidesJGA.pdf\" data-type=\"attachment\" data-id=\"93\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Clique Stable Set separation in perfect graphs with no balanced skew-partition<\/td><td><\/td><\/tr><tr><td>2013 &#8211; April 8<\/td><td><strong>EJC<\/strong>&nbsp;(Ecole Jeunes Chercheurs) &#8211; University of&nbsp;Perpignan<\/td><td><a href=\"https:\/\/cloud.univ-grenoble-alpes.fr\/s\/sD5fy7ik6oim2EN\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa 10 minutes to understand the Clique-Stable set Separation<\/td><td><\/td><\/tr><tr><td>2012 &#8211; Nov 15<\/td><td><strong>JGA<\/strong>&nbsp;(Journ\u00e9es Graphes et Algorithmes) &#8211;&nbsp;LIMOS,&nbsp;Clermont-Ferrand<\/td><td><a href=\"https:\/\/cloud.univ-grenoble-alpes.fr\/s\/s37o7RKJNc2g7PP\">here<\/a><\/td><\/tr><tr><td><\/td><td>\u21aa Quasi P versus P: The Polynomial Alon-Saks- Seymour conjecture and related problems<\/td><td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Publications Upcoming work Journal papers Conference papers Book chapter Unpublished Some talks: Date Place &amp; Title Slides 2026 &#8211; Mar 19 Journ\u00e9e JCJC des 20 ans du GDR-IFM, Paris here \u21aa Balade dans les graphes : quand l&rsquo;information nous manque 2026 &#8211; Jan 22 G@G Project, Grenoble here \u21aa Enumeration methods in graphs (and focus &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/research\/\" class=\"more-link\">Continuer la lecture<span class=\"screen-reader-text\"> de &laquo;&nbsp;Research&nbsp;&raquo;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-18","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-json\/wp\/v2\/pages\/18","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-json\/wp\/v2\/comments?post=18"}],"version-history":[{"count":29,"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-json\/wp\/v2\/pages\/18\/revisions"}],"predecessor-version":[{"id":169,"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-json\/wp\/v2\/pages\/18\/revisions\/169"}],"wp:attachment":[{"href":"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/aurelielagoutte\/wp-json\/wp\/v2\/media?parent=18"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}