3 papers
cs.DS2022
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
Elisabet Burjons, Janosch Fuchs, Henri Lotze
In the area of graph drawing, the One-Sided Crossing Minimization Problem (OSCM) is defined on a bipartite graph with both vertex sets aligned parallel to each other and all edges…
cs.CC2019
The Complexity of Packing Edge-Disjoint Paths
Jan Dreier, Janosch Fuchs, Tim A. Hartmann +4
We introduce and study the complexity of Path Packing. Given a graph and a list of paths, the task is to embed the paths edge-disjoint in . This generalizes the well known H…
cs.CC2018
The Graph Exploration Problem with Advice
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
Moving an autonomous agent through an unknown environment is one of the crucial problems for robotics and network analysis. Therefore, it received a lot of attention in the last de…