Subject
General Computer Science,Theoretical Computer Science
Reference37 articles.
1. Eleni C Akrida, Jurek Czyzowicz, Leszek Gasieniec, Łukasz Kuszner, and Paul G Spirakis. Temporal flows in temporal networks. Journal of Computer and System Sciences, 103:46–60, 2019.
2. Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, and Paul G. Spirakis. The complexity of optimal design of temporally connected graphs. Theory of Computing Systems, 61(3):907–944, 2017.
3. Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, and Franck Petit. On implementing stabilizing leader election with weak assumptions on network dynamics. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 21–31, 2021.
4. Kyriakos Axiotis and Dimitris Fotakis. On the size and the approximability of minimum temporally connected subgraphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pages 149:1–149:14, 2016.
5. Stefan Balev, Juan Jiménez Laredo, Ioannis Lamprou, Yoann Pigné, and Eric Sanlaville. Cops and robbers on dynamic graphs: Offline and online case. Discrete Mathematics & Theoretical Computer Science, 25(Discrete Algorithms), 2023.