<?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-01991656</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-18T21:54:45+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Fine-grained complexity of coloring unit disks and balls</title>
            <author role="aut">
              <persName>
                <forename type="first">Biro</forename>
                <surname>Csaba</surname>
              </persName>
              <idno type="halauthorid">1506065-0</idno>
            </author>
            <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-544673"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dániel</forename>
                <surname>Marx</surname>
              </persName>
              <email type="md5">a899127ff1be2cd2df11d60279698bb0</email>
              <email type="domain">cs.bme.hu</email>
              <idno type="idhal" notation="numeric">857864</idno>
              <idno type="halauthorid" notation="string">378625-857864</idno>
              <affiliation ref="#struct-27611"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Miltzow</forename>
                <surname>Tillmann</surname>
              </persName>
              <idno type="halauthorid">1506066-0</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Paweł</forename>
                <surname>Rzążewski</surname>
              </persName>
              <idno type="halauthorid">1492260-0</idno>
              <affiliation ref="#struct-161255"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Édouard</forename>
                <surname>Bonnet</surname>
              </persName>
              <email type="md5">f0d48d761568aaefbce1ecd0857804c6</email>
              <email type="domain">ens-lyon.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-01-23 23:54:35</date>
              <date type="whenModified">2025-10-13 09:44:15</date>
              <date type="whenReleased">2019-01-24 09:38:34</date>
              <date type="whenProduced">2018</date>
              <date type="whenEndEmbargoed">2019-01-23</date>
              <ref type="file" target="https://hal.science/hal-01991656v1/document">
                <date notBefore="2019-01-23"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01991656v1/file/main.pdf" id="file-1991656-2009766">
                <date notBefore="2019-01-23"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="371550">
                <persName>
                  <forename>Édouard</forename>
                  <surname>Bonnet</surname>
                </persName>
                <email type="md5">f0d48d761568aaefbce1ecd0857804c6</email>
                <email type="domain">ens-lyon.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01991656</idno>
            <idno type="halUri">https://hal.science/hal-01991656</idno>
            <idno type="halBibtex">csaba:hal-01991656</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Computational Geometry&lt;/i&gt;, 2018</idno>
            <idno type="halRef">Journal of Computational Geometry, 2018</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1991656-2009766"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</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="LIP" corresp="UNIV-LYON1">Laboratoire de l'Informatique du Parallélisme</idno>
            <idno type="stamp" n="UDL">UDL</idno>
            <idno type="stamp" n="UNIV-LYON">Université de Lyon</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">Fine-grained complexity of coloring unit disks and balls</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Biro</forename>
                    <surname>Csaba</surname>
                  </persName>
                  <idno type="halauthorid">1506065-0</idno>
                </author>
                <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-544673"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dániel</forename>
                    <surname>Marx</surname>
                  </persName>
                  <email type="md5">a899127ff1be2cd2df11d60279698bb0</email>
                  <email type="domain">cs.bme.hu</email>
                  <idno type="idhal" notation="numeric">857864</idno>
                  <idno type="halauthorid" notation="string">378625-857864</idno>
                  <affiliation ref="#struct-27611"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Miltzow</forename>
                    <surname>Tillmann</surname>
                  </persName>
                  <idno type="halauthorid">1506066-0</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Paweł</forename>
                    <surname>Rzążewski</surname>
                  </persName>
                  <idno type="halauthorid">1492260-0</idno>
                  <affiliation ref="#struct-161255"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">66710</idno>
                <idno type="issn">1920-180X</idno>
                <title level="j">Journal of Computational Geometry</title>
                <imprint>
                  <publisher>Carleton University, Computational Geometry Laboratory</publisher>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</classCode>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</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>On planar graphs, many classic algorithmic problems enjoy a certain ``square rootphenomenon'' and can be solved significantly fasterthan what is known to be possible on general graphs: for example,\textsc{Independent Set}, \textsc{3-Coloring}, \textsc{Hamiltonian  Cycle}, \textsc{Dominating Set} can be solved in time$2^{O(\sqrt{n})}$ on an $n$-vertex planar graph, while no $2^{o(n)}$algorithms exist for general graphs, assuming the Exponential TimeHypothesis (ETH).  The square root in the exponent seems to be bestpossible for planar graphs: assuming the ETH, the running time for theseproblems cannot be improved to $2^{o(\sqrt{n})}$.  In some cases, asimilar speedup can be obtained for 2-dimensional geometric problems,for example, there are $2^{O(\sqrt{n}\log n)}$ time algorithms for\textsc{Independent Set} on unit disk graphs or for \textsc{TSP} on2-dimensional point sets.In this paper, we explore whether such a speedup is possible for geometric coloring problems. On the one hand, geometric objects can behave similarly to planar graphs:  \textsc{3-Coloring} can be solved in time $2^{O(\sqrt{n})}$ on the intersection graph of $n$ disks in the plane and, assuming the ETH, there is no such algorithm with running time $2^{o(\sqrt{n})}$. On the other hand, if the number $\ell$ of colors is part of the input, then no such speedup is possible: Coloring the intersection graph of $n$ unit disks with $\ell$ colors cannot be solved in time $2^{o(n)}$, assuming the ETH. More precisely, we exhibit a smooth increase of complexity as the number $\ell$ of colors increases: If we restrict the number of colors to $\ell=\Theta(n^{\alpha})$ for some $0\le \alpha\le 1$, then the problem of coloring the intersection graph of $n$ disks with $\ell$ colors\begin{itemize}\item can be solved in time $\exp \left( O(n^{\frac{1+\alpha}{2}}\log n) \right)=\exp \left( O(\sqrt{n\ell}\log n) \right)$, and%using a combination of fairly standard techniques, and\item cannot be solved in time $\exp \left ( o(n^{\frac{1+\alpha}{2}})\right )=\exp \left( o(\sqrt{n\ell}) \right)$, even on unit disks, unless the ETH fails.\end{itemize}More generally, we consider the problem of coloring $d$-dimensional balls in the Euclidean space and obtain analogous results showing that the problem \begin{itemize}\item can be solved in time $\exp \left( O(n^{\frac{d-1+\alpha}{d}}\log n) \right)$ $=\exp \left( O(n^{1-1/d}\ell^{1/d}\log n) \right)$, and\item cannot be solved in time $\exp \left(O(n^{\frac{d-1+\alpha}{d}-\epsilon})\right)= \exp \left(O(n^{1-1/d-\epsilon}\ell^{1/d})\right)$ for any $\epsilon&gt;0$, even for unit balls, unless the ETH fails.\end{itemize}Finally, we prove that fatness is crucial to obtain subexponential algorithms for coloring. We show that existence of an algorithm coloring an intersection graph of segments using a constant number of colors in time $2^{o(n)}$ already refutes the ETH.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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="institution" xml:id="struct-27611" status="INCOMING">
          <orgName>Computer and Automation Research Institute [Budapest]</orgName>
          <orgName type="acronym">MTA SZTAKI</orgName>
          <desc>
            <address>
              <country key="HU"/>
            </address>
            <ref type="url">http://www.sztaki.hu/?en</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-161255" status="VALID">
          <orgName>Faculty of Mathematics and Information Science [Warszawa]</orgName>
          <desc>
            <address>
              <addrLine>Warsaw University of Technology, Faculty of Mathematics and Information Science, Pl. Politechniki 1, 00-661 Warszawa, Poland</addrLine>
              <country key="PL"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-235985" type="direct"/>
          </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="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>
        <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-235985" status="VALID">
          <idno type="ROR">https://ror.org/00y0xnp53</idno>
          <orgName>Warsaw University of Technology [Warsaw]</orgName>
          <date type="start">2016-12-01</date>
          <desc>
            <address>
              <addrLine>Pl. Politechniki 1 00-661 Warsaw</addrLine>
              <country key="PL"/>
            </address>
            <ref type="url">http://www.pw.edu.pl/engpw</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>