<?xml version="1.0" encoding="UTF-8"?>
<cv_prof id="12758910"><usualname>Grappe</usualname><datefirstappointment>2023-09-01 00:00:00.0</datefirstappointment><lastname>GRAPPE</lastname><firstname>ROLAND</firstname><email>roland.grappe@lamsade.dauphine.fr</email><URLperso>https://www.lamsade.dauphine.fr/~rgrappe/index.html</URLperso><bio_fr>&lt;p&gt;Depuis Septembre 2023, je suis Professeur des Universit&amp;eacute;s au LAMSADE &amp;agrave; Paris Dauphine-PSL. De 2011 &amp;agrave; 2023, j&amp;#39;&amp;eacute;tais Ma&amp;icirc;tre de conf&amp;eacute;rences en Informatique au sein de l&amp;#39;&amp;eacute;quipe AOC du LIPN, &amp;agrave; l&amp;#39;Universit&amp;eacute; Paris 13. Je travaille principalement sur des probl&amp;egrave;mes d&amp;#39;optimisation combinatoire m&amp;ecirc;lant graphes et poly&amp;egrave;dres, avec un int&amp;eacute;r&amp;ecirc;t particulier pour les aspects g&amp;eacute;om&amp;eacute;triques et matriciels sous-jacents.&amp;nbsp;J&amp;#39;ai commenc&amp;eacute; &amp;agrave; m&amp;#39;investir dans les aspects poly&amp;eacute;draux de l&amp;#39;optimisation combinatoire lors de mon post-doctorat &amp;agrave; l&amp;#39;Universit&amp;eacute; de Padoue, invit&amp;eacute; par Michele Conforti. J&amp;#39;avais auparavant soutenu ma th&amp;egrave;se en th&amp;eacute;orie des graphes, &amp;agrave; Grenoble, sous la direction de Zolt&amp;aacute;n Szigeti.&lt;/p&gt;
</bio_fr><bio_en>&lt;p&gt;Since September 2023, I am Professor at LAMSADE at Paris Dauphine-PSL. From 2011 to 2023, I was an Associate Professor in Computer Science at the AOC team of LIPN, Paris 13 University. My research focuses on combinatorial optimization problems involving graphs and polyhedra, with a particular interest in underlying geometrical and matricial aspects. I started exploring polyhedral aspects of combinatorial optimization during my post-doc at the University of Padua, under Michele Conforti&amp;#39;s supervision. Previously, I completed my thesis in graph theory in Grenoble, under the guidance of Zolt&amp;aacute;n Szigeti.&lt;/p&gt;
</bio_en><nationality code="FR"><lib_fr>FRANCE</lib_fr><lib_en>FRANCE</lib_en></nationality><titrefac code="3001"><lib_fr>Professeur des universités (2C)</lib_fr><lib_en>Full Professor (2C)</lib_en><libc_fr>Professeur des universités</libc_fr><libc_en>Full Professor</libc_en></titrefac><languages><language code="FR"><lib_fr>Français</lib_fr><lib_en>French</lib_en><teach>1</teach></language><language code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en><teach>1</teach></language><language code="IT"><lib_fr>Italien</lib_fr><lib_en>Italian</lib_en><teach>1</teach></language></languages><pedagogicExperiences/><degrees><diplomas><diploma id="15187580"><year>2021</year><lib_fr>HABIL. DIR. RECH, Informatique</lib_fr><lib_en>HABIL. DIR. RECH, Computer sciences</lib_en><institution code="3578464"><lib_fr>Université de Paris-Nord</lib_fr><lib_en>University of Paris-Nord</lib_en></institution><country code="FR"><lib_fr>FRANCE</lib_fr><lib_en>FRANCE</lib_en></country><degree code="S_HDR"><lib_fr>HABIL. DIR. RECH</lib_fr><lib_en>HABIL. DIR. RECH</lib_en></degree><domain code="INF"><lib_fr>Informatique</lib_fr><lib_en>Computer sciences</lib_en></domain></diploma><diploma id="15187582"><year>2009</year><lib_fr>DOCTORAT, Informatique</lib_fr><lib_en>DOCTORAT, Computer sciences</lib_en><institution code="4722704"><lib_fr>Institut National Polytechnique de Grenoble</lib_fr><lib_en>Institut National Polytechnique de Grenoble</lib_en><city>Grenoble</city><country code="FR"><lib_fr>FRANCE</lib_fr><lib_en>FRANCE</lib_en></country></institution><country code="FR"><lib_fr>FRANCE</lib_fr><lib_en>FRANCE</lib_en></country><degree code="F_DOCT"><lib_fr>DOCTORAT</lib_fr><lib_en>DOCTORAT</lib_en></degree><domain code="INF"><lib_fr>Informatique</lib_fr><lib_en>Computer sciences</lib_en></domain></diploma><diploma id="15187584"><year>2006</year><lib_fr>ENS Cachan, Mathématiques et interactions des mathématiques</lib_fr><lib_en>ENS Cachan, Mathématiques et interactions des mathématiques</lib_en><institution code="3582679"><lib_fr>ENS Cachan</lib_fr><lib_en>ENS Cachan</lib_en></institution><country code="FR"><lib_fr>FRANCE</lib_fr><lib_en>FRANCE</lib_en></country><degree code="5_ENS Cach"><lib_fr>ENS Cachan</lib_fr><lib_en>ENS Cachan</lib_en></degree><domain code="41"><lib_fr>Mathématiques et interactions des mathématiques</lib_fr><lib_en>Mathématiques et interactions des mathématiques</lib_en></domain></diploma><diploma id="15187586"><year>2005</year><lib_fr>AGREG, Mathématiques et interactions des mathématiques</lib_fr><lib_en>AGREG, Mathématiques et interactions des mathématiques</lib_en><institution code="3582679"><lib_fr>ENS Cachan</lib_fr><lib_en>ENS Cachan</lib_en></institution><country code="FR"><lib_fr>FRANCE</lib_fr><lib_en>FRANCE</lib_en></country><degree code="4_AGREG"><lib_fr>AGREG</lib_fr><lib_en>AGREG</lib_en></degree><domain code="41"><lib_fr>Mathématiques et interactions des mathématiques</lib_fr><lib_en>Mathématiques et interactions des mathématiques</lib_en></domain></diploma></diplomas><certificates/></degrees><grants/><otherActivities/><teachingDomains/><researchDomains/><industrialDomains/><geographicAreas/><tutorings/><thesis/><typeContribs><typeContrib code="01" lib_fr="Article" lib_en="Journal article"><contribs><contrib id="1781687"><title>Trader multiflow and box-TDI systems in series-parallel graphs.</title><preview1>Cornaz, D., R. GRAPPE, M. Lacroix, "Trader multiflow and box-TDI systems in series-parallel graphs.", &lt;i&gt;Discrete Optimization&lt;/i&gt;, 2019, vol. 31, no. 1, pp. 103-114</preview1><preview2>Cornaz, D., R. GRAPPE, M. Lacroix, "Trader multiflow and box-TDI systems in series-parallel graphs.", &lt;i&gt;Discrete Optimization&lt;/i&gt;, 2019, vol. 31, no. 1, pp. 103-114</preview2><date1>2019-01-01 00:00:00.0</date1><date2>2019-12-31 00:00:00.0</date2><year>2019</year><support code="5565791"><name>Discrete Optimization</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><level code="I"><lib_fr>International</lib_fr><lib_en>International</lib_en></level><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293440"><title>Self-sufficient sets in smartgrids</title><preview1>David, J., R. GRAPPE, M. Lacroix, E. Traversi, "Self-sufficient sets in smartgrids", &lt;i&gt;Electronic Notes in Discrete Mathematics&lt;/i&gt;, 2018, vol. 69, pp. 301-308</preview1><preview2>David, J., R. GRAPPE, M. Lacroix, E. Traversi, "Self-sufficient sets in smartgrids", &lt;i&gt;Electronic Notes in Discrete Mathematics&lt;/i&gt;, 2018, vol. 69, pp. 301-308</preview2><date1>2018-08-01 00:00:00.0</date1><date2>2018-12-31 00:00:00.0</date2><year>2018</year><support code="5565795"><name>Electronic Notes in Discrete Mathematics</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293447"><title>The st-bond polytope on series-parallel graphs</title><preview1>GRAPPE, R., M. Lacroix, "The st-bond polytope on series-parallel graphs", &lt;i&gt;RAIRO - Operations Research&lt;/i&gt;, 2018, vol. 52, no. 3, pp. 923-934</preview1><preview2>GRAPPE, R., M. Lacroix, "The st-bond polytope on series-parallel graphs", &lt;i&gt;RAIRO - Operations Research&lt;/i&gt;, 2018, vol. 52, no. 3, pp. 923-934</preview2><date1>2018-07-01 00:00:00.0</date1><date2>2018-12-31 00:00:00.0</date2><year>2018</year><support code="5565930"><name>RAIRO - Operations Research</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293461"><title>Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks</title><preview1>Barbato, M., R. GRAPPE, M. Lacroix, R. Wolfler Calvo, "Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks", &lt;i&gt;Discrete Optimization&lt;/i&gt;, 2016, vol. 21, pp. 25-41</preview1><preview2>Barbato, M., R. GRAPPE, M. Lacroix, R. Wolfler Calvo, "Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks", &lt;i&gt;Discrete Optimization&lt;/i&gt;, 2016, vol. 21, pp. 25-41</preview2><date1>2016-08-01 00:00:00.0</date1><date2>2016-12-31 00:00:00.0</date2><year>2016</year><support code="5565791"><name>Discrete Optimization</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293471"><title>Extended formulations, nonnegative factorizations, and randomized communication protocols</title><preview1>Faenza, Y., S. Fiorini, R. GRAPPE, H.  R. Tiwary, "Extended formulations, nonnegative factorizations, and randomized communication protocols", &lt;i&gt;Mathematical Programming&lt;/i&gt;, 2015, vol. 153, no. 1, pp. 75-94</preview1><preview2>Faenza, Y., S. Fiorini, R. GRAPPE, H.  R. Tiwary, "Extended formulations, nonnegative factorizations, and randomized communication protocols", &lt;i&gt;Mathematical Programming&lt;/i&gt;, 2015, vol. 153, no. 1, pp. 75-94</preview2><date1>2015-10-01 00:00:00.0</date1><date2>2015-12-31 00:00:00.0</date2><year>2015</year><support code="5565903"><name>Mathematical Programming</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293478"><title>Circuit and bond polytopes on series–parallel graphs</title><preview1>Borne, S., P. Fouilhoux, R. GRAPPE, M. Lacroix, P. Pesneau, "Circuit and bond polytopes on series–parallel graphs", &lt;i&gt;Discrete Optimization&lt;/i&gt;, 2015, vol. 17, pp. 55-68</preview1><preview2>Borne, S., P. Fouilhoux, R. GRAPPE, M. Lacroix, P. Pesneau, "Circuit and bond polytopes on series–parallel graphs", &lt;i&gt;Discrete Optimization&lt;/i&gt;, 2015, vol. 17, pp. 55-68</preview2><date1>2015-08-01 00:00:00.0</date1><date2>2015-12-31 00:00:00.0</date2><year>2015</year><support code="5565791"><name>Discrete Optimization</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293488"><title>Reverse Chvátal--Gomory Rank</title><preview1>Conforti, M., A. Del Pia, M. Di Summa, Y. Faenza, R. GRAPPE, "Reverse Chvátal--Gomory Rank", &lt;i&gt;SIAM Journal on Discrete Mathematics&lt;/i&gt;, 2015, vol. 29, no. 1, pp. 166-181</preview1><preview2>Conforti, M., A. Del Pia, M. Di Summa, Y. Faenza, R. GRAPPE, "Reverse Chvátal--Gomory Rank", &lt;i&gt;SIAM Journal on Discrete Mathematics&lt;/i&gt;, 2015, vol. 29, no. 1, pp. 166-181</preview2><date1>2015-01-01 00:00:00.0</date1><date2>2015-12-31 00:00:00.0</date2><year>2015</year><support code="5565944"><name>SIAM Journal on Discrete Mathematics</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293496"><title>Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph</title><preview1>Bernáth, A., R. GRAPPE, Z. Szigeti, "Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph", &lt;i&gt;Journal of Graph Theory&lt;/i&gt;, 2013, vol. 72, no. 3, pp. 291-312</preview1><preview2>Bernáth, A., R. GRAPPE, Z. Szigeti, "Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph", &lt;i&gt;Journal of Graph Theory&lt;/i&gt;, 2013, vol. 72, no. 3, pp. 291-312</preview2><date1>2013-03-01 00:00:00.0</date1><date2>2013-12-31 00:00:00.0</date2><year>2013</year><support code="6057321"><name>Journal of Graph Theory</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293379"><title>Hard problems on box-totally dual integral polyhedra</title><preview1>Chervet, P., R. GRAPPE, M. Lacroix, F. Pisanu, R. Wolfler Calvo, "Hard problems on box-totally dual integral polyhedra", &lt;i&gt;Discrete Optimization&lt;/i&gt;, 2023, vol. 50, pp. 100810</preview1><preview2>Chervet, P., R. GRAPPE, M. Lacroix, F. Pisanu, R. Wolfler Calvo, "Hard problems on box-totally dual integral polyhedra", &lt;i&gt;Discrete Optimization&lt;/i&gt;, 2023, vol. 50, pp. 100810</preview2><date1>2023-11-01 00:00:00.0</date1><date2>2023-12-31 00:00:00.0</date2><year>2023</year><support code="5565791"><name>Discrete Optimization</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293390"><title>Box-total dual integrality and edge-connectivity</title><preview1>Barbato, M., R. GRAPPE, M. Lacroix, E. Lancini, "Box-total dual integrality and edge-connectivity", &lt;i&gt;Mathematical Programming&lt;/i&gt;, 2023, vol. 197, no. 1, pp. 307-336</preview1><preview2>Barbato, M., R. GRAPPE, M. Lacroix, E. Lancini, "Box-total dual integrality and edge-connectivity", &lt;i&gt;Mathematical Programming&lt;/i&gt;, 2023, vol. 197, no. 1, pp. 307-336</preview2><date1>2023-01-01 00:00:00.0</date1><date2>2023-12-31 00:00:00.0</date2><year>2023</year><support code="5565903"><name>Mathematical Programming</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293455"><title>Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph</title><preview1>Bernáth, A., R. GRAPPE, Z. Szigeti, "Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph", &lt;i&gt;SIAM Journal on Discrete Mathematics&lt;/i&gt;, 2017, vol. 31, no. 1, pp. 335-382</preview1><preview2>Bernáth, A., R. GRAPPE, Z. Szigeti, "Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph", &lt;i&gt;SIAM Journal on Discrete Mathematics&lt;/i&gt;, 2017, vol. 31, no. 1, pp. 335-382</preview2><date1>2017-01-01 00:00:00.0</date1><date2>2017-12-31 00:00:00.0</date2><year>2017</year><support code="5565944"><name>SIAM Journal on Discrete Mathematics</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293521"><title>Drawing Disconnected Graphs on the Klein Bottle</title><preview1>Beaudou, L., A. Gerbaud, R. GRAPPE, F. Palesi, "Drawing Disconnected Graphs on the Klein Bottle", &lt;i&gt;Graphs and Combinatorics&lt;/i&gt;, 2010, vol. 26, no. 4, pp. 471-481</preview1><preview2>Beaudou, L., A. Gerbaud, R. GRAPPE, F. Palesi, "Drawing Disconnected Graphs on the Klein Bottle", &lt;i&gt;Graphs and Combinatorics&lt;/i&gt;, 2010, vol. 26, no. 4, pp. 471-481</preview2><date1>2010-07-01 00:00:00.0</date1><date2>2010-12-31 00:00:00.0</date2><year>2010</year><support code="5565810"><name>Graphs and Combinatorics</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293402"><title>The Schrijver system of the flow cone in series–parallel graphs</title><preview1>Barbato, M., R. GRAPPE, M. Lacroix, E. Lancini, R. Wolfler Calvo, "The Schrijver system of the flow cone in series–parallel graphs", &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, 2022, vol. 308, pp. 162-167</preview1><preview2>Barbato, M., R. GRAPPE, M. Lacroix, E. Lancini, R. Wolfler Calvo, "The Schrijver system of the flow cone in series–parallel graphs", &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, 2022, vol. 308, pp. 162-167</preview2><date1>2022-02-01 00:00:00.0</date1><date2>2022-12-31 00:00:00.0</date2><year>2022</year><support code="5565788"><name>Discrete Applied Mathematics</name></support><langue code="FR"><lib_fr>Français</lib_fr><lib_en>French</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293412"><title>Box-total dual integrality, box-integrality, and equimodular matrices</title><preview1>Chervet, P., R. GRAPPE, L.-H. Robert, "Box-total dual integrality, box-integrality, and equimodular matrices", &lt;i&gt;Mathematical Programming&lt;/i&gt;, 2021, vol. 188, no. 1, pp. 319-349</preview1><preview2>Chervet, P., R. GRAPPE, L.-H. Robert, "Box-total dual integrality, box-integrality, and equimodular matrices", &lt;i&gt;Mathematical Programming&lt;/i&gt;, 2021, vol. 188, no. 1, pp. 319-349</preview2><date1>2021-07-01 00:00:00.0</date1><date2>2021-12-31 00:00:00.0</date2><year>2021</year><support code="5565903"><name>Mathematical Programming</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293432"><title>Lexicographical polytopes</title><preview1>Barbato, M., R. GRAPPE, M. Lacroix, C. Pira, "Lexicographical polytopes", &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, 2018, vol. 240, pp. 3-7</preview1><preview2>Barbato, M., R. GRAPPE, M. Lacroix, C. Pira, "Lexicographical polytopes", &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, 2018, vol. 240, pp. 3-7</preview2><date1>2018-05-01 00:00:00.0</date1><date2>2018-12-31 00:00:00.0</date2><year>2018</year><support code="5565788"><name>Discrete Applied Mathematics</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293541"><title>Covering symmetric semi-monotone functions</title><preview1>GRAPPE, R., Z. Szigeti, "Covering symmetric semi-monotone functions", &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, 2008, vol. 156, no. 1, pp. 138-144</preview1><preview2>GRAPPE, R., Z. Szigeti, "Covering symmetric semi-monotone functions", &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, 2008, vol. 156, no. 1, pp. 138-144</preview2><date1>2008-01-01 00:00:00.0</date1><date2>2008-12-31 00:00:00.0</date2><year>2008</year><support code="5565788"><name>Discrete Applied Mathematics</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="17623923"><title>A weak box-perfect graph theorem</title><preview1>Chervet, P., R. Grappe, "A weak box-perfect graph theorem", &lt;i&gt;Journal of Combinatorial Theory. Series B&lt;/i&gt;, 2024, vol. 169, pp. 367-372</preview1><preview2>Chervet, P., R. Grappe, "A weak box-perfect graph theorem", &lt;i&gt;Journal of Combinatorial Theory. Series B&lt;/i&gt;, 2024, vol. 169, pp. 367-372</preview2><date1>2024-01-01 00:00:00.0</date1><date2>2024-12-31 00:00:00.0</date2><year>2024</year><support code="5565866"><name>Journal of Combinatorial Theory. Series B</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib></contribs></typeContrib><typeContrib code="03" lib_fr="Chapitre" lib_en="Book chapter"><contribs/></typeContrib><typeContrib code="04" lib_fr="Communication dans une conférence avec actes" lib_en="Proceedings from scientific conference"><contribs><contrib id="15293397"><title>The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms</title><preview1>GRAPPE, R., M. Lacroix, S. Martin, "The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms" dans &lt;i&gt;9th-2023 International Conference on Control, Decision and Information Technologies (CoDIT 2023)&lt;/i&gt;, &lt;i&gt;IEEE - Institute of Electrical and Electronics Engineers&lt;/i&gt;, pp. 956-961, 2023</preview1><preview2>GRAPPE, R., M. Lacroix, S. Martin, "The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms" in &lt;i&gt;9th-2023 International Conference on Control, Decision and Information Technologies (CoDIT 2023)&lt;/i&gt;, &lt;i&gt;IEEE - Institute of Electrical and Electronics Engineers&lt;/i&gt;, pp. 956-961, 2023</preview2><date1>2023-01-01 00:00:00.0</date1><date2>2023-12-31 00:00:00.0</date2><year>2023</year><support code="5563213"><name>IEEE - Institute of Electrical and Electronics Engineers</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><level code="I"><lib_fr>International</lib_fr><lib_en>International</lib_en></level><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293503"><title>Reverse Chvátal-Gomory Rank</title><preview1>Conforti, M., A. Del Pia, M. Di Summa, Y. Faenza, R. GRAPPE, "Reverse Chvátal-Gomory Rank" dans &lt;i&gt;IPCO 2013&lt;/i&gt;, &lt;i&gt;Springer Berlin Heidelberg&lt;/i&gt;, pp. 133-144, 2013</preview1><preview2>Conforti, M., A. Del Pia, M. Di Summa, Y. Faenza, R. GRAPPE, "Reverse Chvátal-Gomory Rank" in &lt;i&gt;IPCO 2013&lt;/i&gt;, &lt;i&gt;Springer Berlin Heidelberg&lt;/i&gt;, pp. 133-144, 2013</preview2><date1>2013-01-01 00:00:00.0</date1><date2>2013-12-31 00:00:00.0</date2><year>2013</year><support code="6598747"><name>Springer International Publishing</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293528"><title>Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph</title><preview1>GRAPPE, R., A. Bernáth, Z. Szigeti, "Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph", &lt;i&gt;Electronic Notes in Discrete Mathematics&lt;/i&gt;, vol. 34, pp. 173-177, 2009</preview1><preview2>GRAPPE, R., A. Bernáth, Z. Szigeti, "Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph", &lt;i&gt;Electronic Notes in Discrete Mathematics&lt;/i&gt;, vol. 34, pp. 173-177, 2009</preview2><date1>2009-08-01 00:00:00.0</date1><date2>2009-12-31 00:00:00.0</date2><year>2009</year><support code="5565795"><name>Electronic Notes in Discrete Mathematics</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293418"><title>On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs</title><preview1>Barbato, M., R. GRAPPE, M. Lacroix, E. Lancini, "On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs" dans &lt;i&gt;Combinatorial Optimization: 6th International Symposium, ISCO 2020&lt;/i&gt;, &lt;i&gt;Springer International Publishing&lt;/i&gt;, pp. 27-41, 2020</preview1><preview2>Barbato, M., R. GRAPPE, M. Lacroix, E. Lancini, "On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs" in &lt;i&gt;Combinatorial Optimization: 6th International Symposium, ISCO 2020&lt;/i&gt;, &lt;i&gt;Springer International Publishing&lt;/i&gt;, pp. 27-41, 2020</preview2><date1>2020-01-01 00:00:00.0</date1><date2>2020-12-31 00:00:00.0</date2><year>2020</year><support code="6598747"><name>Springer International Publishing</name></support><langue code="EN"><lib_fr>Anglais</lib_fr><lib_en>English</lib_en></langue><level code="I"><lib_fr>International</lib_fr><lib_en>International</lib_en></level><wfcontrib code="03"><lib_fr>Validé</lib_fr><lib_en>Validated</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293512"><title>The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks</title><preview1>Borne, S., R. GRAPPE, M. Lacroix, "The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks" dans &lt;i&gt;ISCO 2012&lt;/i&gt;, &lt;i&gt;Springer Berlin Heidelberg&lt;/i&gt;, pp. 105-116, 2012</preview1><preview2>Borne, S., R. GRAPPE, M. Lacroix, "The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks" in &lt;i&gt;ISCO 2012&lt;/i&gt;, &lt;i&gt;Springer Berlin Heidelberg&lt;/i&gt;, pp. 105-116, 2012</preview2><date1>2012-01-01 00:00:00.0</date1><date2>2012-12-31 00:00:00.0</date2><year>2012</year><support code="6598747"><name>Springer International Publishing</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib><contrib id="15293534"><title>Partition constrained covering of a symmetric crossing supermodular function by a graph</title><preview1>Bernáth, A., R. GRAPPE, Z. Szigeti, "Partition constrained covering of a symmetric crossing supermodular function by a graph" dans &lt;i&gt;SODA 2010&lt;/i&gt;, &lt;i&gt;Society for Industrial and Applied Mathematics&lt;/i&gt;, pp. 1512-1520, 2010</preview1><preview2>Bernáth, A., R. GRAPPE, Z. Szigeti, "Partition constrained covering of a symmetric crossing supermodular function by a graph" in &lt;i&gt;SODA 2010&lt;/i&gt;, &lt;i&gt;Society for Industrial and Applied Mathematics&lt;/i&gt;, pp. 1512-1520, 2010</preview2><date1>2010-01-01 00:00:00.0</date1><date2>2010-12-31 00:00:00.0</date2><year>2010</year><support code="6945792"><name>Society for Industrial and Applied Mathematics</name></support><wfcontrib code="01"><lib_fr>Brouillon</lib_fr><lib_en>Draft</lib_en></wfcontrib><statpub code="P"><lib_fr>Publié</lib_fr><lib_en>Published</lib_en></statpub></contrib></contribs></typeContrib><typeContrib code="05" lib_fr="Communication dans une conférence sans actes" lib_en="Participation at an Academical or Professional meeting"><contribs/></typeContrib><typeContrib code="06" lib_fr="Présentation dans un séminaire de recherche" lib_en="Faculty research seminar"><contribs/></typeContrib><typeContrib code="07" lib_fr="Direction d'ouvrage" lib_en="Book editor"><contribs/></typeContrib><typeContrib code="08" lib_fr="Direction de revue / éditorial" lib_en="Journal editor / editorial"><contribs/></typeContrib><typeContrib code="11" lib_fr="Compte-rendu d'ouvrage" lib_en="Book review"><contribs/></typeContrib><typeContrib code="13" lib_fr="Rapport " lib_en="Report "><contribs/></typeContrib><typeContrib code="14" lib_fr="Cahier de recherche / Document de travail" lib_en="Working Papers"><contribs/></typeContrib><typeContrib code="15" lib_fr="Invité dans une conférence académique" lib_en="Invited speaker"><contribs/></typeContrib><typeContrib code="16" lib_fr="Ouvrage" lib_en="Book"><contribs/></typeContrib><typeContrib code="18" lib_fr="Actes d'une conférence" lib_en="Proceedings"><contribs/></typeContrib></typeContribs></cv_prof>