Deleting edges to restrict the size of an epidemic in temporal networks
Spreading processes on graphs are a natural model for a wide variety of real-world
phenomena, including information spread over social networks and biological diseases …
phenomena, including information spread over social networks and biological diseases …
Characterization of potential superspreader farms for bovine tuberculosis: A review
Background Variation in host attributes that influence their contact rates and infectiousness
can lead some individuals to make disproportionate contributions to the spread of infections …
can lead some individuals to make disproportionate contributions to the spread of infections …
Delay-robust routes in temporal graphs
E Füchsle, H Molter, R Niedermeier… - arXiv preprint arXiv …, 2022 - arxiv.org
Most transportation networks are inherently temporal: Connections (eg flights, train runs) are
only available at certain, scheduled times. When transporting passengers or commodities …
only available at certain, scheduled times. When transporting passengers or commodities …
Temporal reachability minimization: Delaying vs. deleting
H Molter, M Renken, P Zschoche - Journal of Computer and System …, 2024 - Elsevier
We study spreading processes in temporal graphs, that is, graphs whose connections
change over time. More precisely, we investigate how such a spreading process, emerging …
change over time. More precisely, we investigate how such a spreading process, emerging …
[HTML][HTML] Optimizing reachability sets in temporal graphs by delaying
A Deligkas, I Potapov - Information and Computation, 2022 - Elsevier
A temporal graph is a dynamic graph where every edge is assigned a set of integer time
labels that indicate at which discrete time step the edge is available. In this paper, we study …
labels that indicate at which discrete time step the edge is available. In this paper, we study …
[HTML][HTML] Assigning times to minimise reachability in temporal graphs
Temporal graphs (in which edges are active at specified times) are of particular relevance
for spreading processes on graphs, eg the spread of disease or dissemination of …
for spreading processes on graphs, eg the spread of disease or dissemination of …
What is known about vertex cover kernelization?
We are pleased to dedicate this survey on kernelization of the V ertex C over problem, to
Professor Juraj Hromkovič on the occasion of his 60th birthday. The V ertex C over problem …
Professor Juraj Hromkovič on the occasion of his 60th birthday. The V ertex C over problem …
Multistage st path: Confronting similarity with dissimilarity in temporal graphs
Addressing a quest by Gupta et al.[ICALP'14], we provide a first, comprehensive study of
finding a short st path in the multistage graph model, referred to as the Multistage st Path …
finding a short st path in the multistage graph model, referred to as the Multistage st Path …
Minimizing reachability times on temporal graphs via shifting labels
We study how we can accelerate the spreading of information in temporal graphs via
delaying operations; a problem that captures real-world applications varying from …
delaying operations; a problem that captures real-world applications varying from …
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
It has long been known that Feedback Vertex Set can be solved in time\(2^{{\mathcal
{O}}(w\log w)} n^{{\mathcal {O}}(1)}\) on n-vertex graphs of treewidth w, but it was only …
{O}}(w\log w)} n^{{\mathcal {O}}(1)}\) on n-vertex graphs of treewidth w, but it was only …