TY - CHAP A1 - Köhler, Ekkehard A1 - Strehler, Martin T1 - Traffic signal optimization using cyclically expanded networks T2 - 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10), September 9, 2010, Liverpool, United Kingdom Y1 - 2010 SN - 978-3-939897-20-0 SP - 114 EP - 129 PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH CY - Wadern ER - TY - CHAP A1 - Köhler, Ekkehard A1 - Strehler, Martin T1 - Signalanlagenoptimierung mit zyklisch expandierten Netzwerken T2 - Optimierung in Verkehr und Transport, 16./17. 03. 2011, Stuttgart, Tagungsband Heureka '11 Y1 - 2011 SN - 978-3-941790-72-8 SP - 314 EP - 333 PB - FGSV-Verlag CY - Köln ER - TY - GEN A1 - Köhler, Ekkehard A1 - Strehler, Martin T1 - Combining Static and Dynamic Models for Traffic Signal Optimization Inherent Load-dependent Travel Times in a Cyclically Time-expanded Network Model T2 - Procedia - Social and Behavioral Science Y1 - 2012 UR - http://www.sciencedirect.com/science/article/pii/S1877042812042899 U6 - https://doi.org/10.1016/j.sbspro.2012.09.827 SN - 1877-0428 VL - 54 SP - 1125 EP - 1134 ER - TY - GEN A1 - Köhler, Ekkehard A1 - Strehler, Martin T1 - Traffic signal optimization using cyclically expanded networks T2 - Networks Y1 - 2015 U6 - https://doi.org/10.1002/net.21601 VL - 65 IS - 3 SP - 244 EP - 261 ER - TY - GEN A1 - Köhler, Ekkehard A1 - Strehler, Martin T1 - Traffic signal optimization: combining static and dynamic models T2 - arXiv.org N2 - 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. KW - Discrete Mathematics Y1 - 2015 UR - http://arxiv.org/abs/1509.08709 ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Recognizing Graph Search Trees T2 - arXiv.org Y1 - 2018 UR - https://arxiv.org/abs/1811.09249v2 ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - On the End-Vertex Problem of Graph Searches T2 - Discrete Mathematics & Theoretical Computer Science Y1 - 2019 SN - 1365-8050 SN - 1462-7264 VL - 21 IS - 1 ER - TY - GEN A1 - Beisegel, Jesse A1 - Chiarelli, Nina A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Milanič, Martin A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin ED - Adler, Isolde ED - Müller, Haiko T1 - Edge Elimination and Weighted Graph Classes T2 - Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020 Y1 - 2020 SN - 978-3-030-60439-4 SN - 978-3-030-60440-0 U6 - https://doi.org/10.1007/978-3-030-60440-0_11 SN - 1611-3349 SN - 0302-9743 SP - 134 EP - 147 PB - Springer CY - Cham ER - TY - GEN A1 - Beisegel, Jesse A1 - Köhler, Ekkehard A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Linear Time LexDFS on Chordal Graphs T2 - 28th Annual European Symposium on Algorithms (ESA) 2020, September 7-9, 2020, Pisa, Italy) Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-128790 UR - https://drops.dagstuhl.de/opus/volltexte/2020/12879 VL - 173 SP - 13:1 EP - 13:13 PB - Schloss Dagstuhl, Leibnitz Zentrum für Informatik ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin ED - Coutinho, Gabriel ED - Kohayakawa, Yoshiharu ED - dos Santos, Vinicius ED - Urrutia, Sebastián T1 - Recognizing Graph Search Trees T2 - The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019) 2-7 June 2019, Belo Horizonte, Brazil Y1 - 2019 U6 - https://doi.org/10.1016/j.entcs.2019.08.010 SN - 1571-0661 SP - 99 EP - 110 PB - Elsevier ER - TY - GEN A1 - Köhler, Ekkehard A1 - Strehler, Martin T1 - Traffic Signal Optimization: Combining Static and Dynamic Models T2 - Transportation Science Y1 - 2019 U6 - https://doi.org/10.1287/trsc.2017.0760 SN - 1526-5447 VL - 53 IS - 1 SP - 21 EP - 41 ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - The Recognition Problem of Graph Search Trees T2 - SIAM Journal on Discrete Mathematics Y1 - 2021 U6 - https://doi.org/10.1137/20M1313301 SN - 1095-7146 SN - 0895-4801 VL - 35 IS - 2 SP - 1418 EP - 1446 ER - TY - GEN A1 - Köhler, Ekkehard A1 - Rogge, Markus A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Optimal Bicycle Routes with Few Signal Stops T2 - 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) Y1 - 2023 U6 - https://doi.org/10.4230/OASIcs.ATMOS.2023.1 SN - 978-3-95977-302-7 VL - OASIcs - Open Access Series in Informatics; Band 115 SP - 1:1 EP - 1:14 PB - Schloss Dagstuhl – Leibniz-Zentrum für Informatik CY - Dagstuhl ER - TY - GEN A1 - Beisegel, Jesse A1 - Köhler, Ekkehard A1 - Ratajczak, Fabienne A1 - Scheffler, Robert A1 - Strehler, Martin ED - Královič, Rastislav ED - Kučera, Antonín T1 - Graph search trees and the intermezzo problem T2 - 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) Y1 - 2024 SN - 978-3-95977-335-5 U6 - https://doi.org/10.4230/LIPICS.MFCS.2024.22 SP - 22:1 EP - 22:18 PB - Schloss Dagstuhl – Leibniz-Zentrum für Informatik CY - Dagstuhl ER - TY - GEN A1 - Beisegel, Jesse A1 - Köhler, Ekkehard A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Certifying fully dynamic algorithms for recognition and Hamiltonicity of Threshold and Chain Graphs T2 - Algorithmica Y1 - 2023 U6 - https://doi.org/10.1007/s00453-023-01107-1 SN - 0178-4617 VL - 85 IS - 8 SP - 2454 EP - 2481 ER -