see also: ORCid and dblp

Journal Articles

1. R. Scheffler. On the Leaves of Graph Search Trees. Accepted for publication in Ars Mathematica Contemporanea. DOI 10.26493/1855-3974.3238.2a8
2. J. Beisegel, F. Ratajczak, R. Scheffler. Computing Hamiltonian Paths with Partial Order Restrictions. ACM Transactions on Computation Theory 17(1), Article 5, 2025. DOI 10.1145/3711844
3. R. Scheffler. Semi-Proper Interval Graphs. Discrete Applied Mathematics, 360:22–41, 2025. DOI 10.1016/j.dam.2024.08.016
4. R. Scheffler. Recognizing LBFS Trees of Bipartite Graphs. Information Processing Letters 186, Article 106483, 2024. DOI 10.1016/j.ipl.2024.106483
5. J. Beisegel, E. Köhler, R. Scheffler, M. Strehler. Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. Algorithmica 85(8):2454–2481, 2023. DOI 10.1007/s00453-023-01107-1
6. R. Scheffler. The Distance Orientation Problem. Discrete Applied Mathematics 323:324–342, 2022. DOI 10.1016/j.dam.2022.06.009
7. R. Scheffler. On the Recognition of Search Trees Generated by BFS and DFS. Theoretical Computer Science 936:116–128, 2022. DOI 10.1016/j.tcs.2022.09.018
8. R. Scheffler, M. Strehler, L. Vargas Koch. Routing Games with Edge Priorities. ACM Transactions on Economics and Computation, 10(1), Article 1, 2022. DOI 10.1145/3488268
9. J. Beisegel, C. Denkert, E. Köhler, M. Krnc, N. Pivač, R. Scheffler, M. Strehler. The Recognition Problem of Graph Search Trees. SIAM Journal on Discrete Mathematics, 35(2):1418–1446, 2021. DOI 10.1137/20M1313301
10. J. Beisegel, C. Denkert, E. Köhler, M. Krnc, N. Pivač, R. Scheffler, M. Strehler. On the end-vertex problem of graph searches. Discrete Mathematics & Theoretical Computer Science, 21(1), Article 13, 2019. DOI 10.23638/DMTCS-21-1-13

Conference Articles

1. J. Beisegel, E. Köhler, F. Ratajczak, R. Scheffler, M. Strehler. Graph Search Trees and the Intermezzo Problem. 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). LIPIcs 306, Schloss Dagstuhl, pp. 22:1–22:18, 2024. DOI 10.4230/LIPIcs.MFCS.2024.22 Preprint arXiv:2404.18645
2. J. Beisegel, N. Chiarelli, E. Köhler, M. Milanič, P. Muršič, R. Scheffler. The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024). LIPIcs 294, Schloss Dagstuhl, pp. 7:1–7:20, 2024. DOI 10.4230/LIPIcs.SWAT.2024.7 Preprint arXiv:2404.10670
3. R. Scheffler. Graph Search Trees and Their Leaves. 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023), LNCS 14093, Springer, pp. 462–476, 2023 DOI 10.1007/978-3-031-43380-1_33 Preprint arXiv:2307.07279
4. E. Köhler, M. Rogge, R. Scheffler, M. Strehler. Optimal Bicycle Routes with Few Signal Stops. 23rd Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023), OASICs 115, Schloss Dagstuhl, pp. 1:1-1:14, 2023. DOI 10.4230/OASIcs.ATMOS.2023.1
5. R. Scheffler. Linearizing Partial Search Orders. 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022), LNCS 13453, Springer, pp. 425–438, 2022. DOI 10.1007/978-3-031-15914-5_31 Preprint arXiv:2206.14556
6. J. Beisegel, E. Köhler, R. Scheffler, M. Strehler. Linear Time LexDFS on Chordal Graphs. 28th Annual European Symposium on Algorithms, Track A (ESA 2020), LIPIcs 173, Schloss Dagstuhl, pp. 13:1–13:13, 2020. DOI 10.4230/LIPIcs.ESA.2020.13
7. J. Beisegel, N. Chiarelli, E. Köhler, M. Krnc, M. Milanič, N. Pivač, R. Scheffler, M. Strehler. Edge elimination and weighted graph classes. 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), LNCS 12301, Springer, S. 134–147, 2020. DOI 10.1007/978-3-030-60440-0_11
8. J. Beisegel, C. Denkert, E. Köhler, M. Krnc, N. Pivač, R. Scheffler, M. Strehler: Recognizing Graph Search Trees. 10th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), ENTCS 346, Elsevier, pp. 99–110, 2019. DOI 10.1016/j.entcs.2019.08.010 Preprint arXiv:1811.09249
9. T. Thunig, R. Scheffler, M. Strehler, K. Nagel: Optimization and simulation of fixed-time traffic signal control in real-world applications. 8th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications (ABMTRANS'19), Procedia Computer Science 151, Elsevier, pp. 826–833, 2019. DOI 10.1016/j.procs.2019.04.113
10. R. Scheffler, M. Strehler, L. Vargas Koch: Equilibria in routing games with edge priorities. 14th Conference of Web and Internet Economics (WINE 2018), LNCS 11316, Springer, pp. 408–422, 2018. DOI 10.1007/978-3-030-04612-5_27 Preprint arXiv:1803.00865
11. R. Scheffler, A. Mansouri Yarahmadi, M. Breuß, E. Köhler. A Graph Theoretic Approach for Shape from Shading. 11th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR 2017), LNCS 10746, Springer, pp. 328–341, 2017. DOI 10.1007/978-3-319-78199-0_22
12. R. Scheffler, M. Strehler. Optimizing Traffic Signal Settings for Public Transport Priority. 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), OASICs 59, Schloss Dagstuhl, pp. 9:1-9:15, 2017. DOI 10.4230/OASIcs.ATMOS.2017.9
13. R. Scheffler, M. Strehler. Optimizing Traffic Signal Timings for Mega Events. 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016), OASICs 54, Schloss Dagstuhl, pp. 8:1–8:16, 2016. DOI 10.4230/OASIcs.ATMOS.2016.8

