<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03993275</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-06T21:00:46+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Complexity of Maker-Breaker Games on Edge Sets of Graphs</title>
            <author role="aut">
              <persName>
                <forename type="first">Eric</forename>
                <surname>Duchêne</surname>
              </persName>
              <email type="md5">2cc88e1298ac6cf4cf19d77bd8e732be</email>
              <email type="domain">univ-lyon1.fr</email>
              <idno type="idhal" notation="string">educhene</idno>
              <idno type="idhal" notation="numeric">4993</idno>
              <idno type="halauthorid" notation="string">320052-4993</idno>
              <idno type="IDREF">https://www.idref.fr/11204901X</idno>
              <affiliation ref="#struct-2003"/>
              <affiliation ref="#struct-413088"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Valentin</forename>
                <surname>Gledel</surname>
              </persName>
              <email type="md5">0c26e9f392f936723d442858de7e46f1</email>
              <email type="domain">univ-savoie.fr</email>
              <idno type="idhal" notation="string">vgledel</idno>
              <idno type="idhal" notation="numeric">1428046</idno>
              <idno type="halauthorid" notation="string">39685-1428046</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=YpyWUwYAAAAJ</idno>
              <affiliation ref="#struct-548056"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Fionn</forename>
                <surname>Mc Inerney</surname>
              </persName>
              <email type="md5">9823ac5a7d27b9767d815135744a6ef9</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">fionn-mc-inerney</idno>
              <idno type="idhal" notation="numeric">734680</idno>
              <idno type="halauthorid" notation="string">33891-734680</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5634-9506</idno>
              <affiliation ref="#struct-527033"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nicolas</forename>
                <surname>Nisse</surname>
              </persName>
              <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">nicolas-nisse</idno>
              <idno type="idhal" notation="numeric">4293</idno>
              <idno type="halauthorid" notation="string">12643-4293</idno>
              <idno type="IDREF">https://www.idref.fr/119020335</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4500-5078</idno>
              <affiliation ref="#struct-1039632"/>
              <affiliation ref="#struct-211142"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nacim</forename>
                <surname>Oijid</surname>
              </persName>
              <email type="md5">171b9d1d4dc63d5163c56db9d408dd78</email>
              <email type="domain">umu.se</email>
              <idno type="idhal" notation="string">nacim-oijid</idno>
              <idno type="idhal" notation="numeric">749328</idno>
              <idno type="halauthorid" notation="string">2291631-749328</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8313-639X</idno>
              <affiliation ref="#struct-2003"/>
              <affiliation ref="#struct-413088"/>
              <affiliation ref="#struct-194495"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Aline</forename>
                <surname>Parreau</surname>
              </persName>
              <email type="md5">78ee45091e3b13ec52f37b4ac342b162</email>
              <email type="domain">univ-lyon1.fr</email>
              <idno type="idhal" notation="string">aline-parreau</idno>
              <idno type="idhal" notation="numeric">3752</idno>
              <idno type="halauthorid" notation="string">25387-3752</idno>
              <idno type="IDREF">https://www.idref.fr/16496956X</idno>
              <affiliation ref="#struct-2003"/>
              <affiliation ref="#struct-413088"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Miloš</forename>
                <surname>Stojaković</surname>
              </persName>
              <idno type="halauthorid">930720-0</idno>
              <affiliation ref="#struct-309583"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Nicolas</forename>
                <surname>Nisse</surname>
              </persName>
              <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-55792"/>
            <funder ref="#projanr-43587"/>
            <funder ref="#projanr-50864"/>
            <funder ref="#projanr-49542"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-02-16 18:55:10</date>
              <date type="whenModified">2026-04-22 09:36:43</date>
              <date type="whenReleased">2023-02-17 15:41:12</date>
              <date type="whenProduced">2025-01</date>
              <date type="whenEndEmbargoed">2023-02-16</date>
              <ref type="file" target="https://hal.science/hal-03993275v1/document">
                <date notBefore="2023-02-16"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-03993275v1/file/Complexity_Of_Positional_Games-6.pdf" id="file-3993275-3481751">
                <date notBefore="2023-02-16"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/2302.10972"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="120410">
                <persName>
                  <forename>Nicolas</forename>
                  <surname>Nisse</surname>
                </persName>
                <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03993275</idno>
            <idno type="halUri">https://hal.science/hal-03993275</idno>
            <idno type="halBibtex">duchene:hal-03993275</idno>
            <idno type="halRefHtml">&lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, 2025, 361, pp.502-522. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.dam.2024.11.012"&gt;&amp;#x27E8;10.1016/j.dam.2024.11.012&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Discrete Applied Mathematics, 2025, 361, pp.502-522. &amp;#x27E8;10.1016/j.dam.2024.11.012&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-3993275-3481751"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNICE">Université Nice Sophia Antipolis</idno>
            <idno type="stamp" n="UNIV-SAVOIE">Université Savoie Mont Blanc</idno>
            <idno type="stamp" n="UNIV-TLN">Université de Toulon</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="UNIV-AMU">Aix Marseille Université</idno>
            <idno type="stamp" n="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
            <idno type="stamp" n="UNIV-LYON2">Université Lumière Lyon 2</idno>
            <idno type="stamp" n="INSA-LYON">Institut National des Sciences Appliquées de Lyon</idno>
            <idno type="stamp" n="EC-LYON">Ecole Centrale de Lyon</idno>
            <idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
            <idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="LIRIS" corresp="UNIV-LYON1">Laboratoire d'InfoRmatique en Image et Systèmes d'information</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="IDEX-UNIV-COTEDAZUR">IDEX Université Côte d'Azur</idno>
            <idno type="stamp" n="LIS-LAB">Laboratoire d'Informatique et Systèmes</idno>
            <idno type="stamp" n="LYON2">Université Lyon2</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="UDL">UDL</idno>
            <idno type="stamp" n="UNIV-LYON">Université de Lyon</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="TEST-NICE">test nice</idno>
            <idno type="stamp" n="HAL-LYON-2-NOUVELLE-VERSION">Nouvelle version portail </idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Complexity of Maker-Breaker Games on Edge Sets of Graphs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Eric</forename>
                    <surname>Duchêne</surname>
                  </persName>
                  <email type="md5">2cc88e1298ac6cf4cf19d77bd8e732be</email>
                  <email type="domain">univ-lyon1.fr</email>
                  <idno type="idhal" notation="string">educhene</idno>
                  <idno type="idhal" notation="numeric">4993</idno>
                  <idno type="halauthorid" notation="string">320052-4993</idno>
                  <idno type="IDREF">https://www.idref.fr/11204901X</idno>
                  <affiliation ref="#struct-2003"/>
                  <affiliation ref="#struct-413088"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Valentin</forename>
                    <surname>Gledel</surname>
                  </persName>
                  <email type="md5">0c26e9f392f936723d442858de7e46f1</email>
                  <email type="domain">univ-savoie.fr</email>
                  <idno type="idhal" notation="string">vgledel</idno>
                  <idno type="idhal" notation="numeric">1428046</idno>
                  <idno type="halauthorid" notation="string">39685-1428046</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=YpyWUwYAAAAJ</idno>
                  <affiliation ref="#struct-548056"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Fionn</forename>
                    <surname>Mc Inerney</surname>
                  </persName>
                  <email type="md5">9823ac5a7d27b9767d815135744a6ef9</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">fionn-mc-inerney</idno>
                  <idno type="idhal" notation="numeric">734680</idno>
                  <idno type="halauthorid" notation="string">33891-734680</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5634-9506</idno>
                  <affiliation ref="#struct-527033"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nicolas</forename>
                    <surname>Nisse</surname>
                  </persName>
                  <email type="md5">b73bc7bf53fc6c15e9e8581117d123f1</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">nicolas-nisse</idno>
                  <idno type="idhal" notation="numeric">4293</idno>
                  <idno type="halauthorid" notation="string">12643-4293</idno>
                  <idno type="IDREF">https://www.idref.fr/119020335</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4500-5078</idno>
                  <affiliation ref="#struct-1039632"/>
                  <affiliation ref="#struct-211142"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nacim</forename>
                    <surname>Oijid</surname>
                  </persName>
                  <email type="md5">171b9d1d4dc63d5163c56db9d408dd78</email>
                  <email type="domain">umu.se</email>
                  <idno type="idhal" notation="string">nacim-oijid</idno>
                  <idno type="idhal" notation="numeric">749328</idno>
                  <idno type="halauthorid" notation="string">2291631-749328</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8313-639X</idno>
                  <affiliation ref="#struct-2003"/>
                  <affiliation ref="#struct-413088"/>
                  <affiliation ref="#struct-194495"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Aline</forename>
                    <surname>Parreau</surname>
                  </persName>
                  <email type="md5">78ee45091e3b13ec52f37b4ac342b162</email>
                  <email type="domain">univ-lyon1.fr</email>
                  <idno type="idhal" notation="string">aline-parreau</idno>
                  <idno type="idhal" notation="numeric">3752</idno>
                  <idno type="halauthorid" notation="string">25387-3752</idno>
                  <idno type="IDREF">https://www.idref.fr/16496956X</idno>
                  <affiliation ref="#struct-2003"/>
                  <affiliation ref="#struct-413088"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Miloš</forename>
                    <surname>Stojaković</surname>
                  </persName>
                  <idno type="halauthorid">930720-0</idno>
                  <affiliation ref="#struct-309583"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">12621</idno>
                <idno type="issn">0166-218X</idno>
                <title level="j">Discrete Applied Mathematics</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">361</biblScope>
                  <biblScope unit="pp">502-522</biblScope>
                  <date type="datePub">2025-01</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2302.10972</idno>
              <idno type="doi">10.1016/j.dam.2024.11.012</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Maker-Breaker Games</term>
                <term xml:lang="en">H-game</term>
                <term xml:lang="en">Perfect Matching Game</term>
                <term xml:lang="en">Connectivity Game</term>
                <term xml:lang="en">Computational Complexity</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We initiate the study of the algorithmic complexity of Maker-Breaker games played on edge sets of graphs for general graphs. We mainly consider three of the big four such games: the connectivity game, perfect matching game, and H-game. Maker wins if she claims the edges of a spanning tree in the first, a perfect matching in the second, and a copy of a fixed graph H in the third. We prove that deciding who wins the perfect matching game and the H-game is PSPACE-complete, even for the latter in graphs of small diameter if H is a tree. Seeking to find the smallest graph H such that the H-game is PSPACE-complete, we also prove that there exists such an H of order 51 and size 57. On the positive side, we show that the connectivity game and arboricity-k game are polynomial-time solvable. We then give several positive results for the H-game, first giving a structural characterization for Breaker to win the P 4-game, which gives a linear-time algorithm for the P 4-game. We provide a structural characterization for Maker to win the K 1,ℓ-game in trees, which implies a linear-time algorithm for the K 1,ℓ-game in trees. Lastly, we prove that the K 1,ℓ-game in any graph, and the H-game in trees are both FPT parameterized by the length of the game. We leave the complexity of the last of the big four games, the Hamiltonicity game, as an open question.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2003" status="VALID">
          <idno type="IdRef">149705271</idno>
          <idno type="ISNI">0000000122577669</idno>
          <idno type="RNSR">200511875R</idno>
          <idno type="ROR">https://ror.org/04dv4he91</idno>
          <orgName>Laboratoire d'InfoRmatique en Image et Systèmes d'information</orgName>
          <orgName type="acronym">LIRIS</orgName>
          <date type="start">2003-01-01</date>
          <desc>
            <address>
              <addrLine>Bâtiment Blaise Pascal - 20, avenue Albert Einstein - 69621 Villeurbanne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://liris.cnrs.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-33804" type="direct"/>
            <relation active="#struct-126765" type="direct"/>
            <relation active="#struct-301088" type="indirect"/>
            <relation active="#struct-194495" type="direct"/>
            <relation active="#struct-219748" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation name="UMR5205" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-413088" status="VALID">
          <orgName>Graphes, AlgOrithmes et AppLications</orgName>
          <orgName type="acronym">GOAL</orgName>
          <date type="start">2015-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-2003" type="direct"/>
            <relation active="#struct-33804" type="indirect"/>
            <relation active="#struct-126765" type="indirect"/>
            <relation active="#struct-301088" type="indirect"/>
            <relation active="#struct-194495" type="indirect"/>
            <relation active="#struct-219748" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation name="UMR5205" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-548056" status="VALID">
          <idno type="ISNI">0000 0001 1034 3451</idno>
          <idno type="ROR">https://ror.org/05kb8h459</idno>
          <orgName>Umeå University = Umeå Universitet</orgName>
          <date type="start">1965-01-01</date>
          <desc>
            <address>
              <addrLine>Umeå University901 87 Umeå, Sweden</addrLine>
              <country key="SE"/>
            </address>
            <ref type="url">http://www.umu.se/english</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-527033" status="VALID">
          <idno type="IdRef">234768002</idno>
          <idno type="RNSR">201822714R</idno>
          <idno type="ROR">https://ror.org/0257sgk90</idno>
          <idno type="Wikidata">Q52605252</idno>
          <orgName>Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)</orgName>
          <orgName type="acronym">LIS</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>Aix Marseille Université – Campus de Saint Jérôme – Bat. Polytech, 52 Av. Escadrille Normandie Niemen, 13397 Marseille Cedex 20</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR7020" active="#struct-198056" type="direct"/>
            <relation name="UMR7020" active="#struct-303091" type="direct"/>
            <relation name="UMR7020" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-1039632" status="VALID">
          <idno type="IdRef">241035694</idno>
          <idno type="ROR">https://ror.org/019tgvf94</idno>
          <orgName>Université Côte d'Azur</orgName>
          <orgName type="acronym">UniCA</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://univ-cotedazur.fr</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-211142" status="VALID">
          <idno type="RNSR">201322124W</idno>
          <idno type="ROR">https://ror.org/02mab7455</idno>
          <orgName>Combinatorics, Optimization and Algorithms for Telecommunications</orgName>
          <orgName type="acronym">COATI</orgName>
          <date type="start">2013-01-01</date>
          <date type="end">2026-04-30</date>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France)</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/coati</ref>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-451999" type="direct"/>
            <relation active="#struct-13009" type="indirect"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-194495" status="VALID">
          <idno type="IdRef">026402823</idno>
          <idno type="ISNI">0000000121686185</idno>
          <idno type="ROR">https://ror.org/029brtt94</idno>
          <orgName>Université Claude Bernard Lyon 1</orgName>
          <orgName type="acronym">UCBL</orgName>
          <desc>
            <address>
              <addrLine>43, boulevard du 11 novembre 1918, 69622 Villeurbanne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lyon1.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-309583" status="VALID">
          <idno type="IdRef">029717523</idno>
          <idno type="ROR">https://ror.org/00xa57a59</idno>
          <orgName>University of Novi Sad</orgName>
          <desc>
            <address>
              <addrLine>Novi Sad 402920, Serbia</addrLine>
              <country key="RS"/>
            </address>
            <ref type="url">http://www.uns.ac.rs/en/o_univerzitetu.htm</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-33804" status="VALID">
          <idno type="IdRef">02640334X</idno>
          <idno type="ISNI">0000 0001 2188 0906</idno>
          <idno type="ROR">https://ror.org/03rth4p18</idno>
          <idno type="Wikidata">Q4041</idno>
          <orgName>Université Lumière - Lyon 2</orgName>
          <orgName type="acronym">UL2</orgName>
          <desc>
            <address>
              <addrLine>86, rue Pasteur - 69007 Lyon</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lyon2.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-126765" status="VALID">
          <idno type="ROR">https://ror.org/05s6rge65</idno>
          <orgName>École Centrale de Lyon</orgName>
          <orgName type="acronym">ECL</orgName>
          <desc>
            <address>
              <addrLine>36 avenue Guy de Collongue - 69134 Ecully cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ec-lyon.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301088" status="VALID">
          <idno type="ROR">https://ror.org/01rk35k63</idno>
          <orgName>Université de Lyon</orgName>
          <desc>
            <address>
              <addrLine>92 rue Pasteur - CS 30122, 69361 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-lyon.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-219748" status="VALID">
          <idno type="IdRef">052444724</idno>
          <idno type="ISNI">0000 0001 2292 0228</idno>
          <orgName>Institut National des Sciences Appliquées de Lyon</orgName>
          <orgName type="acronym">INSA Lyon</orgName>
          <date type="start">1957-03-18</date>
          <desc>
            <address>
              <addrLine>20 Avenue Albert Einstein, 69621 Villeurbanne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-lyon.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-198056" status="VALID">
          <idno type="IdRef">15863621X</idno>
          <idno type="ISNI">0000 0001 2176 4817</idno>
          <idno type="ROR">https://ror.org/035xkbk20</idno>
          <orgName>Aix Marseille Université</orgName>
          <orgName type="acronym">AMU</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Aix-Marseille UniversitéJardins du Pharo58 Boulevard Charles Livon13284 Marseille cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-amu.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303091" status="VALID">
          <idno type="IdRef">031122337</idno>
          <idno type="ROR">https://ror.org/02m9kbe37</idno>
          <orgName>Université de Toulon</orgName>
          <orgName type="acronym">UTLN</orgName>
          <desc>
            <address>
              <addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tln.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-451999" status="VALID">
          <orgName>COMmunications, Réseaux, systèmes Embarqués et Distribués</orgName>
          <orgName type="acronym">Laboratoire I3S - COMRED</orgName>
          <date type="start">2016-03-02</date>
          <desc>
            <address>
              <addrLine>Laboratoire I3SCS 4012106903 Sophia Antipolis Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/comred</ref>
          </desc>
          <listRelation>
            <relation active="#struct-13009" type="direct"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-13009" status="VALID">
          <idno type="IdRef">050320491</idno>
          <idno type="ISNI">0000000105613840</idno>
          <idno type="RNSR">201220432L</idno>
          <idno type="ROR">https://ror.org/01215r597</idno>
          <orgName>Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis</orgName>
          <orgName type="acronym">I3S</orgName>
          <desc>
            <address>
              <addrLine>2000, route des Lucioles - Les Algorithmes - bât. Euclide B 06900 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR7271" active="#struct-441569" type="direct"/>
            <relation active="#struct-1039632" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-117617" status="VALID">
          <idno type="IdRef">026403498</idno>
          <idno type="ISNI">0000000123372892</idno>
          <idno type="ROR">https://ror.org/02k9vew78</idno>
          <orgName>Université Nice Sophia Antipolis (1965 - 2019)</orgName>
          <orgName type="acronym">UNS</orgName>
          <date type="start">1965-10-23</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 06100 Nice</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://unice.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-55792" status="VALID">
          <idno type="anr">ANR-21-CE48-0001</idno>
          <orgName>P-GASE</orgName>
          <desc>Jeux positionnels : complexité, algorithmes et stratégies</desc>
          <date type="start">2021</date>
        </org>
        <org type="anrProject" xml:id="projanr-43587" status="VALID">
          <idno type="anr">ANR-17-CE40-0015</idno>
          <orgName>DISTANCIA</orgName>
          <desc>Théorie métrique des graphes</desc>
          <date type="start">2017</date>
        </org>
        <org type="anrProject" xml:id="projanr-50864" status="VALID">
          <idno type="anr">ANR-15-IDEX-0001</idno>
          <orgName>UCA JEDI</orgName>
          <desc>Idex UCA JEDI</desc>
          <date type="start">2015</date>
        </org>
        <org type="anrProject" xml:id="projanr-49542" status="VALID">
          <idno type="anr">ANR-17-EURE-0004</idno>
          <orgName>UCA DS4H</orgName>
          <desc>UCA Systèmes Numériques pour l'Homme</desc>
          <date type="start">2017</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>