Eleni C. Akrida

Orcid: 0000-0002-1126-1623

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Paraphrase Generation and Identification at Paragraph-Level.
Proceedings of the Generative Intelligence and Intelligent Tutoring Systems, 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 IEEE International Conference on Data Mining Workshops, 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

Connected Subgraph Defense Games.
Algorithmica, 2021

2020
Temporal vertex cover with a sliding time window.
J. Comput. Syst. Sci., 2020

How fast can we reach a target vertex in stochastic temporal graphs?
J. Comput. Syst. Sci., 2020

Matching in Stochastically Evolving Graphs.
CoRR, 2020

2019
On Verifying and Maintaining Connectivity of Interval Temporal Networks.
Parallel Process. Lett., 2019

Temporal flows in temporal networks.
J. Comput. Syst. Sci., 2019

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

2017
The Complexity of Optimal Design of Temporally Connected Graphs.
Theory Comput. Syst., 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

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...