<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>6875</id>
    <completedYear/>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>114</pageFirst>
    <pageLast>129</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH</publisherName>
    <publisherPlace>Wadern</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-01-25</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Traffic signal optimization using cyclically expanded networks</title>
    <parentTitle language="eng">10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10), September 9, 2010, Liverpool, United Kingdom</parentTitle>
    <identifier type="isbn">978-3-939897-20-0</identifier>
    <enrichment key="UBICOIdent">008066</enrichment>
    <enrichment key="UBICOseries">OASIcs - OpenAccess Seriesin Informatics ; 14</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="old_institute" number="01033">LS Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="1302">FG Algorithmische Mathematik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>7194</id>
    <completedYear/>
    <publishedYear>2011</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>314</pageFirst>
    <pageLast>333</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>FGSV-Verlag</publisherName>
    <publisherPlace>Köln</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-02-07</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Signalanlagenoptimierung mit zyklisch expandierten Netzwerken</title>
    <parentTitle language="deu">Optimierung in Verkehr und Transport, 16./17. 03. 2011, Stuttgart, Tagungsband Heureka '11</parentTitle>
    <identifier type="isbn">978-3-941790-72-8</identifier>
    <enrichment key="UBICOIdent">008453</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>...</firstName>
      <lastName>Administrator</lastName>
    </submitter>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="old_institute" number="01033">LS Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="1302">FG Algorithmische Mathematik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>12128</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1125</pageFirst>
    <pageLast>1134</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>54</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2014-10-18</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Combining Static and Dynamic Models for Traffic Signal Optimization Inherent Load-dependent Travel Times in a Cyclically Time-expanded Network Model</title>
    <parentTitle language="eng">Procedia - Social and Behavioral Science</parentTitle>
    <identifier type="doi">10.1016/j.sbspro.2012.09.827</identifier>
    <identifier type="url">http://www.sciencedirect.com/science/article/pii/S1877042812042899</identifier>
    <identifier type="issn">1877-0428</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </submitter>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="old_institute" number="01033">LS Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="1302">FG Algorithmische Mathematik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>15521</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>244</pageFirst>
    <pageLast>261</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>65</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2016-04-15</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Traffic signal optimization using cyclically expanded networks</title>
    <parentTitle language="eng">Networks</parentTitle>
    <identifier type="doi">10.1002/net.21601</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1302">FG Algorithmische Mathematik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>16834</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>29</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2016-07-25</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Traffic signal optimization: combining static and dynamic models</title>
    <abstract language="eng">In this paper, we present a cyclically time-expanded network model for simultaneous optimization of traffic assignment and traffic signal parameters, in particular offsets, split times, and phase orders. Since travel times are of great importance for developing realistic solutions for traffic assignment and traffic signal coordination in urban road networks, we perform an extensive analysis of the model. We show that a linear time-expanded model can reproduce realistic travel times especially for use with traffic signals and we verify this by simulation. Furthermore, we show how exact mathematical programming techniques can be used for optimizing the control of traffic signals. We provide computational results for real world instances and demonstrate the capabilities of the cyclically time-expanded by simulation results obtained with state-of-the-art traffic simulation tools.</abstract>
    <parentTitle language="eng">arXiv.org</parentTitle>
    <identifier type="url">http://arxiv.org/abs/1509.08709</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>Angelika</firstName>
      <lastName>Breu</lastName>
    </submitter>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Discrete Mathematics</value>
    </subject>
    <collection role="institutes" number="1302">FG Algorithmische Mathematik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>23486</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>23</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>articlenr</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2019-02-05</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Recognizing Graph Search Trees</title>
    <parentTitle language="eng">arXiv.org</parentTitle>
    <identifier type="url">https://arxiv.org/abs/1811.09249v2</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Carolin</firstName>
      <lastName>Denkert</lastName>
    </author>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Matjaž</firstName>
      <lastName>Krnc</lastName>
    </author>
    <author>
      <firstName>Nevena</firstName>
      <lastName>Pivač</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>25565</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>21</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2020-04-09</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the End-Vertex Problem of Graph Searches</title>
    <parentTitle language="eng">Discrete Mathematics &amp; Theoretical Computer Science</parentTitle>
    <identifier type="issn">1365-8050</identifier>
    <identifier type="issn">1462-7264</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Carolin</firstName>
      <lastName>Denkert</lastName>
    </author>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Matjaž</firstName>
      <lastName>Krnc</lastName>
    </author>
    <author>
      <firstName>Nevena</firstName>
      <lastName>Pivač</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1302">FG Algorithmische Mathematik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>26460</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>134</pageFirst>
    <pageLast>147</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject_ref</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2020-12-10</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Edge Elimination and Weighted Graph Classes</title>
    <parentTitle language="eng">Graph-Theoretic Concepts in Computer Science - 46th International                Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020</parentTitle>
    <identifier type="doi">10.1007/978-3-030-60440-0_11</identifier>
    <identifier type="isbn">978-3-030-60439-4</identifier>
    <identifier type="isbn">978-3-030-60440-0</identifier>
    <identifier type="issn">1611-3349</identifier>
    <identifier type="issn">0302-9743</identifier>
    <enrichment key="UBICOseries">Lecture Notes in Computer Science ; 12301</enrichment>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Fprofil">1 Energiewende und Dekarbonisierung / Energy Transition and Decarbonisation</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <editor>
      <firstName>Isolde</firstName>
      <lastName>Adler</lastName>
    </editor>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Nina</firstName>
      <lastName>Chiarelli</lastName>
    </author>
    <editor>
      <firstName>Haiko</firstName>
      <lastName>Müller</lastName>
    </editor>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Matjaž</firstName>
      <lastName>Krnc</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Milanič</lastName>
    </author>
    <author>
      <firstName>Nevena</firstName>
      <lastName>Pivač</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="1307">FG Ingenieurmathematik und Numerik der Optimierung</collection>
  </doc>
  <doc>
    <id>26444</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>13:1</pageFirst>
    <pageLast>13:13</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>173</volume>
    <type>conferenceobject_ref</type>
    <publisherName>Schloss Dagstuhl, Leibnitz Zentrum für Informatik</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2020-12-03</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Linear Time LexDFS on Chordal Graphs</title>
    <parentTitle language="eng">28th Annual European Symposium on Algorithms (ESA) 2020, September 7-9, 2020, Pisa, Italy)</parentTitle>
    <identifier type="urn">urn:nbn:de:0030-drops-128790</identifier>
    <identifier type="doi">10.4230/LIPIcs.ESA.2020.13</identifier>
    <identifier type="url">https://drops.dagstuhl.de/opus/volltexte/2020/12879</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="Fprofil">1 Energiewende und Dekarbonisierung / Energy Transition and Decarbonisation</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="1307">FG Ingenieurmathematik und Numerik der Optimierung</collection>
  </doc>
  <doc>
    <id>26647</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>99</pageFirst>
    <pageLast>110</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject_ref</type>
    <publisherName>Elsevier</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2021-01-06</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Recognizing Graph Search Trees</title>
    <parentTitle language="eng">The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019) 2-7 June 2019, Belo Horizonte, Brazil</parentTitle>
    <identifier type="doi">10.1016/j.entcs.2019.08.010</identifier>
    <identifier type="issn">1571-0661</identifier>
    <enrichment key="UBICOseries">Electronic Notes in Theoretical Computer Science ; 346</enrichment>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <editor>
      <firstName>Gabriel</firstName>
      <lastName>Coutinho</lastName>
    </editor>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Carolin</firstName>
      <lastName>Denkert</lastName>
    </author>
    <editor>
      <firstName>Yoshiharu</firstName>
      <lastName>Kohayakawa</lastName>
    </editor>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <editor>
      <firstName>Vinicius</firstName>
      <lastName>dos Santos</lastName>
    </editor>
    <author>
      <firstName>Matjaž</firstName>
      <lastName>Krnc</lastName>
    </author>
    <editor>
      <firstName>Sebastián</firstName>
      <lastName>Urrutia</lastName>
    </editor>
    <author>
      <firstName>Nevena</firstName>
      <lastName>Pivač</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1302">FG Algorithmische Mathematik</collection>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>26653</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>21</pageFirst>
    <pageLast>41</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>53</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2021-01-06</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Traffic Signal Optimization: Combining Static and Dynamic Models</title>
    <parentTitle language="eng">Transportation Science</parentTitle>
    <identifier type="doi">10.1287/trsc.2017.0760</identifier>
    <identifier type="issn">1526-5447</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>28034</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1418</pageFirst>
    <pageLast>1446</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2</issue>
    <volume>35</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2021-11-30</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Recognition Problem of Graph Search Trees</title>
    <parentTitle language="eng">SIAM Journal on Discrete Mathematics</parentTitle>
    <identifier type="doi">10.1137/20M1313301</identifier>
    <identifier type="issn">1095-7146</identifier>
    <identifier type="issn">0895-4801</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="Fprofil">1 Energiewende und Dekarbonisierung / Energy Transition and Decarbonisation</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Carolin</firstName>
      <lastName>Denkert</lastName>
    </author>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Matjaž</firstName>
      <lastName>Krnc</lastName>
    </author>
    <author>
      <firstName>Nevena</firstName>
      <lastName>Pivač</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>31463</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1:1</pageFirst>
    <pageLast>1:14</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>OASIcs - Open Access Series in Informatics; Band 115</volume>
    <type>conferenceobject_ref</type>
    <publisherName>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</publisherName>
    <publisherPlace>Dagstuhl</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-10-19</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal Bicycle Routes with Few Signal Stops</title>
    <parentTitle language="eng">23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)</parentTitle>
    <identifier type="issn">978-3-95977-302-7</identifier>
    <identifier type="doi">10.4230/OASIcs.ATMOS.2023.1</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Publikationsweg">Open Access</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="Fprofil">1 Energiewende und Dekarbonisierung / Energy Transition and Decarbonisation</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Markus</firstName>
      <lastName>Rogge</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>34476</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>22:1</pageFirst>
    <pageLast>22:18</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject_ref</type>
    <publisherName>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</publisherName>
    <publisherPlace>Dagstuhl</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-11-08</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Graph search trees and the intermezzo problem</title>
    <parentTitle language="eng">49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)</parentTitle>
    <identifier type="isbn">978-3-95977-335-5</identifier>
    <identifier type="doi">10.4230/LIPICS.MFCS.2024.22</identifier>
    <enrichment key="UBICOseries">LIPIcs - Leibniz International Proceedings in Informatics; Band 306</enrichment>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="Publikationsweg">Open Access</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Fprofil">1 Energiewende und Dekarbonisierung / Energy Transition and Decarbonisation</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <editor>
      <firstName>Rastislav</firstName>
      <lastName>Královič</lastName>
    </editor>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <editor>
      <firstName>Antonín</firstName>
      <lastName>Kučera</lastName>
    </editor>
    <author>
      <firstName>Fabienne</firstName>
      <lastName>Ratajczak</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
  </doc>
  <doc>
    <id>31466</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2454</pageFirst>
    <pageLast>2481</pageLast>
    <pageNumber/>
    <edition/>
    <issue>8</issue>
    <volume>85</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-10-19</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Certifying fully dynamic algorithms for recognition and Hamiltonicity of Threshold and Chain Graphs</title>
    <parentTitle language="eng">Algorithmica</parentTitle>
    <identifier type="issn">0178-4617</identifier>
    <identifier type="doi">10.1007/s00453-023-01107-1</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Fprofil">1 Energiewende und Dekarbonisierung / Energy Transition and Decarbonisation</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <submitter>
      <firstName>Diana</firstName>
      <lastName>Hübner</lastName>
    </submitter>
    <author>
      <firstName>Ekkehard</firstName>
      <lastName>Köhler</lastName>
    </author>
    <author>
      <firstName>Robert</firstName>
      <lastName>Scheffler</lastName>
    </author>
    <author>
      <firstName>Martin</firstName>
      <lastName>Strehler</lastName>
    </author>
    <collection role="institutes" number="1304">FG Diskrete Mathematik und Grundlagen der Informatik</collection>
    <collection role="institutes" number="7006">Energie-Innovationszentrum / Scientific Computing Lab</collection>
  </doc>
</export-example>
