5 papers · 1 filter
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…
Realization of Temporally Connected Graphs Based on Degree Sequences
Arnaud Casteigts, Michelle Döring, Nils Morawietz
Given an undirected graph , the problem of deciding whether admits a simple and proper time-labeling that makes it temporally connected is known to be NP-hard (Göbel et al.…
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…
Dynamic Network Discovery via Infection Tracing
Ben Bals, Michelle Döring, Nicolas Klodt +1
Researchers, policy makers, and engineers need to make sense of data from spreading processes as diverse as rumor spreading in social networks, viral infections, and water contamin…
Catch Me If You Can: Finding the Source of Infections in Temporal Networks
Ben Bals, Michelle Döring, Nicolas Klodt +1
Source detection (SD) is the task of finding the origin of a spreading process in a network. Algorithms for SD help us combat diseases, misinformation, pollution, and more, and hav…