<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5019</id>
    <completedYear/>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Fast Point-to-Point Shortest Path Computations with Arc-Flags</title>
    <enrichment key="UBICOIdent">005842</enrichment>
    <enrichment key="UBICOquelle">Demetrescu, Camil (Hrsg.): The shortest path problem. -  Providence, R.I : American Mathematical Society, 2009, S. 41 - 72, 978-0-8218-4383-3 (DIMACS Series in discrete mathematics and theoretical computer science ; 74)</enrichment>
    <author>
      <firstName>Moritz</firstName>
      <lastName>Hilger</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Rolf H.</firstName>
      <lastName>Möhring</lastName>
    </author>
    <author>
      <firstName>Heiko</firstName>
      <lastName>Schilling</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>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>5032</id>
    <completedYear/>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-11</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Length-bounded cuts and flows</title>
    <enrichment key="UBICOIdent">005861</enrichment>
    <enrichment key="UBICOquelle">Bugliesi, Michele (Hrsg.): Automata, Languages and Programming. - Berlin : Springer, 2006, S. 679 - 690, 978-3-540-35905-0 (Lecture notes in computer science ; 4051)</enrichment>
    <author>
      <firstName>Georg</firstName>
      <lastName>Baier</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Thomas</firstName>
      <lastName>Erlebach</lastName>
    </author>
    <author>
      <firstName>Alexander</firstName>
      <lastName>Hall</lastName>
    </author>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Heiko</firstName>
      <lastName>Schilling</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Skutella</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>5047</id>
    <completedYear/>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-11</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The k-Splittable Flow Problem</title>
    <enrichment key="UBICOIdent">005877</enrichment>
    <enrichment key="UBICOquelle">Algorithmica 42(2005) 3/4, S. 231-248, 0178-4617</enrichment>
    <author>
      <firstName>Georg</firstName>
      <lastName>Baier</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Skutella</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>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>5016</id>
    <completedYear/>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimization of signalized traffic networks</title>
    <enrichment key="UBICOIdent">005839</enrichment>
    <enrichment key="UBICOquelle">Jäger, Willi (Hrsg.): Mathematics - key technology for the future. - Berlin : Springer, 2008, S. 179 - 188, 978-3-540-77202-6</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Rolf H.</firstName>
      <lastName>Möhring</lastName>
    </author>
    <author>
      <firstName>K.</firstName>
      <lastName>Nökel</lastName>
    </author>
    <author>
      <firstName>Gregor</firstName>
      <lastName>Wünsch</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>5017</id>
    <completedYear/>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Traffic networks and flows over time</title>
    <enrichment key="UBICOIdent">005840</enrichment>
    <enrichment key="UBICOquelle">Lerner, Jürgen (Hrsg.): Algorithmics of large and complex networks. - Berlin : Springer, 2009, S. 166 -196, 978-3-642-02093-3 (Lecture notes in computer science ; 5515)</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Rolf H.</firstName>
      <lastName>Möhring</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Skutella</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>5018</id>
    <completedYear/>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Approximating earliest arrival flows with flow-dependent transit times</title>
    <enrichment key="UBICOIdent">005841</enrichment>
    <enrichment key="UBICOquelle">Discrete Applied Mathematics 155(2007)2, S. 161 - 171, 0166-218x</enrichment>
    <author>
      <firstName>Nadine</firstName>
      <lastName>Baumann</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</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>5083</id>
    <completedYear/>
    <publishedYear>2004</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-02-14</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Approximating earliest arrival flows with flow-dependent transit times</title>
    <enrichment key="UBICOIdent">005924</enrichment>
    <enrichment key="UBICOquelle">Fiala, Jiri (Hrsg.): 29. Mathematical foundations of computer science. - Berlin : Springer, 2004, S. 599 - 690, 3-540-22823-3 (Lecture notes in computer science ; 3153)</enrichment>
    <author>
      <firstName>Nadine</firstName>
      <lastName>Baumann</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</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>
</export-example>
