Capacitated Confluent Flows: Complexity and Algorithms. - Daniel Dressler; Martin Strehler 001 (CIAC, 2010)

Polynomial-time algorithms for special cases of the maximum confluent flow problem. - Daniel Dressler; Martin Strehler 001 (Discret. Appl. Math., 2014)

Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes. - Sören Merting; Christian Schwan; Martin Strehler 001 (ATMOS, 2015)

Traffic signal optimization using cyclically expanded networks. - Ekkehard Köhler; Martin Strehler 001 (Networks, 2015)

The Maximum Flow Problem for Oriented Flows. - Stanley Schade; Martin Strehler 001 (ATMOS, 2016)

Optimizing Traffic Signal Timings for Mega Events. - Robert Scheffler 001; Martin Strehler 001 (ATMOS, 2016)

Energy-efficient Routing of Hybrid Vehicles. - Christian Schwan; Martin Strehler 001 (CoRR, 2016)

Optimizing Traffic Signal Settings for Public Transport Priority. - Robert Scheffler 001; Martin Strehler 001 (ATMOS, 2017)

Equilibria in Routing Games with Edge Priorities. - Robert Scheffler 001; Martin Strehler 001; Laura Vargas Koch (WINE, 2018)

Nash equilibria in routing games with edge priorities. - Robert Scheffler 001; Martin Strehler 001; Laura Vargas Koch (CoRR, 2018)

Optimization and simulation of fixed-time traffic signal control in real-world applications. - Theresa Thunig; Robert Scheffler 001; Martin Strehler 001; Kai Nagel (ANT/EDI40, 2019)

On the End-Vertex Problem of Graph Searches. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (Discret. Math. Theor. Comput. Sci., 2019)

Recognizing Graph Search Trees. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (LAGOS, 2019)

Traffic Signal Optimization: Combining Static and Dynamic Models. - Ekkehard Köhler; Martin Strehler 001 (Transp. Sci., 2019)

Linear Time LexDFS on Chordal Graphs. - Jesse Beisegel; Ekkehard Köhler; Robert Scheffler 001; Martin Strehler 001 (ESA, 2020)

Edge Elimination and Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (WG, 2020)

The Recognition Problem of Graph Search Trees. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (SIAM J. Discret. Math., 2021)

Routing Games with Edge Priorities. - Robert Scheffler 001; Martin Strehler 001; Laura Vargas Koch (ACM Trans. Economics and Comput., 2022)

Optimal Bicycle Routes with Few Signal Stops. - Ekkehard Köhler; Markus Rogge; Robert Scheffler 001; Martin Strehler 001 (ATMOS, 2023)

Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. - Jesse Beisegel; Ekkehard Köhler; Robert Scheffler 001; Martin Strehler 001 (Algorithmica, 2023)

Graph Search Trees and the Intermezzo Problem. - Jesse Beisegel; Ekkehard Köhler; Fabienne Ratajczak; Robert Scheffler 001; Martin Strehler 001 (MFCS, 2024)

On the Price of Anarchy in Packet Routing Games with FIFO. - Daniel Schmand; Torben Schürenberg; Martin Strehler 001 (CIAC (1), 2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (CoRR, 2025)