@inproceedings{KoehlerStrehler, author = {K{\"o}hler, Ekkehard and Strehler, Martin}, title = {Traffic signal optimization using cyclically expanded networks}, series = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10), September 9, 2010, Liverpool, United Kingdom}, booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10), September 9, 2010, Liverpool, United Kingdom}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik GmbH}, address = {Wadern}, isbn = {978-3-939897-20-0}, pages = {114 -- 129}, language = {en} } @inproceedings{KoehlerStrehler, author = {K{\"o}hler, Ekkehard and Strehler, Martin}, title = {Signalanlagenoptimierung mit zyklisch expandierten Netzwerken}, series = {Optimierung in Verkehr und Transport, 16./17. 03. 2011, Stuttgart, Tagungsband Heureka '11}, booktitle = {Optimierung in Verkehr und Transport, 16./17. 03. 2011, Stuttgart, Tagungsband Heureka '11}, publisher = {FGSV-Verlag}, address = {K{\"o}ln}, isbn = {978-3-941790-72-8}, pages = {314 -- 333}, language = {de} } @misc{KoehlerStrehler, author = {K{\"o}hler, Ekkehard and Strehler, Martin}, title = {Combining Static and Dynamic Models for Traffic Signal Optimization Inherent Load-dependent Travel Times in a Cyclically Time-expanded Network Model}, series = {Procedia - Social and Behavioral Science}, volume = {54}, journal = {Procedia - Social and Behavioral Science}, issn = {1877-0428}, doi = {10.1016/j.sbspro.2012.09.827}, pages = {1125 -- 1134}, language = {en} } @misc{KoehlerStrehler, author = {K{\"o}hler, Ekkehard and Strehler, Martin}, title = {Traffic signal optimization using cyclically expanded networks}, series = {Networks}, volume = {65}, journal = {Networks}, number = {3}, doi = {10.1002/net.21601}, pages = {244 -- 261}, language = {en} } @misc{KoehlerStrehler, author = {K{\"o}hler, Ekkehard and Strehler, Martin}, title = {Traffic signal optimization: combining static and dynamic models}, series = {arXiv.org}, journal = {arXiv.org}, pages = {29}, abstract = {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.}, language = {en} } @misc{BeisegelDenkertKoehleretal., author = {Beisegel, Jesse and Denkert, Carolin and K{\"o}hler, Ekkehard and Krnc, Matjaž and Pivač, Nevena and Scheffler, Robert and Strehler, Martin}, title = {Recognizing Graph Search Trees}, series = {arXiv.org}, journal = {arXiv.org}, pages = {23}, language = {en} } @misc{BeisegelDenkertKoehleretal., author = {Beisegel, Jesse and Denkert, Carolin and K{\"o}hler, Ekkehard and Krnc, Matjaž and Pivač, Nevena and Scheffler, Robert and Strehler, Martin}, title = {On the End-Vertex Problem of Graph Searches}, series = {Discrete Mathematics \& Theoretical Computer Science}, volume = {21}, journal = {Discrete Mathematics \& Theoretical Computer Science}, number = {1}, issn = {1365-8050}, language = {en} } @misc{BeisegelChiarelliKoehleretal., author = {Beisegel, Jesse and Chiarelli, Nina and K{\"o}hler, Ekkehard and Krnc, Matjaž and Milanič, Martin and Pivač, Nevena and Scheffler, Robert and Strehler, Martin}, title = {Edge Elimination and Weighted Graph Classes}, series = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020}, journal = {Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020}, editor = {Adler, Isolde and M{\"u}ller, Haiko}, publisher = {Springer}, address = {Cham}, isbn = {978-3-030-60439-4}, issn = {1611-3349}, doi = {10.1007/978-3-030-60440-0_11}, pages = {134 -- 147}, language = {en} } @misc{BeisegelKoehlerScheffleretal., author = {Beisegel, Jesse and K{\"o}hler, Ekkehard and Scheffler, Robert and Strehler, Martin}, title = {Linear Time LexDFS on Chordal Graphs}, series = {28th Annual European Symposium on Algorithms (ESA) 2020, September 7-9, 2020, Pisa, Italy)}, volume = {173}, journal = {28th Annual European Symposium on Algorithms (ESA) 2020, September 7-9, 2020, Pisa, Italy)}, publisher = {Schloss Dagstuhl, Leibnitz Zentrum f{\"u}r Informatik}, doi = {10.4230/LIPIcs.ESA.2020.13}, url = {http://nbn-resolving.de/urn:nbn:de:0030-drops-128790}, pages = {13:1 -- 13:13}, language = {en} } @misc{BeisegelDenkertKoehleretal., author = {Beisegel, Jesse and Denkert, Carolin and K{\"o}hler, Ekkehard and Krnc, Matjaž and Pivač, Nevena and Scheffler, Robert and Strehler, Martin}, title = {Recognizing Graph Search Trees}, series = {The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019) 2-7 June 2019, Belo Horizonte, Brazil}, journal = {The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019) 2-7 June 2019, Belo Horizonte, Brazil}, editor = {Coutinho, Gabriel and Kohayakawa, Yoshiharu and dos Santos, Vinicius and Urrutia, Sebasti{\´a}n}, publisher = {Elsevier}, issn = {1571-0661}, doi = {10.1016/j.entcs.2019.08.010}, pages = {99 -- 110}, language = {en} } @misc{KoehlerStrehler, author = {K{\"o}hler, Ekkehard and Strehler, Martin}, title = {Traffic Signal Optimization: Combining Static and Dynamic Models}, series = {Transportation Science}, volume = {53}, journal = {Transportation Science}, number = {1}, issn = {1526-5447}, doi = {10.1287/trsc.2017.0760}, pages = {21 -- 41}, language = {en} } @misc{BeisegelDenkertKoehleretal., author = {Beisegel, Jesse and Denkert, Carolin and K{\"o}hler, Ekkehard and Krnc, Matjaž and Pivač, Nevena and Scheffler, Robert and Strehler, Martin}, title = {The Recognition Problem of Graph Search Trees}, series = {SIAM Journal on Discrete Mathematics}, volume = {35}, journal = {SIAM Journal on Discrete Mathematics}, number = {2}, issn = {1095-7146}, doi = {10.1137/20M1313301}, pages = {1418 -- 1446}, language = {en} } @misc{KoehlerRoggeScheffleretal., author = {K{\"o}hler, Ekkehard and Rogge, Markus and Scheffler, Robert and Strehler, Martin}, title = {Optimal Bicycle Routes with Few Signal Stops}, series = {23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)}, volume = {OASIcs - Open Access Series in Informatics; Band 115}, journal = {23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl}, issn = {978-3-95977-302-7}, doi = {10.4230/OASIcs.ATMOS.2023.1}, pages = {1:1 -- 1:14}, language = {en} } @misc{BeisegelKoehlerRatajczaketal., author = {Beisegel, Jesse and K{\"o}hler, Ekkehard and Ratajczak, Fabienne and Scheffler, Robert and Strehler, Martin}, title = {Graph search trees and the intermezzo problem}, series = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, journal = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, editor = {Kr{\´a}lovič, Rastislav and Kučera, Anton{\´i}n}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl}, isbn = {978-3-95977-335-5}, doi = {10.4230/LIPICS.MFCS.2024.22}, pages = {22:1 -- 22:18}, language = {en} } @misc{BeisegelKoehlerScheffleretal., author = {Beisegel, Jesse and K{\"o}hler, Ekkehard and Scheffler, Robert and Strehler, Martin}, title = {Certifying fully dynamic algorithms for recognition and Hamiltonicity of Threshold and Chain Graphs}, series = {Algorithmica}, volume = {85}, journal = {Algorithmica}, number = {8}, issn = {0178-4617}, doi = {10.1007/s00453-023-01107-1}, pages = {2454 -- 2481}, language = {en} }