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 (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. (2024, July). A Pedagogical Framework for Developing Abstraction Skills. Presented at Annual Conference on Innovation and Technology in Computer Science Education, ITiCSE, Milan, Italy
• 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, July). Designing a Pedagogical Framework for Developing Abstraction Skills. Presented at ITiCSE 2024: Innovation and Technology in Computer Science Education, Milan Italy
• Paraphrase Generation and Identification at Paragraph-Level
  Al Saqaabi, A., Stewart, C., Akrida, E., & Cristea, A. I. (2024, June). Paraphrase Generation and Identification at Paragraph-Level. Presented at Generative Intelligence and Intelligent Tutoring Systems ITS 2024, Thessaloniki, Greece
• Narrowing and Stretching: Addressing the Challenge of Multi-track Programming
  Bradley, S., & Akrida, E. (2022, December). Narrowing and Stretching: Addressing the Challenge of Multi-track Programming. Presented at Computing Education Practice 2022, Durham, England
• 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, July). How fast can we reach a target vertex in stochastic temporal graphs?. Presented at 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Patras, Greece
• The temporal explorer who returns to the base
  Akrida, E., Mertzios, G., & Spirakis, P. (2019, December). The temporal explorer who returns to the base. Presented at 11th International Conference on Algorithms and Complexity (CIAC 2019), Rome, Italy
• Temporal vertex cover with a sliding time window
  Akrida, E., Mertzios, G., Spirakis, P., & Zamaraev, V. (2018, July). Temporal vertex cover with a sliding time window. Presented at 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)., Prague, Czech Republic
• Temporal Flows in Temporal Networks
  Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, Ł., & Spirakis, P. G. (2017, December). Temporal Flows in Temporal Networks. Presented at 10th International Conference in Algorithms and Complexity, CIAC 2017, Athens, Greece
• On temporally connected graphs of small cost
  Akrida, E., Gasieniec, L., Mertzios, G., & Spirakis, P. (2015, September). On temporally connected graphs of small cost. Presented at 13th Workshop on Approximation and Online Algorithms (WAOA), Patras, Greece
• On Verifying and Maintaining Connectivity of Interval Temporal Networks
  Akrida, E. C., & Spirakis, P. G. (2015, December). On Verifying and Maintaining Connectivity of Interval Temporal Networks. Presented at Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS), Patras, Greece
• Ephemeral networks with random availability of links: diameter and connectivity
  Akrida, E., Gasieniec, L., Mertzios, G., & Spirakis, P. (2014, June). Ephemeral networks with random availability of links: diameter and connectivity. Presented at Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures (SPAA), Prague, Czech Republic

Conference Proceeding

• CEP '23: Proceedings of 7th Conference on Computing Education Practice
  (2023, January). CEP '23: Proceedings of 7th Conference on Computing Education Practice. Presented at CEP 2023, Durham, United Kingdom

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, Ł., & 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