 | Up a level |
Akrida, Eleni C 
ORCID: 0000-0002-1126-1623, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Mertzios, George B and Spirakis, Paul G
(2017)
The Complexity of Optimal Design of Temporally Connected Graphs.
THEORY OF COMPUTING SYSTEMS, 61 (3).
907 - 944.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Deligkas, Argyrios, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G
Connected Subgraph Defense Games.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Mertzios, George B and Spirakis, Paul G
(2016)
Ephemeral networks with random availability of links: The case of fast networks.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 87.
109 - 120.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G and Zamaraev, Viktor
How fast can we reach a target vertex in stochastic temporal graphs?
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Czyzowicz, Jurek, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Kuszner, Lukasz and Spirakis, Paul G
(2017)
Temporal Flows in Temporal Networks.
.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul G and Zamaraev, Viktor
(2018)
Temporal Vertex Cover with a Sliding Time Window.
LIPIcs : Leibniz International Proceedings in Informatics.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Czyzowicz, Jurek, Gasieniec, Leszek ORCID: 0000-0003-1809-9814, Kuszner, Lukasz and Spirakis, Paul G
(2019)
Temporal flows in temporal networks.
.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B and Spirakis, Paul G
(2018)
The temporal explorer who returns to the base.