Robert Scheffler

Orcid: 0000-0001-6007-4202

Affiliations:
  • Brandenburg University of Technology, Cottbus, Germany


According to our database1, Robert Scheffler authored at least 31 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Breadth-First Search Trees with Many or Few Leaves.
CoRR, April, 2026

2025
On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems.
CoRR, August, 2025

Sandwich Monotonicity and the Recognition of Weighted Graph Classes.
CoRR, August, 2025

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs.
CoRR, June, 2025

Computing Hamiltonian Paths with Partial Order Restrictions.
ACM Trans. Comput. Theory, March, 2025

A Graph Width Perspective on Partially Ordered Hamiltonian Paths.
CoRR, March, 2025

Semi-proper interval graphs.
Discret. Appl. Math., 2025

The Partial Search Order Problem.
Electron. J. Comb., 2025

On the leaves of graph search trees.
Ars Math. Contemp., 2025

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers.
Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

2024
Recognizing LBFS trees of bipartite graphs.
Inf. Process. Lett., 2024

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Graph Search Trees and the Intermezzo Problem.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs.
Algorithmica, August, 2023

Graph Search Trees and Their Leaves.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Optimal Bicycle Routes with Few Signal Stops.
Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, 2023

2022
Routing Games with Edge Priorities.
ACM Trans. Economics and Comput., 2022

On the recognition of search trees generated by BFS and DFS.
Theor. Comput. Sci., 2022

The Distance Orientation Problem.
Discret. Appl. Math., 2022

Linearizing Partial Search Orders.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021
The Recognition Problem of Graph Search Trees.
SIAM J. Discret. Math., 2021

2020
Edge Elimination and Weighted Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Linear Time LexDFS on Chordal Graphs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Recognizing Graph Search Trees.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the End-Vertex Problem of Graph Searches.
Discret. Math. Theor. Comput. Sci., 2019

Optimization and simulation of fixed-time traffic signal control in real-world applications.
Proceedings of the 10th International Conference on Ambient Systems, Networks and Technologies (ANT 2019) / The 2nd International Conference on Emerging Data and Industry 4.0 (EDI40 2019) / Affiliated Workshops, April 29, 2019

2018
Nash equilibria in routing games with edge priorities.
CoRR, 2018

Equilibria in Routing Games with Edge Priorities.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

2017
A Graph Theoretic Approach for Shape from Shading.
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2017

Optimizing Traffic Signal Settings for Public Transport Priority.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016
Optimizing Traffic Signal Timings for Mega Events.
Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016


  Loading...