Suivre
Eleni C. Akrida
Eleni C. Akrida
Postdoctoral Research Associate, University of Liverpool
Adresse e-mail validée de liverpool.ac.uk - Page d'accueil
Titre
Citée par
Citée par
Année
Temporal vertex cover with a sliding time window
EC Akrida, GB Mertzios, PG Spirakis, V Zamaraev
Journal of Computer and System Sciences 107, 108-123, 2020
462020
The complexity of optimal design of temporally connected graphs
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
Theory of Computing Systems 61 (3), 907-944, 2017
342017
Temporal flows in temporal networks
EC Akrida, J Czyzowicz, L Gąsieniec, Ł Kuszner, PG Spirakis
Journal of Computer and System Sciences 103, 46-60, 2019
262019
Ephemeral networks with random availability of links: The case of fast networks
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
Journal of Parallel and Distributed Computing 87, 109-120, 2016
262016
The temporal explorer who returns to the base
EC Akrida, GB Mertzios, PG Spirakis
International Conference on Algorithms and Complexity, 13-24, 2019
192019
On temporally connected graphs of small cost
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
International Workshop on Approximation and Online Algorithms, 84-96, 2015
172015
Ephemeral networks with random availability of links: diameter and connectivity
EC Akrida, L Gasieniec, GB Mertzios, PG Spirakis
Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014
152014
On verifying and maintaining connectivity of interval temporal networks
EC Akrida, PG Spirakis
Parallel Processing Letters 29 (02), 1950009, 2019
122019
How fast can we reach a target vertex in stochastic temporal graphs?
EC Akrida, GB Mertzios, S Nikoletseas, C Raptopoulos, PG Spirakis, ...
Journal of computer and system sciences 114, 65-83, 2020
102020
How fast can we reach a target vertex in stochastic temporal graphs?
EC Akrida, GB Mertzios, S Nikoletseas, C Raptopoulos, PG Spirakis, ...
arXiv preprint arXiv:1903.03636, 2019
92019
Ephemeral 455 networks with random availability of links: The case of fast networks
EC Akrida, L Gasieniec, GB Mertzios, PG Spirakis
Journal of Parallel 456 and Distributed Computing 87 (109-120), 457, 2016
72016
Flows in temporal networks
EC Akrida, J Czyzowicz, L Gasieniec, L Kuszner, PG Spirakis
CoRR abs/1606.01091, 2016
42016
Connected subgraph defense games
EC Akrida, A Deligkas, T Melissourgos, PG Spirakis
Algorithmica 83 (11), 3403-3431, 2021
12021
Matching in stochastically evolving graphs
EC Akrida, A Deligkas, GB Mertzios, PG Spirakis, V Zamaraev
arXiv preprint arXiv:2005.08263, 2020
12020
Designing and testing temporally connected graphs
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
arXiv preprint arXiv:1502.04579, 2015
12015
Narrowing and Stretching: Addressing the Challenge of Multi-track Programming
S Bradley, E Akrida
Computing Education Practice 2022, 1-4, 2022
2022
The temporal explorer who returns to the base
P Spirakis, E Akrida, G Mertzios, C Raptopoulos
Journal of Computer and System Sciences, 2021
2021
Temporal Graphs
EC Akrida
PQDT-UK & Ireland, 2016
2016
Moving in temporal graphs with very sparse random availability of edges
PG Spirakis, EC Akrida
arXiv preprint arXiv:1310.7898, 2013
2013
Temporal Vertex Cover with a Sliding Time
EC Akrida, GB Mertzios, PG Spirakis, V Zamaraev
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20