<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5048</id>
    <completedYear/>
    <publishedYear>2002</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>209</pageFirst>
    <pageLast>223</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Berlin [u.a.]</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-11</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the power of BFS to determine a graphs diameter</title>
    <parentTitle language="eng">LATIN 2002, theoretical informatics, proceedings, 5th Latin American Symposium, Cancun, Mexico, April 3 - 6, 2002</parentTitle>
    <identifier type="isbn">3-540-43400-3</identifier>
    <enrichment key="UBICOIdent">005878</enrichment>
    <enrichment key="UBICOseries">Lecture notes in computer science ; 2286</enrichment>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <editor>
      <firstName>Sergio</firstName>
      <lastName>Rajsbaum</lastName>
    </editor>
    <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>5049</id>
    <completedYear/>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>151</pageFirst>
    <pageLast>162</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Berlin [u.a.]</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-11</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Collective tree 1-spanners for interval graphs</title>
    <parentTitle language="eng">Graph theoretic concepts in computer science, 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005</parentTitle>
    <identifier type="isbn">3-540-31000-2</identifier>
    <identifier type="isbn">978-3-540-31000-6</identifier>
    <enrichment key="UBICOIdent">005879</enrichment>
    <enrichment key="UBICOseries">Lecture notes in computer science ; 3787</enrichment>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <editor>
      <firstName>Dieter</firstName>
      <lastName>Kratsch</lastName>
    </editor>
    <author>
      <firstName>Feodor F.</firstName>
      <lastName>Dragan</lastName>
    </author>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Chenyu</firstName>
      <lastName>Yan</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>5104</id>
    <completedYear/>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-14</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Linear Orderings of Subfamilies of AT-Free Graphs</title>
    <enrichment key="UBICOIdent">005946</enrichment>
    <enrichment key="UBICOquelle">SIAM Journal on Discrete Mathematics 20(2006)1, S. 105-118, 0895-4801</enrichment>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Stephan</firstName>
      <lastName>Olariu</lastName>
    </author>
    <author>
      <firstName>Lorna</firstName>
      <lastName>Stewart</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>5240</id>
    <completedYear/>
    <publishedYear>2001</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-15</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On subfamilies of AT-free graphs</title>
    <enrichment key="UBICOIdent">006093</enrichment>
    <enrichment key="UBICOquelle">Graph-Theoretic Concepts in Computer Science / 27th International Workshop, WG 2001 Boltenhagen, Germany. - Berlin : Springer, 2001, S. 241-253, 978-3-540-42707-0 (Lecture notes in computer science ; 2204)</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</lastName>
    </author>
    <author>
      <firstName>Stephan</firstName>
      <lastName>Olariu</lastName>
    </author>
    <author>
      <firstName>Lorna</firstName>
      <lastName>Stewart</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>5475</id>
    <completedYear/>
    <publishedYear>2004</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-21</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Hereditary dominating pair graphs</title>
    <enrichment key="UBICOIdent">006333</enrichment>
    <enrichment key="UBICOquelle">Discrete Applied Mathematics 134(2004)1-3, S. 239-261, 0166-218X</enrichment>
    <author>
      <firstName>Natasha</firstName>
      <lastName>Przulj</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</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>6268</id>
    <completedYear/>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-04-13</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the power of BFS to determine a graph's diameter</title>
    <enrichment key="UBICOIdent">007207</enrichment>
    <enrichment key="UBICOquelle">Networks 42 (2003)4, S. 209-223, 2190-5428</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</lastName>
    </author>
    <author>
      <firstName>Feodor F.</firstName>
      <lastName>Dragan</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>14800</id>
    <completedYear/>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>434</pageFirst>
    <pageLast>443</pageLast>
    <pageNumber/>
    <edition/>
    <issue>5</issue>
    <volume>158</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2015-12-22</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On end-vertices of Lexicographic Breadth First Searches</title>
    <parentTitle language="eng">Discrete Applied Mathematics</parentTitle>
    <identifier type="doi">10.1016/j.dam.2009.10.001</identifier>
    <identifier type="issn">0166-218X</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Jean-Marc</firstName>
      <lastName>Lanlignel</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>14782</id>
    <completedYear/>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>110</pageFirst>
    <pageLast>121</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Berlin [u.a.]</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2015-12-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Additive Spanners for Circle Graphs and Polygonal Graphs</title>
    <parentTitle language="eng">Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008</parentTitle>
    <identifier type="doi">10.1007/978-3-540-92248-3_11</identifier>
    <identifier type="isbn">978-3-540-92247-6</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="UBICOseries">Lecture Notes in Computer Science ; 5344</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>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>15356</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>569</pageFirst>
    <pageLast>591</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>30</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2016-04-08</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the Power of Graph Searching for Cocomparability Graphs</title>
    <parentTitle language="eng">SIAM Journal on Discrete Mathematics (SIDMA)</parentTitle>
    <identifier type="doi">10.1137/15M1012396</identifier>
    <identifier type="issn">1095-7146</identifier>
    <identifier type="issn">0895-4801</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Derek G.</firstName>
      <lastName>Corneil</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Jérémie</firstName>
      <lastName>Dusart</lastName>
    </author>
    <author>
      <firstName>Michel</firstName>
      <lastName>Habib</lastName>
    </author>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
</export-example>
