Staff profile
Overview
Affiliation | Telephone |
---|---|
Associate Professor in the Department of Computer Science | +44 (0) 191 33 48386 |
Biography
After studying Maths in Patra, Greece, and then Computer Science in Liverpool, UK, Eleni joined Durham University as an Assistant Professor (Education) in the Department of Computer Science.
Since 2020, she is the Director of Undergraduate Studies in the department.
Curriculum Vitae
Eleni's CV can be found here.
Research Interests
- Computer Science education
- Probabilistic methods in algorithms
- Algorithms and complexity of graph theoretic problems
- Optimization problems in dynamic networks
Research Groups
- Pedagogical Innovations in Computer Science
- Algorithms and Complexity
Awarded Grants
- A Theoretical Computer Science Commons in the hybrid era - CPHC Special Project 2022/23
Publications
Chapter in book
Conference Paper
- Bradley, S., & Akrida, E. (2022). Narrowing and Stretching: Addressing the Challenge of Multi-track Programming. In Proceedings of the 6th Conference on Computing Education Practice CEP 2022 (1-4). https://doi.org/10.1145/3498343.3498344
- Akrida, E. C., Mertzios, G. B., Nikoletseas, S., Christoforos, R., Spirakis, P. G., & Zamaraev, V. (2019). How fast can we reach a target vertex in stochastic temporal graphs?. In C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Eds.), 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) (131:1-131:14). https://doi.org/10.4230/lipics.icalp.2019.131
- Akrida, E., Mertzios, G., & Spirakis, P. (2019). The temporal explorer who returns to the base. In P. Heggernes (Ed.), Algorithms and Complexity (CIAC 2019); 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019 ; proceedings (13-24). https://doi.org/10.1007/978-3-030-17402-6_2
- Akrida, E., Mertzios, G., Spirakis, P., & Zamaraev, V. (2018). Temporal vertex cover with a sliding time window. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) : Prague, Czech Republic, July 9-13, 2018 ; proceedings (148:1-148:14). https://doi.org/10.4230/lipics.icalp.2018.148
- Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, Ł., & Spirakis, P. G. (2017). Temporal Flows in Temporal Networks. In Algorithms and Complexity (43-54). https://doi.org/10.1007/978-3-319-57586-5_5
- Akrida, E., Gasieniec, L., Mertzios, G., & Spirakis, P. (2016). On temporally connected graphs of small cost. In Approximation and online algorithms : 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised selected papers (84-96). https://doi.org/10.1007/978-3-319-28684-6_8
- Akrida, E. C., & Spirakis, P. G. (2015). On Verifying and Maintaining Connectivity of Interval Temporal Networks. In Algorithms for Sensor Systems (142-154). https://doi.org/10.1007/978-3-319-28472-9_11
- Akrida, E., Gasieniec, L., Mertzios, G., & Spirakis, P. (2014). Ephemeral networks with random availability of links: diameter and connectivity. In Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures (267-276). https://doi.org/10.1145/2612669.2612693
Conference Proceeding
Journal Article
- Akrida, E. C., Deligkas, A., Melissourgos, T., & Spirakis, P. G. (2021). Connected Subgraph Defense Games. Algorithmica, 83(11), 3403-3431. https://doi.org/10.1007/s00453-021-00858-z
- Akrida, E., Mertzios, G., Spirakis, P., & Raptopoulos, C. (2021). The temporal explorer who returns to the base. Journal of Computer and System Sciences, 120, 179-193. https://doi.org/10.1016/j.jcss.2021.04.001
- Akrida, E. C., Mertzios, G. B., Nikoletseas, S., Raptopoulos, C., Spirakis, P. G., & Zmaraev, V. (2020). How fast can we reach a target vertex in stochastic temporal graphs?. Journal of Computer and System Sciences, 114, 65-83. https://doi.org/10.1016/j.jcss.2020.05.005
- Akrida, E., Mertzios, G., Spirakis, P., & Zamaraev, V. (2020). Temporal vertex cover with a sliding time window. Journal of Computer and System Sciences, 107, 108-123. https://doi.org/10.1016/j.jcss.2019.08.002
- Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, Ł., & Spirakis, P. G. (2019). Temporal flows in temporal networks. Journal of Computer and System Sciences, 103, 46-60. https://doi.org/10.1016/j.jcss.2019.02.003
- Akrida, E. C., & Spirakis, P. G. (2019). On Verifying and Maintaining Connectivity of Interval Temporal Networks. Parallel Processing Letters, 29(02), Article 1950009. https://doi.org/10.1142/s0129626419500099
- Akrida, E., Gasieniec, L., Mertzios, G., & Spirakis, P. (2017). The complexity of optimal design of temporally connected graphs. Theory of Computing Systems, 61(3), 907-944. https://doi.org/10.1007/s00224-017-9757-x
- Akrida, E., Gąsieniec, L., Mertzios, G., & Spirakis, P. (2016). Ephemeral networks with random availability of links: The case of fast networks. Journal of Parallel and Distributed Computing, 87, 109-120. https://doi.org/10.1016/j.jpdc.2015.10.002
Supervision students
Arwa Al saqaabi
Postgraduate Student