| 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 | 55 | 2020 |
| 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 | 41 | 2017 |
| 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 | 28 | 2019 |
| 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 | 27 | 2016 |
| The temporal explorer who returns to the base EC Akrida, GB Mertzios, PG Spirakis Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome …, 2019 | 22 | 2019 |
| 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 | 17 | 2015 |
| 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 | 16 | 2014 |
| On verifying and maintaining connectivity of interval temporal networks EC Akrida, PG Spirakis Parallel Processing Letters 29 (02), 1950009, 2019 | 13 | 2019 |
| 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 | 10 | 2020 |
| 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 | 9 | 2019 |
| 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 | 8 | 2016 |
| Flows in temporal networks EC Akrida, J Czyzowicz, L Gasieniec, L Kuszner, PG Spirakis CoRR abs/1606.01091, 2016 | 4 | 2016 |
| Connected subgraph defense games EC Akrida, A Deligkas, T Melissourgos, PG Spirakis Algorithmica 83 (11), 3403-3431, 2021 | 3 | 2021 |
| Narrowing and Stretching: Addressing the Challenge of Multi-track Programming S Bradley, E Akrida Computing Education Practice 2022, 1-4, 2022 | 1 | 2022 |
| Matching in stochastically evolving graphs EC Akrida, A Deligkas, GB Mertzios, PG Spirakis, V Zamaraev arXiv preprint arXiv:2005.08263, 2020 | 1 | 2020 |
| Designing and testing temporally connected graphs EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis arXiv preprint arXiv:1502.04579, 2015 | 1 | 2015 |
| 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 | | 2022 |
| A Paraphrase Identification Approach in Paragraph length texts C Stewart, E Akrida, A Cristea | | 2022 |
| 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 |
Paul SpirakisProfessor of Computer Science U. Liverpool and U. PatrasVerified email at liverpool.ac.uk
