Eleni C. Akrida

Orcid: 0000-0002-1126-1623

According to our database1, Eleni C. Akrida authored at least 22 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Deep Learning Approach for Paragraph-Level Paraphrase Generation for Plagiarism Detection.
Neural Process. Lett., June, 2025

Multi-domain Evaluation of Auto-paraphrase Generation at Paragraph-Level: Insights for Education and Plagiarism Detection.
Proceedings of the Generative Systems and Intelligent Tutoring Systems, 2025

2024
Paraphrase Generation and Identification at Paragraph-Level.
Proceedings of the Generative Intelligence and Intelligent Tutoring Systems, 2024

A Pedagogical Framework for Developing Abstraction Skills.
Proceedings of the 2024 Working Group Reports on Innovation and Technology in Computer Science Education, 2024

Designing a Pedagogical Framework for Developing Abstraction Skills.
Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 2, 2024

2022
A Paraphrase Identification Approach in Paragraph length texts.
Proceedings of the 15th International Conference on Educational Data Mining, 2022

Narrowing and Stretching: Addressing the Challenge of Multi-track Programming.
Proceedings of the CEP 2022: Computing Education Practice 2022, 2022

2021
The temporal explorer who returns to the base.
J. Comput. Syst. Sci., 2021

2020
Matching in Stochastically Evolving Graphs.
CoRR, 2020

2019
Connected Subgraph Defense Games.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

The Temporal Explorer Who Returns to the Base.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Temporal Vertex Cover with a Sliding Time Window.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
The Complexity of Optimal Design of Temporally Connected Graphs.
Theory Comput. Syst., 2017

Temporal Flows in Temporal Networks.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Ephemeral networks with random availability of links: The case of fast networks.
J. Parallel Distributed Comput., 2016

Flows in Temporal networks.
CoRR, 2016

2015
Designing and Testing Temporally Connected Graphs.
CoRR, 2015

On Temporally Connected Graphs of Small Cost.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

On Verifying and Maintaining Connectivity of Interval Temporal Networks.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Ephemeral networks with random availability of links: diameter and connectivity.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013
Moving in temporal graphs with very sparse random availability of edges.
CoRR, 2013


  Loading...