<?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-04149792</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-18T18:45:25+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius</title>
            <author role="aut">
              <persName>
                <forename type="first">Gaétan</forename>
                <surname>Berthe</surname>
              </persName>
              <email type="md5">eb5ed1ee21fb648552d2cf25f4fccd86</email>
              <email type="domain">ens-lyon.org</email>
              <ptr type="url" target="https://gberthe.fr"/>
              <idno type="idhal" notation="string">gberthe</idno>
              <idno type="idhal" notation="numeric">1177559</idno>
              <idno type="halauthorid" notation="string">2618461-1177559</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0017-6922</idno>
              <idno type="ARXIV">https://arxiv.org/a/berthe_g_1</idno>
              <idno type="GOOGLE SCHOLAR">jR5XwK0AAAAJ</idno>
              <affiliation ref="#struct-1100628"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Marin</forename>
                <surname>Bougeret</surname>
              </persName>
              <email type="md5">866ea4828811774358e36f187ffc2c9c</email>
              <email type="domain">imag.fr</email>
              <idno type="idhal" notation="string">marin-bougeret</idno>
              <idno type="idhal" notation="numeric">10167</idno>
              <idno type="halauthorid" notation="string">17678-10167</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9910-4656</idno>
              <idno type="IDREF">https://www.idref.fr/197511686</idno>
              <affiliation ref="#struct-1100628"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Daniel</forename>
                <surname>Gonçalves</surname>
              </persName>
              <email type="md5">8ba7cd1796fa9827fc88de1233dbb88e</email>
              <email type="domain">lirmm.fr</email>
              <idno type="idhal" notation="string">daniel-goncalves</idno>
              <idno type="idhal" notation="numeric">7100</idno>
              <idno type="halauthorid" notation="string">15524-7100</idno>
              <idno type="IDREF">https://www.idref.fr/117629413</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3228-9622</idno>
              <idno type="ARXIV">https://arxiv.org/a/goncalves_d_1</idno>
              <affiliation ref="#struct-1100628"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Florent</forename>
                <surname>Raymond</surname>
              </persName>
              <email type="md5">068ff8662a7205e7840203f9f710b6c0</email>
              <email type="domain">cnrs.fr</email>
              <idno type="idhal" notation="string">jean-florent-raymond</idno>
              <idno type="idhal" notation="numeric">3527</idno>
              <idno type="halauthorid" notation="string">19698-3527</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4646-7602</idno>
              <idno type="IDREF">https://www.idref.fr/226798283</idno>
              <affiliation ref="#struct-544673"/>
              <affiliation ref="#struct-35418"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Cathy</forename>
                <surname>Tuchming</surname>
              </persName>
              <email type="md5">e0c2c835abeebdc0d858ec4887082bbc</email>
              <email type="domain">lirmm.fr</email>
            </editor>
            <funder ref="#projanr-55789"/>
            <funder ref="#projanr-51748"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-10-11 09:49:00</date>
              <date type="whenWritten">2024</date>
              <date type="whenModified">2025-12-02 03:03:50</date>
              <date type="whenReleased">2025-01-09 17:08:08</date>
              <date type="whenProduced">2024-06-12</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/2306.17710"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="103115">
                <persName>
                  <forename>Cathy</forename>
                  <surname>Tuchming</surname>
                </persName>
                <email type="md5">e0c2c835abeebdc0d858ec4887082bbc</email>
                <email type="domain">lirmm.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04149792</idno>
            <idno type="halUri">https://uca.hal.science/hal-04149792</idno>
            <idno type="halBibtex">berthe:hal-04149792</idno>
            <idno type="halRefHtml">&lt;i&gt;SWAT 2024 - 19th Scandinavian Symposium and Workshops on Algorithm Theory&lt;/i&gt;, Jun 2024, Helsinki, Finland. pp.11:1-11:18, &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.SWAT.2024.11"&gt;&amp;#x27E8;10.4230/LIPIcs.SWAT.2024.11&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">SWAT 2024 - 19th Scandinavian Symposium and Workshops on Algorithm Theory, Jun 2024, Helsinki, Finland. pp.11:1-11:18, &amp;#x27E8;10.4230/LIPIcs.SWAT.2024.11&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
            <idno type="stamp" n="PRES_CLERMONT">Université de Clermont</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
            <idno type="stamp" n="UNIV-MONTP3">Université de Montpellier Paul-Valéry</idno>
            <idno type="stamp" n="UNIV-PERP">Université Perpignan Via Domitia</idno>
            <idno type="stamp" n="LIP" corresp="UNIV-LYON1">Laboratoire de l'Informatique du Parallélisme</idno>
            <idno type="stamp" n="ALGCO" corresp="LIRMM">Algorithmes, Graphes et Combinatoire</idno>
            <idno type="stamp" n="LIRMM">Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</idno>
            <idno type="stamp" n="UNIV-MONTPELLIER">Université de Montpellier</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="UM-2015-2021" corresp="UNIV-MONTPELLIER">Université de Montpellier (2015-2021)</idno>
            <idno type="stamp" n="UM-EPE" corresp="UNIV-MONTPELLIER">Université de Montpellier - EPE</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Gaétan</forename>
                    <surname>Berthe</surname>
                  </persName>
                  <email type="md5">eb5ed1ee21fb648552d2cf25f4fccd86</email>
                  <email type="domain">ens-lyon.org</email>
                  <ptr type="url" target="https://gberthe.fr"/>
                  <idno type="idhal" notation="string">gberthe</idno>
                  <idno type="idhal" notation="numeric">1177559</idno>
                  <idno type="halauthorid" notation="string">2618461-1177559</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0017-6922</idno>
                  <idno type="ARXIV">https://arxiv.org/a/berthe_g_1</idno>
                  <idno type="GOOGLE SCHOLAR">jR5XwK0AAAAJ</idno>
                  <affiliation ref="#struct-1100628"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Marin</forename>
                    <surname>Bougeret</surname>
                  </persName>
                  <email type="md5">866ea4828811774358e36f187ffc2c9c</email>
                  <email type="domain">imag.fr</email>
                  <idno type="idhal" notation="string">marin-bougeret</idno>
                  <idno type="idhal" notation="numeric">10167</idno>
                  <idno type="halauthorid" notation="string">17678-10167</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9910-4656</idno>
                  <idno type="IDREF">https://www.idref.fr/197511686</idno>
                  <affiliation ref="#struct-1100628"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Daniel</forename>
                    <surname>Gonçalves</surname>
                  </persName>
                  <email type="md5">8ba7cd1796fa9827fc88de1233dbb88e</email>
                  <email type="domain">lirmm.fr</email>
                  <idno type="idhal" notation="string">daniel-goncalves</idno>
                  <idno type="idhal" notation="numeric">7100</idno>
                  <idno type="halauthorid" notation="string">15524-7100</idno>
                  <idno type="IDREF">https://www.idref.fr/117629413</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3228-9622</idno>
                  <idno type="ARXIV">https://arxiv.org/a/goncalves_d_1</idno>
                  <affiliation ref="#struct-1100628"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Florent</forename>
                    <surname>Raymond</surname>
                  </persName>
                  <email type="md5">068ff8662a7205e7840203f9f710b6c0</email>
                  <email type="domain">cnrs.fr</email>
                  <idno type="idhal" notation="string">jean-florent-raymond</idno>
                  <idno type="idhal" notation="numeric">3527</idno>
                  <idno type="halauthorid" notation="string">19698-3527</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4646-7602</idno>
                  <idno type="IDREF">https://www.idref.fr/226798283</idno>
                  <affiliation ref="#struct-544673"/>
                  <affiliation ref="#struct-35418"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>SWAT 2024 - 19th Scandinavian Symposium and Workshops on Algorithm Theory</title>
                  <date type="start">2024-06-12</date>
                  <date type="end">2024-06-14</date>
                  <settlement>Helsinki</settlement>
                  <country key="FI">Finland</country>
                </meeting>
                <imprint>
                  <publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</publisher>
                  <biblScope unit="volume">294</biblScope>
                  <biblScope unit="pp">11:1-11:18</biblScope>
                  <date type="datePub">2024-05-31</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2306.17710</idno>
              <idno type="doi">10.4230/LIPIcs.SWAT.2024.11</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Intersection graphs</term>
                <term xml:lang="en">Subexponential FPT algorithms</term>
                <term xml:lang="en">Cycle-hitting problems</term>
                <term xml:lang="en">Bidimensionality</term>
                <term xml:lang="en">Geometric intersection graphs</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We investigate the existence in geometric graph classes of subexponential parameterized algorithms for cycle-hitting problems like \textsc{Triangle Hitting} (TH), \textsc{Feedback Vertex Set} (FVS) or \textsc{Odd Cycle Transversal} (OCT). These problems respectively ask for the existence in a graph $G$ of a set $X$ of at most $k$ vertices such that $G-X$ is triangle-free, acyclic, or bipartite. It is know that subexponential FPT algorithms of the form $2^{o(k)}n^{O(1)}$ exist in planar and even $H$-minor free graphs from bidimensionality theory [Demaine et al. 2005], and there is a recent line of work lifting these results to geometric graph classes consisting of intersection of similarly sized ``fat'' objects ([Fomin et al. 2012]\nocite{Fomin12}, [Grigoriev et al. 2014], or disk graphs [Lokshtanov et al. 2022], [An et al. 2023]). In this paper we first identify sufficient conditions, for any graph class $\mathcal{C}$ included in string graphs, to admit subexponential FPT algorithms for any problem in $\mathcal{P}$, a family of bidimensional problems where one has to find a set of size at most $k$ hitting a fixed family of graphs, containing in particular \FVS. Informally, these conditions boil down to the fact that for any $G \in \mathcal{C}$, the \emph{local radius of $G$} (a new parameter introduced in [Lokshtanov et al. 2023]) is polynomial in the clique number of $G$ and in the maximum matching in the neighborhood of a vertex.To demonstrate the applicability of this generic result, we bound the local radius for two special classes: intersection graphs of axis-parallel squares and of contact graphs of segments in the plane. This implies that any problem $\Pi \in \mathcal{P}$ (in particular, \FVS) can be solved in:\begin{itemize}  \item $2^{O(k^{3/4}\log k)}n^{O(1)}$-time in contact segment graphs,    \item $2^{O(k^{9/10}\log k)}n^{O(1)}$ in intersection graphs of axis-parallel squares\end{itemize}On the positive side, we also provide positive results for Triangle Hitting by solving it in: \begin{itemize}    \item $2^{O(k^{3/4}\log k)}n^{O(1)}$-time in contact segment graphs,    \item $2^{O(\sqrt d t^2 (\log t)  k^{2/3}\log k)} n^{O(1)}$-time in $K_{t,t}$-free \dDIR graphs (intersection of segments with at most $d$ possible slopes)  \end{itemize}On the negative side, assuming the ETH we rule out the existence of algorithms solving:\begin{itemize}    \item Triangle Hitting and Odd Cycle Transversal in time $2^{o(n)}$ in 2-DIR graphs and more generally in time $2^{o(\sqrt{\Delta n})}$ in 2-DIR graphs with maximum degree $\Delta$, and    \item Triangle Hitting, Feedback Vrtex Set, and Odd Cycle Transversal in time $2^{o(\sqrt{n})}$ in $K_{2,2}$-free contact-2-DIR graphs of maximum degree~6.\end{itemize}Observe that together, these results show that the absence of large $K_{t,t}$ is a necessary and sufficient condition for the existence of subexponential FPT algorithms for Triangle Hitting in 2-DIR.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-1100628" status="VALID">
          <orgName>Algorithmes, Graphes et Combinatoire</orgName>
          <orgName type="acronym">LIRMM | ALGCO</orgName>
          <date type="start">2022-01-01</date>
          <desc>
            <address>
              <addrLine>LIRMM, 161 rue Ada, 34000 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr/equipes/ALGCO/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-1100620" type="direct"/>
            <relation active="#struct-101475" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="UMR5506" active="#struct-441569" type="indirect"/>
            <relation name="UMR5506" active="#struct-1100589" type="indirect"/>
            <relation active="#struct-1219853" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-544673" status="VALID">
          <orgName>Modèles de calcul, Complexité, Combinatoire</orgName>
          <orgName type="acronym">MC2</orgName>
          <desc>
            <address>
              <addrLine>ENS Lyon 46 allée d'Italie 69364 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-lyon.fr/LIP/MC2/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-35418" type="direct"/>
            <relation active="#struct-6818" type="indirect"/>
            <relation active="#struct-301088" type="indirect"/>
            <relation active="#struct-194495" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-35418" status="VALID">
          <idno type="IdRef">191041289</idno>
          <idno type="ISNI">0000000104538607</idno>
          <idno type="RNSR">200317503S</idno>
          <idno type="ROR">04msnz457</idno>
          <orgName>Laboratoire de l'Informatique du Parallélisme</orgName>
          <orgName type="acronym">LIP</orgName>
          <date type="start">1990-01-01</date>
          <desc>
            <address>
              <addrLine>46 Allée d'Italie 69364 LYON CEDEX 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-lyon.fr/LIP/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6818" type="direct"/>
            <relation active="#struct-301088" type="direct"/>
            <relation active="#struct-194495" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1100620" status="VALID">
          <idno type="IdRef">139590827</idno>
          <idno type="ISNI">0000000405990488</idno>
          <idno type="RNSR">199111950H</idno>
          <idno type="ROR">https://ror.org/013yean28</idno>
          <orgName>Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</orgName>
          <orgName type="acronym">LIRMM</orgName>
          <date type="start">2022-01-01</date>
          <desc>
            <address>
              <addrLine>161 rue Ada - 34095 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-101475" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR5506" active="#struct-441569" type="direct"/>
            <relation name="UMR5506" active="#struct-1100589" type="direct"/>
            <relation active="#struct-1219853" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-101475" status="VALID">
          <idno type="ROR">https://ror.org/03am2jy38</idno>
          <orgName>Université de Perpignan Via Domitia</orgName>
          <orgName type="acronym">UPVD</orgName>
          <desc>
            <address>
              <addrLine>52 avenue Paul Alduy - 66860 Perpignan Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-perp.fr/</ref>
          </desc>
        </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="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="regroupinstitution" xml:id="struct-1100589" status="VALID">
          <idno type="ROR">https://ror.org/051escj72</idno>
          <orgName>Université de Montpellier</orgName>
          <orgName type="acronym">UM</orgName>
          <date type="start">2022-01-01</date>
          <desc>
            <address>
              <addrLine>163 rue Auguste Broussonnet - 34090 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.umontpellier.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-1219853" status="VALID">
          <idno type="IdRef">282217916</idno>
          <orgName>Université de Montpellier Paul-Valéry</orgName>
          <orgName type="acronym">UMPV</orgName>
          <date type="start">2025-01-01</date>
          <desc>
            <address>
              <addrLine>Université de Montpellier Paul-Valéry Route de Mende 34199 Montpellier Cedex 5</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-montp3.fr/fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-6818" status="VALID">
          <idno type="IdRef">149154992</idno>
          <idno type="ISNI">0000000123319856</idno>
          <idno type="ROR">https://ror.org/04zmssz18</idno>
          <idno type="Wikidata">Q10159</idno>
          <orgName>École normale supérieure de Lyon</orgName>
          <orgName type="acronym">ENS de Lyon</orgName>
          <date type="start">2010-01-01</date>
          <desc>
            <address>
              <addrLine>15 parvis René Descartes - BP 7000 - 69342 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ens-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-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>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-55789" status="VALID">
          <idno type="anr">ANR-21-CE48-0004</idno>
          <orgName>GRALMECO</orgName>
          <desc>Algorithmique des problèmes de couverture métriques dans les graphes</desc>
          <date type="start">2021</date>
        </org>
        <org type="anrProject" xml:id="projanr-51748" status="VALID">
          <idno type="anr">ANR-20-CE48-0008</idno>
          <orgName>ELIT</orgName>
          <desc>Un Parcours par les Limites de l'Efficacité</desc>
          <date type="start">2020</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>