<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5025</id>
    <completedYear/>
    <publishedYear>2000</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1662</pageFirst>
    <pageLast>1677</pageLast>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>30</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs</title>
    <parentTitle language="eng">SIAM journal on computing</parentTitle>
    <identifier type="issn">0097-5397</identifier>
    <enrichment key="UBICOIdent">005849</enrichment>
    <author>
      <firstName>Andreas</firstName>
      <lastName>Brandstädt</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Feodor F.</firstName>
      <lastName>Dragan</lastName>
    </author>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <collection role="old_institute" number="01033">LS Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>14784</id>
    <completedYear/>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>884</pageFirst>
    <pageLast>905</pageLast>
    <pageNumber/>
    <edition/>
    <issue>4</issue>
    <volume>69</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2015-12-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs</title>
    <parentTitle language="eng">Algorithmica</parentTitle>
    <identifier type="doi">10.1007/s00453-013-9765-4</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Feodor F.</firstName>
      <lastName>Dragan</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <collection role="old_institute" number="01033">LS Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>14786</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1717</pageFirst>
    <pageLast>1729</pageLast>
    <pageNumber/>
    <edition/>
    <issue>12</issue>
    <volume>160</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2015-12-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Collective additive tree spanners for circle graphs and polygonal graphs</title>
    <parentTitle language="eng">Discrete Applied Mathematics</parentTitle>
    <identifier type="doi">10.1016/j.dam.2012.03.036</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Feodor F.</firstName>
      <lastName>Dragan</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</lastName>
    </author>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Yang</firstName>
      <lastName>Xiang</lastName>
    </author>
    <collection role="old_institute" number="01033">LS Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>19759</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>686</pageFirst>
    <pageLast>713</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>77</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2017-04-03</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Line-distortion, Bandwidth and Path-length of a graph</title>
    <parentTitle language="eng">Algorithmica</parentTitle>
    <identifier type="doi">10.1007/s00453-015-0094-7</identifier>
    <identifier type="issn">0178-4617</identifier>
    <identifier type="issn">1432-0541</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Feodor F.</firstName>
      <lastName>Dragan</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Arne</firstName>
      <lastName>Leitert</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>21723</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>142</pageFirst>
    <pageLast>156</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>232</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2018-04-09</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Eccentricity approximating trees</title>
    <parentTitle language="eng">Discrete Applied Mathematics</parentTitle>
    <identifier type="doi">10.1016/j.dam.2017.07.017</identifier>
    <identifier type="issn">0166-218X</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Feodor F.</firstName>
      <lastName>Dragan</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Hend</firstName>
      <lastName>Alrasheed</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
</export-example>
