research
∙
08/02/2022
Simple, strict, proper, happy: A study of reachability in temporal graphs
Dynamic networks are a complex topic. Not only do they inherit the compl...
share
research
∙
05/30/2022
Giant Components in Random Temporal Graphs
A temporal graph is a graph whose edges appear only at certain points in...
research
∙
02/08/2021
A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions
Temporal graphs represent interactions between entities over the time. T...
research
∙
01/05/2021
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition
This paper revisits two classical distributed problems in anonymous netw...
research
∙
11/07/2020
Sharp Thresholds in Random Simple Temporal Graphs
A graph whose edges only appear at certain points in time is called a te...
research
∙
06/05/2020
VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints
We study a new version of the Euclidean TSP called VectorTSP (VTSP for s...
research
∙
09/13/2019
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
Computing a (shortest) path between two vertices in a graph is one of th...
research
∙
05/10/2019
Robustness: a New Form of Heredity Motivated by Dynamic Networks
We investigate a special case of hereditary property in graphs, referred...
research
∙
09/28/2018
Temporal Cliques admit Sparse Spanners
Let G=(G,λ) be a labeled graph on n vertices with λ:E_G→N a locally inj...
research
∙
07/20/2018
Finding Structure in Dynamic Networks
This document is the first part of the author's habilitation thesis (HDR...
research
∙
02/03/2011