Theses

• R. Scheffler. Ready to Order? On Vertex and Edge Orderings of Graphs. Doctoral thesis, BTU Cottbus-Senftenberg, 2023. DOI 10.26127/BTUOpen-6301
• R. Scheffler. A graph-theoretic approach to Shape from Shading – Algorithms and complexity for distance-based orientations of graphs (in German). Master's thesis, BTU Cottbus-Senftenberg, 2017.
• R. Scheffler. Optimal coordinations of traffic light systems – Lower bounds for a modified multi-commodity min-cost flow problem (in German). Bachelor's thesis, BTU Cottbus-Senftenberg, 2014.

Conference Talks

• Simultaneous Representations meet Graph Width Parameters: The Simultaneous Interval Number and the Simultaneous Chordal Number. 11th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2024), Cottbus, Germany, September 2024.
• Graph Search Trees and the Intermezzo Problem. 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), Bratislava, Slovakia, August 2024.
• The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024), Helsinki, Finland, June 2024.
• Restricting the Traveling Salesman. Workshop Optimierung, Burg (Spreewald), Germany, March 2024.
• Optimal Bicycle Routes with Few Signal Stops. 23rd Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023), Amsterdam, Netherlands, September 2023.
• Graph Search Trees and Their Leaves. 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023), Fribourg, Switzerland, June 2023.
• Graph Search Trees and Their Leaves. 10th Slovenian Conference on Graph Theory (SiCGT 2023), Kranjska Gora, Slovenia, June 2023.
• Semi-Proper Interval Graphs. 10th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2022), Koper, Slovenia, September 2022.
• Linearizing Partial Search Orders. 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022), Tübingen, Germany, June 2022.
• The Crux with the Right Way of Giving Right of Way. Seminar Mathematical Foundations of Dynamic Nash Flows, Dagstuhl, Germany, September 2020.
• Linear Time LexDFS on Chordal Graphs. 28th Annual European Symposium on Algorithms (ESA 2020), Pisa, Italy, September 2020 (online).
• Edge Elimination and Weighted Graph Classes. 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), Leeds, UK, June 2020 (online).
• The Distance Orientation Problem. Workshop Optimierung, Olbernhau, Germany, March 2019.
• The Distance Orientation Problem. 36th Colloquium on Combinatorics (KOLKOM 2017), Paderborn, Germany, November 2017.
• A Graph Theoretic Approach for Shape from Shading. 11th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR 2017), Venice, Italy, October 2017.
• Optimizing Traffic Signal Settings for Public Transport Priority. 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), Vienna, Austria, September 2017.

Further Conference Participations

