Follow
Eleni C. Akrida
Eleni C. Akrida
Postdoctoral Research Associate, University of Liverpool
Verified email at liverpool.ac.uk - Homepage
Title
Cited by
Cited by
Year
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
722020
The complexity of optimal design of temporally connected graphs
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
Theory of Computing Systems 61, 907-944, 2017
502017
The temporal explorer who returns to the base
EC Akrida, GB Mertzios, PG Spirakis, C Raptopoulos
Journal of Computer and System Sciences 120, 179-193, 2021
392021
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
342019
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
272016
On temporally connected graphs of small cost
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
Approximation and Online Algorithms: 13th International Workshop, WAOA 2015 …, 2015
182015
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
182014
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
172020
On verifying and maintaining connectivity of interval temporal networks
EC Akrida, PG Spirakis
Parallel Processing Letters 29 (02), 1950009, 2019
132019
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
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
62019
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
32021
Connected subgraph defense games
EC Akrida, A Deligkas, T Melissourgos, PG Spirakis
International Symposium on Algorithmic Game Theory, 216-236, 2019
22019
A paraphrase identification approach in paragraph length texts
AAL Saqaabi, E Akrida, A Cristea, C Stewart
2022 IEEE International Conference on Data Mining Workshops (ICDMW), 358-367, 2022
12022
Narrowing and Stretching: Addressing the Challenge of Multi-track Programming
S Bradley, E Akrida
Proceedings of the 6th Conference on Computing Education Practice, 1-4, 2022
12022
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
A Paraphrase Identification Approach in Paragraph length texts
C Stewart, E Akrida, A Cristea
2022
Temporal Graphs
EC Akrida
PQDT-UK & Ireland, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–20