Staff profile

After studying Maths in Patra, Greece, and then Computer Science in Liverpool, UK, Eleni joined the Department of Computer Science at Durham University in 2019.

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

Chapter in book

• Connected Subgraph Defense Games
  
  Akrida, E. C., Deligkas, A., Melissourgos, T., & Spirakis, P. G. (2019). Connected Subgraph Defense Games. In Algorithmic Game Theory (pp. 216-236). Springer Verlag. https://doi.org/10.1007/978-3-030-30473-7_15

Conference Paper

• A Pedagogical Framework for Developing Abstraction Skills
  
  Begum, M., Crossley, J., Strömbäck, F., Akrida, E., Alpizar-Chacon, I., Evans, A., Gross, J. B., Haglund, P., Lonati, V., Satyavolu, C., & Thorgeirsson, S. (2025). A Pedagogical Framework for Developing Abstraction Skills. In ITiCSE 2024: 2024 Working Group Reports on Innovation and Technology in Computer Science Education (pp. 258-299). ACM. https://doi.org/10.1145/3689187.3709613
• Designing a Pedagogical Framework for Developing Abstraction Skills
  
  Begum, M., Crossley, J., Strömbäck, F., Akrida, E., Alpizar-Chacon, I., Evans, A., Gross, J. B., Haglund, P., Lonati, V., Satyavolu, C., & Thorgeirsson, S. (2024). Designing a Pedagogical Framework for Developing Abstraction Skills. In ITiCSE 2024: Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 2 [Conference abstract] (pp. 769-770). ACM. https://doi.org/10.1145/3649405.3659533
• Paraphrase Generation and Identification at Paragraph-Level
  
  Al Saqaabi, A., Stewart, C., Akrida, E., & Cristea, A. I. (2024). Paraphrase Generation and Identification at Paragraph-Level. In Generative Intelligence and Intelligent Tutoring Systems (pp. 278-291). Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-63031-6_24
• Narrowing and Stretching: Addressing the Challenge of Multi-track Programming
  
  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 (pp. 1-4). ACM. https://doi.org/10.1145/3498343.3498344
• How fast can we reach a target vertex in stochastic temporal graphs?
  
  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) (pp. 131:1-131:14). Dagstuhl Publishing. https://doi.org/10.4230/lipics.icalp.2019.131
• The temporal explorer who returns to the base
  
  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. (pp. 13-24). Springer Verlag. https://doi.org/10.1007/978-3-030-17402-6_2
• Temporal vertex cover with a sliding time window
  
  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. (pp. 148:1-148:14). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/lipics.icalp.2018.148
• Temporal Flows in Temporal Networks
  
  Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, Łukasz, & Spirakis, P. G. (2017). Temporal Flows in Temporal Networks. In Algorithms and Complexity (pp. 43-54). Springer Verlag. https://doi.org/10.1007/978-3-319-57586-5_5
• On temporally connected graphs of small cost
  
  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. (pp. 84-96). Springer Verlag. https://doi.org/10.1007/978-3-319-28684-6_8
• On Verifying and Maintaining Connectivity of Interval Temporal Networks
  
  Akrida, E. C., & Spirakis, P. G. (2015). On Verifying and Maintaining Connectivity of Interval Temporal Networks. In Algorithms for Sensor Systems (pp. 142-154). Springer Verlag. https://doi.org/10.1007/978-3-319-28472-9_11
• Ephemeral networks with random availability of links: diameter and connectivity
  
  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. (pp. 267-276). Association for Computing Machinery (ACM). https://doi.org/10.1145/2612669.2612693

Conference Proceeding

• CEP '23: Proceedings of 7th Conference on Computing Education Practice
  
  Akrida, E., & Zarb, M. (Eds.). (2023). CEP ’23: Proceedings of 7th Conference on Computing Education Practice. https://doi.org/10.1145/3573260

Journal Article

• A Deep Learning Approach for Paragraph-Level Paraphrase Generation for Plagiarism Detection
  
  Saqaabi, A. A., Stewart, C., Akrida, E., & Cristea, A. I. (2025). A Deep Learning Approach for Paragraph-Level Paraphrase Generation for Plagiarism Detection. Neural Processing Letters, 57, 59. https://doi.org/10.1007/s11063-025-11771-9
• Connected Subgraph Defense Games
  
  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
• The temporal explorer who returns to the base
  
  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
• How fast can we reach a target vertex in stochastic temporal graphs?
  
  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
• Temporal vertex cover with a sliding time window
  
  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
• Temporal flows in temporal networks
  
  Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, Łukasz, & 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
• On Verifying and Maintaining Connectivity of Interval Temporal Networks
  
  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
• The complexity of optimal design of temporally connected graphs
  
  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
• Ephemeral networks with random availability of links: The case of fast networks
  
  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