• ALGO 2023 (including ESA and ATMOS), Amsterdam, Netherlands, September 2023.
• SIGOPT 2023, Cottbus, Germany, March 2023.
• ALGO 2022 (including ESA and ATMOS), Potsdam, Germany, September 2022.
• WINE 2018, Oxford, UK, December 2018.
• WG 2018, Lübbenau, Germany, June 2018.
• ALGO 2017 (including ESA and ATMOS), Vienna, Austria, September 2017.
• ALGO 2016 (including ESA and ATMOS), Aarhus, Denmark, August 2016.

Other Talks

• Simultaneous Representations meet Graph Width Parameters: The Simultaneous Interval Number and the Simultaneous Chordal Number. Noon seminar, Work group Theoretical Informatics, FU Berlin, Berlin, Germany, March 2025.
• Counting on Theft. How Mathematicians Guard Art (in German). Science Slam of the 27th Nationwide Student SATIRE Festival EI(N)FÄLLE, Cottbus, Germany, January 2025.
• Graph Search Trees and the Intermezzo Problem. Algorithm Seminar, Computational Geometry Lab, Carleton University, Ottawa, Canada, October 2024 (online).
• Counting on Theft. How Mathematicians Guard Art (in German). 3rd Brandenburg Science Slam, Spremberg, Germany, June 2024.
• Counting on Theft. How Mathematicians Guard Art (in German). 3rd Day of Mathematics, Cottbus, Germany, May 2024.
• Counting on Theft. How Mathematicians Guard Art (in German). 3rd Brandenburg Science Slam, Finsterwalde, Germany, May 2024.
• Optimal Bicycle Routes with Few Signal Stops. Seminar Faculty of Mathematics, Natural Sciences and Information Technologies of University of Primorska, Koper, Slovenia, September 2023.
• Math at the Crossroads. When Mathematicians Play with the Right of Way (in German). 2nd Brandenburg Science Slam, Spremberg, Germany, June 2023.
• Mathematical Games at the Crossroads (in German). 2nd Day of Mathematics, Cottbus, Germany, May 2023.
• How to Search in the Right Direction. Seminar Faculty of Mathematics, Natural Sciences and Information Technologies of University of Primorska, Koper, Slovenia, February 2023.
• The Distance Orientation Problem. Seminar Faculty of Mathematics, Natural Sciences and Information Technologies of University of Primorska, Koper, Slovenia, October 2018.

Unless otherwise stated, the course was held in German.

• Lecture/Excercise Parameterized Complexity, SuSe 2024
• Exercise Algorithmic Graph Theory, WiSe 2022/23
• Exercise Graph Theory (in English), WiSe 2023/24
• Exercise Graph Theory, WiSe 2017/18, 2021/22
• Exercise Algorithmic Discrete Mathematics, SuSe 2021, 2022, 2023, 2024
• Exercise/Tutorial Linear Algebra and Analytic Geometry I, WiSe 2021/22, 2023/24
• Exercise Linear Algebra and Analytic Geometry II, SuSe 2022
• Exercise/Tutorial Mathematics IT-1 (Discrete Mathematics), WiSe 2018/19, 2019/20, 2020/21, 2022/23, 2023/24, 2024/25
• Exercise/Tutorial Mathematics IT-2 (Linear Algebra), SuSe 2018, 2019, 2020, 2023
• Supervision Introduction to Programming (Mathematics), WiSe 2018/19, 2019/20
• Supervision Software Lab Project, WiSe 2013/14
• Exercise Development of Software Systems, WiSe 2012/13
• Exercise Software and Systems Engineering (for Engineers), SuSe 2012

• Pascal Schuffenhauer: Efficient lexicographic depth search using van Emde-Boas trees. 2024 (Master's thesis)
• Bruno Pönitz: k-outerplanar graphs. 2024 (Bachelor's thesis).
• Florian Krowiorz: The algorithmic complexity of generalized search tree recognition. 2023 (Bachelor’s thesis; awarded as the best Faculty 1 bachelor's thesis of 2023).
• Lisa Marie Schachtschneider: Algorithms for optimal bicycle routes in traffic light networks. 2022 (Bachelor’s thesis).
• Niklas Füller: Maximum adjacency ordering in the context of maximum flows. 2022 (Bachelor’s thesis).

• Best Master's Thesis of Faculty 1 of BTU Cottbus-Senftenberg, 2017.
• Best Bachelor's Thesis of Faculty 1 of BTU Cottbus-Senftenberg, 2014.