<?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-01185262</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-24T16:46:26+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Solving VLSI Design and DNA Sequencing Problems using Bipartization of Graphs</title>
            <author role="aut">
              <persName>
                <forename type="first">Pierre</forename>
                <surname>Fouilhoux</surname>
              </persName>
              <email type="md5">496948afd72f743eff9c60e5a89bb297</email>
              <email type="domain">lipn.fr</email>
              <idno type="idhal" notation="string">pierre-fouilhoux</idno>
              <idno type="idhal" notation="numeric">9233</idno>
              <idno type="halauthorid" notation="string">27294-9233</idno>
              <idno type="IDREF">https://www.idref.fr/084726873</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4746-5783</idno>
              <affiliation ref="#struct-406454"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">A. Ridha</forename>
                <surname>Mahjoub</surname>
              </persName>
              <idno type="halauthorid">931271-0</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-08-19 16:12:27</date>
              <date type="whenModified">2023-04-11 15:16:28</date>
              <date type="whenReleased">2015-08-19 16:12:27</date>
              <date type="whenProduced">2012-03</date>
              <ref type="externalLink" target="https://api.istex.fr/ark:/67375/VQC-DXC5V3TQ-V/fulltext.pdf?sid=hal"/>
            </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-01185262</idno>
            <idno type="halUri">https://hal.science/hal-01185262</idno>
            <idno type="halBibtex">fouilhoux:hal-01185262</idno>
            <idno type="halRefHtml">&lt;i&gt;Computational Optimization and Applications&lt;/i&gt;, 2012, 51 (2), pp.749-781. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s10589-010-9355-1"&gt;&amp;#x27E8;10.1007/s10589-010-9355-1&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Computational Optimization and Applications, 2012, 51 (2), pp.749-781. &amp;#x27E8;10.1007/s10589-010-9355-1&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="ALLIANCE-SU"> Alliance Sorbonne Université</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">Solving VLSI Design and DNA Sequencing Problems using Bipartization of Graphs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Pierre</forename>
                    <surname>Fouilhoux</surname>
                  </persName>
                  <email type="md5">496948afd72f743eff9c60e5a89bb297</email>
                  <email type="domain">lipn.fr</email>
                  <idno type="idhal" notation="string">pierre-fouilhoux</idno>
                  <idno type="idhal" notation="numeric">9233</idno>
                  <idno type="halauthorid" notation="string">27294-9233</idno>
                  <idno type="IDREF">https://www.idref.fr/084726873</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4746-5783</idno>
                  <affiliation ref="#struct-406454"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">A. Ridha</forename>
                    <surname>Mahjoub</surname>
                  </persName>
                  <idno type="halauthorid">931271-0</idno>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">12008</idno>
                <idno type="issn">0926-6003</idno>
                <idno type="eissn">1573-2894</idno>
                <title level="j">Computational Optimization and Applications</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">51</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">749-781</biblScope>
                  <date type="datePub">2012-03</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/s10589-010-9355-1</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="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>In this paper we consider the 2-layer constrained via minimization problem and the SNP haplotype assembly problem. The former problem arises in the design of integrated and printed circuit boards, and the latter comes up in the DNA sequencing process for diploid organisms. We show that, for any maximum junction degree, the problem can be reduced to the maximum bipartite induced subgraph problem. Moreover we show that the SNP haplotype assembly problem can also be reduced to the maximum bipartite induced subgraph problem for the so-called minimum error correction criterion. We give a partial characterization of the bipartite induced subgraph polytope. Using this, we devise a branch-and-cut algorithm and report some experimental results. This algorithm has been used to solve real and large instances.</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>