Michelle Döring
YOU?
Author Swipe
View article: Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs Open
We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, i.e., graphs that deterministically change over time. In a tcc, any pair of vertices must be able to reach each other via a time-resp…
View article: How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs Open
Logistics and transportation networks require a large amount of resources to realise necessary connections between locations and minimizing these resources is a vital aspect of planning research. Since such networks have dynamic connection…
View article: Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Open
We present the first comprehensive analysis of temporal settings for directed temporal graphs, fully resolving their hierarchy with respect to support, reachability, and induced-reachability equivalence. These notions, introduced by Castei…
View article: Dynamic Network Discovery via Infection Tracing
Dynamic Network Discovery via Infection Tracing Open
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 contamination. Classical questions include predicting infection beh…
View article: Catch Me If You Can: Finding the Source of Infections in Temporal Networks
Catch Me If You Can: Finding the Source of Infections in Temporal Networks Open
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 have been studied by physicians, physicists, sociologists, and…
View article: How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs Open
Logistics and transportation networks require a large amount of resources to realize necessary connections between locations and minimizing these resources is a vital aspect of planning research. Since such networks have dynamic connection…
View article: Margin of Victory for Weighted Tournament Solutions
Margin of Victory for Weighted Tournament Solutions Open
Determining how close a winner of an election is to becoming a loser, or distinguishing between different possible winners of an election, are major problems in computational social choice. We tackle these problems for so-called weighted t…
View article: Schelling Games with Continuous Types
Schelling Games with Continuous Types Open
In most major cities and urban areas, residents form homogeneous neighborhoods along ethnic or socioeconomic lines. This phenomenon is widely known as residential segregation and has been studied extensively. Fifty years ago, Schelling pro…
View article: Schelling Games with Continuous Types
Schelling Games with Continuous Types Open
In most major cities and urban areas, residents form homogeneous neighborhoods along ethnic or socioeconomic lines. This phenomenon is widely known as residential segregation and has been studied extensively. Fifty years ago, Schelling pro…
View article: Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source Open
We consider the influence maximization problem over a temporal graph, where there is a single fixed source. We deviate from the standard model of influence maximization, where the goal is to choose the set of most influential vertices. Ins…