Author:
Mertzios George B.,Molter Hendrik,Niedermeier Rolf,Zamaraev Viktor,Zschoche Philipp
Funder
Deutsche Forschungsgemeinschaft
Israel Science Foundation
Engineering and Physical Sciences Research Council
European Research Council
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science,General Computer Science
Reference65 articles.
1. Ephemeral networks with random availability of links: the case of fast networks;Akrida;J. Parallel Distrib. Comput.,2016
2. How fast can we reach a target vertex in stochastic temporal graphs?;Akrida,2019
3. Temporal vertex cover with a sliding time window;Akrida;J. Comput. Syst. Sci.,2020
4. Some APX-completeness results for cubic graphs;Alimonti;Theor. Comput. Sci.,2000
5. Randomized greedy matching II;Aronson;Random Struct. Algorithms,1995
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The complexity of computing optimum labelings for temporal connectivity;Journal of Computer and System Sciences;2024-12
2. Physics-Informed Explainable Continual Learning on Graphs;IEEE Transactions on Neural Networks and Learning Systems;2024-09
3. Parity Games on Temporal Graphs;Lecture Notes in Computer Science;2024