Skip to main content

Research Repository

Advanced Search

All Outputs (11)

Designing a Pedagogical Framework for Developing Abstraction Skills (2024)
Presentation / Conference Contribution
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 (2024)
Presentation / Conference Contribution
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 (2022)
Presentation / Conference Contribution
Bradley, S., & Akrida, E. (2022, December). Narrowing and Stretching: Addressing the Challenge of Multi-track Programming. Presented at Computing Education Practice 2022, Durham, England

Given the different amount of programming experience that students have arriving at university, some universities have introduced alternative multiple streams to teach programming. This approach was exemplified by Harvey Mudd College, who successfull... Read More about Narrowing and Stretching: Addressing the Challenge of Multi-track Programming.

How fast can we reach a target vertex in stochastic temporal graphs? (2019)
Presentation / Conference Contribution
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

Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature, in the sense that the network structure undergoes discrete changes over time. Given a static underlying graph G=(V,E), a temporal graph on G is a s... Read More about How fast can we reach a target vertex in stochastic temporal graphs?.

The temporal explorer who returns to the base (2019)
Presentation / Conference Contribution
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

In this paper we study the problem of exploring a temporal graph (i.e. a graph that changes over time), in the fundamental case where the underlying static graph is a star on n vertices. The aim of the exploration problem in a temporal star is to fin... Read More about The temporal explorer who returns to the base.

Temporal vertex cover with a sliding time window (2018)
Presentation / Conference Contribution
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

Modern, inherently dynamic systems are usually characterized by a network structure, i.e. an underlying graph topology, which is subject to discrete changes over time. Given a static underlying graph G, a temporal graph can be represented via an assi... Read More about Temporal vertex cover with a sliding time window.

Temporal Flows in Temporal Networks (2017)
Presentation / Conference Contribution
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

We introduce temporal flows on temporal networks [17, 19], i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exists after some time. Our flow model is new and differs from t... Read More about Temporal Flows in Temporal Networks.

On temporally connected graphs of small cost (2016)
Presentation / Conference Contribution
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

We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of n vertices, where each edge has an associated set of discrete availability instances (labels). A journey from vertex u t... Read More about On temporally connected graphs of small cost.

On Verifying and Maintaining Connectivity of Interval Temporal Networks (2015)
Presentation / Conference Contribution
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

An interval temporal network is, informally speaking, a network whose links change with time. The term interval means that a link may exist for one or more time intervals, called availability intervals of the link, after which it does not exist (unti... Read More about On Verifying and Maintaining Connectivity of Interval Temporal Networks.

Ephemeral networks with random availability of links: diameter and connectivity (2014)
Presentation / Conference Contribution
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

In this work we consider temporal networks, the links of which are available only at random times (randomly available temporal networks). Our networks are {\em ephemeral}: their links appear sporadically, only at certain times, within a given maximum... Read More about Ephemeral networks with random availability of links: diameter and connectivity.