3 papers
cs.DS2026
Temporal Routing in Static Networks: The Schedule Completion Problem
Michelle Döring, Michelle Döring, Niklas Mohrin +1
We introduce the Temporally Edge Disjoint Schedule Completion (TEDSC) problem in which we need to cover a set of temporal edge demands by routing temporal walks through a d…
cs.CC2025
Parameterized Complexity of Vehicle Routing
Michelle Döring, Jan Fehse, Tobias Friedrich +6
The Vehicle Routing Problem (VRP) is a popular generalization of the Traveling Salesperson Problem. Instead of one salesperson traversing the entire weighted, undirected graph ,…
cs.FL2025
Behaviorally Correct Learning from Informants
Niklas Mohrin
In inductive inference, we investigate the learnability of classes of formal languages. We are interested in what classes of languages are learnable in certain learning settings. A…