![]() | 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
ORCID: 0000-0001-5396-3749
(2017)
The Complexity of Optimal Design of Temporally Connected Graphs.
THEORY OF COMPUTING SYSTEMS, 61 (3).
pp. 907-944.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Deligkas, Argyrios, Melissourgos, Themistoklis
ORCID: 0000-0002-9867-6257 and Spirakis, Paul G
ORCID: 0000-0001-5396-3749
(2019)
Connected Subgraph Defense Games.
In: Algorithmic Game Theory.
Akrida, Eleni C, Deligkas, Argyrios, Melissourgos, Themistoklis and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2021)
Connected Subgraph Defense Games.
ALGORITHMICA, 83 (11).
pp. 3403-3431.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Gasieniec, Leszek
ORCID: 0000-0003-1809-9814, Mertzios, George B and Spirakis, Paul G
ORCID: 0000-0001-5396-3749
(2016)
Ephemeral networks with random availability of links: The case of fast networks.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 87.
pp. 109-120.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G
ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor
ORCID: 0000-0001-5755-4141
(2019)
How fast can we reach a target vertex in stochastic temporal graphs?
Leibniz International Proceedings in Informatics, LIPIcs, 132.
131:1-131:1.
Akrida, Eleni C, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor
ORCID: 0000-0001-5755-4141
(2020)
How fast can we reach a target vertex in stochastic temporal graphs?
Journal of Computer and System Sciences, 114.
pp. 65-83.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Czyzowicz, Jurek, Gasieniec, Leszek
ORCID: 0000-0003-1809-9814, Kuszner, Lukasz and Spirakis, Paul G
ORCID: 0000-0001-5396-3749
(2017)
Temporal Flows in Temporal Networks.
In: 10th International Conference on Algorithms and Complexity, CIAC 2017, 2017-5-24 - 2017-5-26, Athens, Greece.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul G
ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor
ORCID: 0000-0001-5755-4141
(2018)
Temporal Vertex Cover with a Sliding Time Window.
In: International; Colloquium on Automata , Languages and Programming (ICALP), 2018-7-9 - 2018-7-13, Prague.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Czyzowicz, Jurek, Gasieniec, Leszek
ORCID: 0000-0003-1809-9814, Kuszner, Lukasz and Spirakis, Paul G
ORCID: 0000-0001-5396-3749
(2019)
Temporal flows in temporal networks.
In: 10th International Conference on Algorithms and Complexity -CIAC 2017, 2017-5-24 - 2017-5-26, Athens Greece.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul G and Zarnaraev, Viktor
(2020)
Temporal vertex cover with a sliding time window.
.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B and Spirakis, Paul G
ORCID: 0000-0001-5396-3749
(2019)
The temporal explorer who returns to the base.
International Conference on Algorithms and Complexity (CIAC), 11485 .
pp. 13-24.
Akrida, Eleni C, Mertzios, George B, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Raptopoulos, Christoforos
(2021)
The temporal explorer who returns to the base.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 120.
pp. 179-193.