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

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

A Graph Theoretic Approach for Shape from Shading. - Robert Scheffler 001; Ashkan Mansouri Yarahmadi; Michael Breuß; Ekkehard Köhler (EMMCVPR, 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)

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)

Linearizing Partial Search Orders. - Robert Scheffler 001 (WG, 2022)

The Distance Orientation Problem. - Robert Scheffler 001 (Discret. Appl. Math., 2022)

On the recognition of search trees generated by BFS and DFS. - Robert Scheffler 001 (Theor. Comput. Sci., 2022)

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)

Graph Search Trees and Their Leaves. - Robert Scheffler 001 (WG, 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)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Martin Milanic; Peter Mursic; Robert Scheffler 001 (SWAT, 2024)

Recognizing LBFS trees of bipartite graphs. - Robert Scheffler 001 (Inf. Process. Lett., 2024)

Semi-proper interval graphs. - Robert Scheffler 001 (Discret. Appl. Math., 2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths. - Jesse Beisegel; Katharina Klost; Kristin Knorr; Fabienne Ratajczak; Robert Scheffler 001 (CoRR, 2025)

Computing Hamiltonian Paths with Partial Order Restrictions. - Jesse Beisegel; Fabienne Ratajczak; Robert Scheffler 001 (ACM Trans. Comput. Theory, 2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs. - Jesse Beisegel; Katharina Klost; Kristin Knorr; Fabienne Ratajczak; Robert Scheffler 001 (CoRR, 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)