1 citations · 1 across the 4 of their papers we have counts for
9 papers
New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
Sophia Heck, Eleni Akrida
Modern networks are highly dynamic, and temporal graphs capture these changes through discrete edge appearances on a fixed vertex set, known in advance up to the graph's lifetime.…
Matching in Stochastically Evolving Graphs
Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios +2
This paper studies the maximum cardinality matching problem in stochastically evolving graphs. We formally define the arrival-departure model with stochastic departures. There, a g…
Connected Subgraph Defense Games
Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos +1
We study a security game over a network played between a and . Every attacker chooses, probabilistically, a node of the network to damage. The defender ch…
How fast can we reach a target vertex in stochastic temporal graphs?
Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas +3
Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature. Given a static underlying graph , a temporal graph on is a seque…
The temporal explorer who returns to the base
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
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. The aim…
Temporal Vertex Cover with a Sliding Time Window
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis +1
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 stat…
Temporal flows in Temporal networks
Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec +2
We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exi…
The complexity of optimal design of temporally connected graphs
Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios +1
We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of vertices, where each edge has an associated se…
Moving in temporal graphs with very sparse random availability of edges
Paul G. Spirakis, Eleni Ch. Akrida
In this work we consider temporal graphs, i.e. graphs, each edge of which is assigned a set of discrete time-labels drawn from a set of integers. The labels of an edge indicate the…