<?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-01509536</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-25T02:32:07+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="fr">Algorithms for dominating clique problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Nicolas</forename>
                <surname>Bourgeois</surname>
              </persName>
              <email type="md5">21e4d617af9ac31620cd100853460be2</email>
              <email type="domain">phare.normalesup.org</email>
              <idno type="idhal" notation="string">nbourgeo</idno>
              <idno type="idhal" notation="numeric">751739</idno>
              <idno type="halauthorid" notation="string">253771-751739</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5404-1260</idno>
              <idno type="IDREF">https://www.idref.fr/149555059</idno>
              <affiliation ref="#struct-989"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Federico</forename>
                <surname>Della Croce</surname>
              </persName>
              <idno type="idhal" notation="numeric">755530</idno>
              <idno type="halauthorid" notation="string">103386-755530</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2897-183X</idno>
              <idno type="IDREF">https://www.idref.fr/241416590</idno>
              <affiliation ref="#struct-6571"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Bruno</forename>
                <surname>Escoffier</surname>
              </persName>
              <email type="md5">45ad6b7432df4bb0628803bf27a7e2e3</email>
              <email type="domain">upmc.fr</email>
              <idno type="idhal" notation="string">brunoescoffier</idno>
              <idno type="idhal" notation="numeric">5124</idno>
              <idno type="halauthorid" notation="string">24013-5124</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6477-8706</idno>
              <idno type="IDREF">https://www.idref.fr/067352421</idno>
              <idno type="ISNI">http://isni.org/isni/0000000358818668</idno>
              <idno type="VIAF">https://viaf.org/viaf/211089377</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/CPG-4773-2022</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/CPG-4773-2022</idno>
              <affiliation ref="#struct-989"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vangelis</forename>
                <surname>Paschos</surname>
              </persName>
              <email type="md5">9642e5a3c2aa6fcc937da220c69cfb6e</email>
              <email type="domain">lamsade.dauphine.fr</email>
              <idno type="idhal" notation="numeric">946990</idno>
              <idno type="halauthorid" notation="string">100861-946990</idno>
              <idno type="IDREF">https://www.idref.fr/069701873</idno>
              <affiliation ref="#struct-989"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Paris Dauphine-PSL</forename>
                <surname>Administrateur</surname>
              </persName>
              <email type="md5">96236028a9bc00deae119f59d00ad1fd</email>
              <email type="domain">dauphine.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-04-18 10:19:26</date>
              <date type="whenModified">2025-06-13 11:38:14</date>
              <date type="whenReleased">2017-04-18 10:19:26</date>
              <date type="whenProduced">2012</date>
              <ref type="externalLink" target="https://doi.org/10.1016/j.tcs.2012.07.016"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1291823">
                <persName>
                  <forename>Paris Dauphine-PSL</forename>
                  <surname>Administrateur</surname>
                </persName>
                <email type="md5">96236028a9bc00deae119f59d00ad1fd</email>
                <email type="domain">dauphine.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01509536</idno>
            <idno type="halUri">https://hal.science/hal-01509536</idno>
            <idno type="halBibtex">bourgeois:hal-01509536</idno>
            <idno type="halRefHtml">&lt;i&gt;Theoretical Computer Science&lt;/i&gt;, 2012, 459 (9), &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.tcs.2012.07.016"&gt;&amp;#x27E8;10.1016/j.tcs.2012.07.016&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Theoretical Computer Science, 2012, 459 (9), &amp;#x27E8;10.1016/j.tcs.2012.07.016&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-DAUPHINE">Université Paris Dauphine - Paris IX</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>
          </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="fr">Algorithms for dominating clique problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Nicolas</forename>
                    <surname>Bourgeois</surname>
                  </persName>
                  <email type="md5">21e4d617af9ac31620cd100853460be2</email>
                  <email type="domain">phare.normalesup.org</email>
                  <idno type="idhal" notation="string">nbourgeo</idno>
                  <idno type="idhal" notation="numeric">751739</idno>
                  <idno type="halauthorid" notation="string">253771-751739</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5404-1260</idno>
                  <idno type="IDREF">https://www.idref.fr/149555059</idno>
                  <affiliation ref="#struct-989"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Federico</forename>
                    <surname>Della Croce</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">755530</idno>
                  <idno type="halauthorid" notation="string">103386-755530</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2897-183X</idno>
                  <idno type="IDREF">https://www.idref.fr/241416590</idno>
                  <affiliation ref="#struct-6571"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Bruno</forename>
                    <surname>Escoffier</surname>
                  </persName>
                  <email type="md5">45ad6b7432df4bb0628803bf27a7e2e3</email>
                  <email type="domain">upmc.fr</email>
                  <idno type="idhal" notation="string">brunoescoffier</idno>
                  <idno type="idhal" notation="numeric">5124</idno>
                  <idno type="halauthorid" notation="string">24013-5124</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6477-8706</idno>
                  <idno type="IDREF">https://www.idref.fr/067352421</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000358818668</idno>
                  <idno type="VIAF">https://viaf.org/viaf/211089377</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/CPG-4773-2022</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/CPG-4773-2022</idno>
                  <affiliation ref="#struct-989"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vangelis</forename>
                    <surname>Paschos</surname>
                  </persName>
                  <email type="md5">9642e5a3c2aa6fcc937da220c69cfb6e</email>
                  <email type="domain">lamsade.dauphine.fr</email>
                  <idno type="idhal" notation="numeric">946990</idno>
                  <idno type="halauthorid" notation="string">100861-946990</idno>
                  <idno type="IDREF">https://www.idref.fr/069701873</idno>
                  <affiliation ref="#struct-989"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">19594</idno>
                <idno type="issn">0304-3975</idno>
                <idno type="eissn">1879-2294</idno>
                <title level="j">Theoretical Computer Science</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">459</biblScope>
                  <biblScope unit="issue">9</biblScope>
                  <date type="datePub">2012</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.tcs.2012.07.016</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">Dominating clique</term>
                <term xml:lang="fr">Exponential time algorithms</term>
                <term xml:lang="fr">Exact and approximation algorithms</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 handle in this paper three dominating clique problems, namely, the decision problem to detect whether a graph has a dominating clique and two optimization versions asking to compute a maximum- and a minimum-size dominating clique of a graph G, if G has a dominating clique. For the three problems we propose exact moderately exponential algorithms with worst-case running time upper bounds improving those by Kratsch and Liedloff [D. Kratsch, M. Liedloff, An exact algorithm for the minimum dominating clique problem, Theoret. Comput. Sci. 385 (1–3) (2007) 226–240]. We then study the three problems in sparse and dense graphs also providing improved running time upper bounds. Finally, we propose some exponential time approximation algorithms for the optimization versions.</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-6571" status="VALID">
          <idno type="IdRef">034390626</idno>
          <idno type="ISNI">0000000419370343</idno>
          <idno type="ROR">https://ror.org/00bgk9508</idno>
          <orgName>Politecnico di Torino = Polytechnic of Turin</orgName>
          <orgName type="acronym">Polito</orgName>
          <date type="start">1859-01-01</date>
          <desc>
            <address>
              <addrLine>Politecnico di Torino - Corso Duca degli Abruzzi, 24 10129 Torino</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.polito.it/</ref>
          </desc>
        </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>
      </listOrg>
    </back>
  </text>
</TEI>