<?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-01215976</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-03T09:02:46+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Exact and approximation algorithms for DENSEST k-SUBGRAPH</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>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Aristotelis</forename>
                <surname>Giannakos</surname>
              </persName>
              <email type="md5">5fdbcf8bff0296dafab7b7363c0228bf</email>
              <email type="domain">u-picardie.fr</email>
              <idno type="idhal" notation="numeric">947024</idno>
              <idno type="halauthorid" notation="string">184032-947024</idno>
              <idno type="IDREF">https://www.idref.fr/193460564</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/CRJ-5591-2022</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Giorgio</forename>
                <surname>Lucarelli</surname>
              </persName>
              <email type="md5">7c9a3bb1322aefec65b396cd06fd5138</email>
              <email type="domain">univ-lorraine.fr</email>
              <idno type="idhal" notation="string">lucarelli-giorgio</idno>
              <idno type="idhal" notation="numeric">5944</idno>
              <idno type="halauthorid" notation="string">5237-5944</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-7368-355X</idno>
              <idno type="IDREF">https://www.idref.fr/223391255</idno>
              <affiliation ref="#struct-406454"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ioannis</forename>
                <surname>Milis</surname>
              </persName>
              <idno type="halauthorid">145110-0</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vangelis Th.</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">931175-946990</idno>
              <idno type="IDREF">https://www.idref.fr/069701873</idno>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Lip6</forename>
                <surname>Publications</surname>
              </persName>
              <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-10-15 13:36:02</date>
              <date type="whenModified">2024-06-19 17:09:43</date>
              <date type="whenReleased">2015-10-15 13:36:02</date>
              <date type="whenProduced">2013-02</date>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-00874586/file/cahier_324.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="196566">
                <persName>
                  <forename>Lip6</forename>
                  <surname>Publications</surname>
                </persName>
                <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01215976</idno>
            <idno type="halUri">https://hal.science/hal-01215976</idno>
            <idno type="halBibtex">bourgeois:hal-01215976</idno>
            <idno type="halRefHtml">&lt;i&gt;7th International Workshop on Algorithms and Computation (WALCOM 2013)&lt;/i&gt;, Feb 2013, Kharagpur, India. pp.114-125, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-36065-7_12"&gt;&amp;#x27E8;10.1007/978-3-642-36065-7_12&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">7th International Workshop on Algorithms and Computation (WALCOM 2013), Feb 2013, Kharagpur, India. pp.114-125, &amp;#x27E8;10.1007/978-3-642-36065-7_12&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</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">Exact and approximation algorithms for DENSEST k-SUBGRAPH</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>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Aristotelis</forename>
                    <surname>Giannakos</surname>
                  </persName>
                  <email type="md5">5fdbcf8bff0296dafab7b7363c0228bf</email>
                  <email type="domain">u-picardie.fr</email>
                  <idno type="idhal" notation="numeric">947024</idno>
                  <idno type="halauthorid" notation="string">184032-947024</idno>
                  <idno type="IDREF">https://www.idref.fr/193460564</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/CRJ-5591-2022</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Giorgio</forename>
                    <surname>Lucarelli</surname>
                  </persName>
                  <email type="md5">7c9a3bb1322aefec65b396cd06fd5138</email>
                  <email type="domain">univ-lorraine.fr</email>
                  <idno type="idhal" notation="string">lucarelli-giorgio</idno>
                  <idno type="idhal" notation="numeric">5944</idno>
                  <idno type="halauthorid" notation="string">5237-5944</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-7368-355X</idno>
                  <idno type="IDREF">https://www.idref.fr/223391255</idno>
                  <affiliation ref="#struct-406454"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ioannis</forename>
                    <surname>Milis</surname>
                  </persName>
                  <idno type="halauthorid">145110-0</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vangelis Th.</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">931175-946990</idno>
                  <idno type="IDREF">https://www.idref.fr/069701873</idno>
                </author>
              </analytic>
              <monogr>
                <title level="m">7th International Workshop on Algorithms and Computation (WALCOM 2013)</title>
                <meeting>
                  <title>7th International Workshop on Algorithms and Computation (WALCOM 2013)</title>
                  <date type="start">2013-02</date>
                  <settlement>Kharagpur</settlement>
                  <country key="IN">India</country>
                </meeting>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">7748</biblScope>
                  <biblScope unit="pp">114-125</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-36065-7_12</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <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 DENSEST k-SUBGRAPH problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of k-SUBGRAPH improving the trivial exponential time complexity of $O^\ast(2^n)$ and using polynomial space. Two FPT algorithms are also proposed; the first considers as parameter the treewidth of the input graph and uses exponential space, while the second is parameterized by the size of the minimum vertex cover and uses polynomial space. Finally, we propose several approximation algorithms running in moderately exponential or parameterized time.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-406454" status="OLD">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</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>