<?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-01370531</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-02T11:06:05+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="fr">Complexity of Grundy Coloring and Its Variants</title>
            <author role="aut">
              <persName>
                <forename type="first">Edouard</forename>
                <surname>Bonnet</surname>
              </persName>
              <email type="md5">f0d48d761568aaefbce1ecd0857804c6</email>
              <email type="domain">ens-lyon.fr</email>
              <idno type="idhal" notation="string">edouard-bonnet</idno>
              <idno type="idhal" notation="numeric">171728</idno>
              <idno type="halauthorid" notation="string">24012-171728</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1653-5822</idno>
              <idno type="IDREF">https://www.idref.fr/182698602</idno>
              <affiliation ref="#struct-989"/>
              <affiliation ref="#struct-306576"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Florent</forename>
                <surname>Foucaud</surname>
              </persName>
              <email type="md5">1ed88a90117097c6e89b550284193171</email>
              <email type="domain">uca.fr</email>
              <idno type="idhal" notation="string">florent-foucaud</idno>
              <idno type="idhal" notation="numeric">169708</idno>
              <idno type="halauthorid" notation="string">20994-169708</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8198-693X</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Eun Jung</forename>
                <surname>Kim</surname>
              </persName>
              <email type="md5">a1e380be945931c80e0cb026de897ab2</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">eunjung-kim</idno>
              <idno type="idhal" notation="numeric">874253</idno>
              <idno type="halauthorid" notation="string">480172-874253</idno>
              <idno type="ARXIV">https://arxiv.org/a/kim_e_2</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6824-0516</idno>
              <orgName ref="#struct-989"/>
              <affiliation ref="#struct-989"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Florian</forename>
                <surname>Sikora</surname>
              </persName>
              <email type="md5">bd6939ca968708c5a7b906ac1ae6a53a</email>
              <email type="domain">dauphine.fr</email>
              <idno type="idhal" notation="string">florian-sikora</idno>
              <idno type="idhal" notation="numeric">742949</idno>
              <idno type="halauthorid" notation="string">9311-742949</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2670-6258</idno>
              <idno type="IDREF">https://www.idref.fr/158172590</idno>
              <affiliation ref="#struct-989"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Florent</forename>
                <surname>Foucaud</surname>
              </persName>
              <email type="md5">1ed88a90117097c6e89b550284193171</email>
              <email type="domain">uca.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-02-13 17:04:52</date>
              <date type="whenModified">2025-06-13 11:38:14</date>
              <date type="whenReleased">2025-02-14 08:32:46</date>
              <date type="whenProduced">2015-08</date>
              <date type="whenEndEmbargoed">2025-02-13</date>
              <ref type="file" target="https://hal.science/hal-01370531v1/document">
                <date notBefore="2025-02-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01370531v1/file/COCOON2015_019_final_v2.pdf" id="file-4946576-4291456">
                <date notBefore="2025-02-13"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1407.5336"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="150557">
                <persName>
                  <forename>Florent</forename>
                  <surname>Foucaud</surname>
                </persName>
                <email type="md5">1ed88a90117097c6e89b550284193171</email>
                <email type="domain">uca.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01370531</idno>
            <idno type="halUri">https://hal.science/hal-01370531</idno>
            <idno type="halBibtex">bonnet:hal-01370531</idno>
            <idno type="halRefHtml">&lt;i&gt;21st International Conference on Computing and Combinatorics, COCOON 2015&lt;/i&gt;, Aug 2015, Beijing, China. pp.109-120, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-21398-9_9"&gt;&amp;#x27E8;10.1007/978-3-319-21398-9_9&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">21st International Conference on Computing and Combinatorics, COCOON 2015, Aug 2015, Beijing, China. pp.109-120, &amp;#x27E8;10.1007/978-3-319-21398-9_9&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-4946576-4291456"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <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-CLERMONT1" corresp="PRES_CLERMONT">Université d'Auvergne - Clermont-Ferrand I</idno>
            <idno type="stamp" n="UNIV-BPCLERMONT" corresp="PRES_CLERMONT">Université Blaise Pascal - Clermont-Ferrand II</idno>
            <idno type="stamp" n="UNIV-DAUPHINE">Université Paris Dauphine - Paris IX</idno>
            <idno type="stamp" n="LIMOS" corresp="PRES_CLERMONT">Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</idno>
            <idno type="stamp" n="LAMSADE-DAUPHINE" corresp="UNIV-DAUPHINE">LAMSADE (Laboratoire d'Analyse et de Modélisation des Systèmes pour l'Aide à la Décision)</idno>
            <idno type="stamp" n="PSL">Université Paris sciences et lettres</idno>
            <idno type="stamp" n="UNIV-DAUPHINE-PSL" corresp="PSL">Université Paris Dauphine - PSL</idno>
            <idno type="stamp" n="CLERMONT-AUVERGNE-INP">Clermont Auvergne INP</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="0">No</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="fr">Complexity of Grundy Coloring and Its Variants</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Edouard</forename>
                    <surname>Bonnet</surname>
                  </persName>
                  <email type="md5">f0d48d761568aaefbce1ecd0857804c6</email>
                  <email type="domain">ens-lyon.fr</email>
                  <idno type="idhal" notation="string">edouard-bonnet</idno>
                  <idno type="idhal" notation="numeric">171728</idno>
                  <idno type="halauthorid" notation="string">24012-171728</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1653-5822</idno>
                  <idno type="IDREF">https://www.idref.fr/182698602</idno>
                  <affiliation ref="#struct-989"/>
                  <affiliation ref="#struct-306576"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Florent</forename>
                    <surname>Foucaud</surname>
                  </persName>
                  <email type="md5">1ed88a90117097c6e89b550284193171</email>
                  <email type="domain">uca.fr</email>
                  <idno type="idhal" notation="string">florent-foucaud</idno>
                  <idno type="idhal" notation="numeric">169708</idno>
                  <idno type="halauthorid" notation="string">20994-169708</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8198-693X</idno>
                  <affiliation ref="#struct-857"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Eun Jung</forename>
                    <surname>Kim</surname>
                  </persName>
                  <email type="md5">a1e380be945931c80e0cb026de897ab2</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">eunjung-kim</idno>
                  <idno type="idhal" notation="numeric">874253</idno>
                  <idno type="halauthorid" notation="string">480172-874253</idno>
                  <idno type="ARXIV">https://arxiv.org/a/kim_e_2</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6824-0516</idno>
                  <orgName ref="#struct-989"/>
                  <affiliation ref="#struct-989"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Florian</forename>
                    <surname>Sikora</surname>
                  </persName>
                  <email type="md5">bd6939ca968708c5a7b906ac1ae6a53a</email>
                  <email type="domain">dauphine.fr</email>
                  <idno type="idhal" notation="string">florian-sikora</idno>
                  <idno type="idhal" notation="numeric">742949</idno>
                  <idno type="halauthorid" notation="string">9311-742949</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2670-6258</idno>
                  <idno type="IDREF">https://www.idref.fr/158172590</idno>
                  <affiliation ref="#struct-989"/>
                </author>
              </analytic>
              <monogr>
                <idno type="isbn">978-3-319-21397-2</idno>
                <title level="m">Computing and Combinatorics. 2L 1st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings</title>
                <meeting>
                  <title>21st International Conference on Computing and Combinatorics, COCOON 2015</title>
                  <date type="start">2015-08</date>
                  <settlement>Beijing</settlement>
                  <country key="CN">China</country>
                </meeting>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">9198</biblScope>
                  <biblScope unit="pp">109-120</biblScope>
                  <date type="datePub">2015-01-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-21398-9_9</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">Complexity</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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>The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of Grundy Coloring, the problem of determining whether a given graph has Grundy number at least k. We show that Grundy Coloring can be solved in time O∗(2.443n) on graphs of order n. While the problem is known to be solvable in time f(k,w)⋅n for graphs of treewidth w, we prove that under the Exponential Time Hypothesis, it cannot be computed in time O∗(cw), for any constant c. We also study the parameterized complexity of Grundy Coloring parameterized by the number of colors, showing that it is in FPTfor graphs including chordal graphs, claw-free graphs, and graphs excluding a fixed minor.Finally, we consider two previously studied variants of Grundy Coloring, namely Weak Grundy Coloring and Connected Grundy Coloring. We show that Weak Grundy Coloring is fixed-parameter tractable with respect to the weak Grundy number. In stark contrast, it turns out that checking whether a given graph has connected Grundy number at least k is NP-complete already for k=7.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-989" status="VALID">
          <idno type="IdRef">030107156</idno>
          <idno type="ISNI">0000 0001 2097 7052</idno>
          <idno type="RNSR">201120462Y</idno>
          <idno type="ROR">https://ror.org/052bz7812</idno>
          <idno type="Wikidata">Q3214405</idno>
          <orgName>Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision</orgName>
          <orgName type="acronym">LAMSADE</orgName>
          <desc>
            <address>
              <addrLine>Place de Lattre de Tassigny 75775 PARIS CEDEX 16</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lamsade.dauphine.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300302" type="direct"/>
            <relation active="#struct-564132" type="indirect"/>
            <relation name="UMR7243 / FRE3234 / UMR7024" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-306576" status="VALID">
          <idno type="ROR">https://ror.org/02ks8qq67</idno>
          <orgName>Hungarian Academy of Sciences</orgName>
          <orgName type="acronym">MTA</orgName>
          <desc>
            <address>
              <addrLine>Széchenyi István sqr. 9, 1051 Budapest</addrLine>
              <country key="HU"/>
            </address>
            <ref type="url">http://mta.hu/english</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-857" status="OLD">
          <idno type="IdRef">155645919</idno>
          <idno type="RNSR">200212221E</idno>
          <orgName>Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</orgName>
          <orgName type="acronym">LIMOS</orgName>
          <date type="start">2000-01-01</date>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>Bât ISIMA Campus des Cézeaux BP 10025 63173 AUBIERE cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.isima.fr/limos/</ref>
          </desc>
          <listRelation>
            <relation name="UMR6158 / FRE2239" active="#struct-205618" type="direct"/>
            <relation active="#struct-300267" type="direct"/>
            <relation active="#struct-322672" type="direct"/>
            <relation name="UMR6158" active="#struct-359750" type="direct"/>
            <relation name="UMR6158" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300302" status="VALID">
          <idno type="IdRef">027787109</idno>
          <idno type="ISNI">0000000120977052</idno>
          <idno type="ROR">https://ror.org/052bz7812</idno>
          <idno type="Wikidata">Q1546437</idno>
          <orgName>Université Paris Dauphine-PSL</orgName>
          <desc>
            <address>
              <addrLine>Place du Maréchal de Lattre de Tassigny75775 PARIS Cedex 16</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://dauphine.psl.eu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-564132" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-564132" status="VALID">
          <idno type="IdRef">241597595</idno>
          <idno type="ISNI">0000 0004 1784 3645</idno>
          <idno type="ROR">https://ror.org/013cjyk83</idno>
          <orgName>Université Paris Sciences et Lettres</orgName>
          <orgName type="acronym">PSL</orgName>
          <desc>
            <address>
              <addrLine>60 rue Mazarine 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.psl.eu/</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="institution" xml:id="struct-205618" status="OLD">
          <orgName>Université Blaise Pascal - Clermont-Ferrand 2</orgName>
          <orgName type="acronym">UBP</orgName>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>34, avenue Carnot - BP 185 / 63006 Clermont-Ferrand cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-bpclermont.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300267" status="OLD">
          <orgName>Université d'Auvergne - Clermont-Ferrand I</orgName>
          <orgName type="acronym">UdA</orgName>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>49, Boulevard François-Mitterrand / CS 60032 / 63001 Clermont-Ferrand Cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-clermont1.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-322672" status="OLD">
          <orgName>SIGMA Clermont</orgName>
          <orgName type="acronym">SIGMA Clermont</orgName>
          <date type="start">2016-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>SIGMA Clermont / Campus des Cézeaux  / CS 20265 / 63178 Aubière Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sigma-clermont.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-359750" status="VALID">
          <idno type="IdRef">028028694</idno>
          <orgName>Ecole Nationale Supérieure des Mines de St Etienne</orgName>
          <orgName type="acronym">ENSM ST-ETIENNE</orgName>
          <date type="start">1816-01-01</date>
          <desc>
            <address>
              <addrLine>158 Cour Fauriel, 42100 Saint-Étienne</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mines-stetienne.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>