1 citations · 1 across the 11 of their papers we have counts for
3 papers · 1 filter
Temporal Routing in Static Networks: The Schedule Completion Problem
Michelle Döring, Niklas Mohrin, George Skretas
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…
FO and MSO Model Checking on Temporal Graphs
Michelle Döring, Jessica Enright, Laura Larios-Jones +1
Algorithmic meta-theorems provide an important tool for showing tractability of graph problems on graph classes defined by structural restrictions. While such results are well esta…
Cost-Free Neutrality for the River Method
Michelle Döring, Jannes Malanowski, Stefan Neubert
Recently, the River Method was introduced as novel refinement of the Split Cycle voting rule. The decision-making process of River is closely related to the well established Ranked…