Author:
Molter Hendrik,Renken Malte,Zschoche Philipp
Funder
Israel Science Foundation
European Research Council
Deutsche Forschungsgemeinschaft
Reference52 articles.
1. The temporal explorer who returns to the base;Akrida,2019
2. How fast can we reach a target vertex in stochastic temporal graphs?;Akrida;J. Comput. Syst. Sci.,2020
3. On the size and the approximability of minimum temporally connected subgraphs;Axiotis,2016
4. Efficient computation of optimal temporal walks under waiting-time constraints;Bentert;Appl. Netw. Sci.,2020