1 citations · 2 across the 19 of their papers we have counts for
11 papers · 1 filter
Reconfiguration of Temporal Networks under Reachability Constraints
Othon Michail, George Skretas, Georg Tennigkeit +1
Temporal networks model dynamic systems in which edges represent interactions and labels specify when these interactions occur. Examples include transportation networks, time-sensi…
Maximizing Reachability via Shifting of Temporal Paths
Argyrios Deligkas, Michelle Döring, Eduard Eiben +2
We examine the problem of maximizing the reachability of a given source in temporal graphs that are given as the union of k temporal paths, i.e., every given path is a sequence of…
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…
Parameterized Complexity of Temporal Connected Components
Argyrios Deligkas, Michelle Döring, Eduard Eiben +3
We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, that is, graphs whose edges are available only at specific points in time.…
Temporal Graph Reconfiguration for Always-Connected Graphs
Paul Sievers, George Skretas, Georg Tennigkeit
Network redesign problems ask for modifications to the edges of a given graph to satisfy certain properties. In temporal graphs, where edges are only active at certain times, we ar…
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…
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
Samuel Baguley, Yannic Maus, Janosch Ruff +1
Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient.…
Minimizing Reachability Times on Temporal Graphs via Shifting Labels
Argyrios Deligkas, Eduard Eiben, George Skretas
We study how we can accelerate the spreading of information in temporal graphs via shifting operations; a problem that captures real-world applications varying from information flo…
The Complexity of Growing a Graph
George B. Mertzios, Othon Michail, George Skretas +2
We study a new algorithmic process of graph growth which starts from a single initial vertex and operates in discrete time-steps, called \emph{slots}. In every slot, the graph grow…
On the Transformation Capability of Feasible Mechanisms for Programmable Matter
Othon Michail, George Skretas, Paul G. Spirakis
In this work, we study theoretical models of \emph{programmable matter} systems. The systems under consideration consist of spherical modules, kept together by magnetic forces and…