Eleni C. Akrida
Eleni C. Akrida
Postdoctoral Research Associate, University of Liverpool
Потвърден имейл адрес: liverpool.ac.uk - Начална страница
ЗаглавиеПозоваванияГодина
Ephemeral networks with random availability of links: diameter and connectivity
EC Akrida, L Gasieniec, GB Mertzios, PG Spirakis
Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014
182014
On temporally connected graphs of small cost
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
International Workshop on Approximation and Online Algorithms, 84-96, 2015
172015
The complexity of optimal design of temporally connected graphs
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
Theory of Computing Systems 61 (3), 907-944, 2017
162017
Ephemeral networks with random availability of links: The case of fast networks
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
Journal of Parallel and Distributed Computing 87, 109-120, 2016
142016
Temporal vertex cover with a sliding time window
EC Akrida, GB Mertzios, PG Spirakis, V Zamaraev
Journal of Computer and System Sciences 107, 108-123, 2020
132020
Temporal flows in temporal networks
EC Akrida, J Czyzowicz, L Gąsieniec, Ł Kuszner, PG Spirakis
Journal of Computer and System Sciences 103, 46-60, 2019
122019
On verifying and maintaining connectivity of interval temporal networks
EC Akrida, PG Spirakis
International Symposium on Algorithms and Experiments for Wireless Sensor …, 2015
62015
The temporal explorer who returns to the base
EC Akrida, GB Mertzios, PG Spirakis
International Conference on Algorithms and Complexity, 13-24, 2019
42019
How fast can we reach a target vertex in stochastic temporal graphs?
EC Akrida, GB Mertzios, S Nikoletseas, C Raptopoulos, PG Spirakis, ...
arXiv preprint arXiv:1903.03636, 2019
42019
Flows in temporal networks
EC Akrida, J Czyzowicz, L Gasieniec, L Kuszner, PG Spirakis
CoRR abs/1606.01091, 2016
22016
Designing and Testing Temporally Connected Graphs
EC Akrida, L Gąsieniec, GB Mertzios, PG Spirakis
arXiv preprint arXiv:1502.04579, 2015
12015
On Verifying and Maintaining Connectivity of Interval Temporal Networks
EC Akrida, PG Spirakis
Parallel Processing Letters 29 (02), 1950009, 2019
2019
Connected Subgraph Defense Games
EC Akrida, A Deligkas, T Melissourgos, PG Spirakis
arXiv preprint arXiv:1906.02774, 2019
2019
How fast can we reach a target vertex in
EC Akrida, GB Mertzios, S Nikoletseas, C Raptopoulos, PG Spirakis, ...
2019
Version of attached file
EC Akrida, L Gasieniec, GB Mertzios, PG Spirakis
2017
Temporal Graphs
E Akrida
University of Liverpool, 2016
2016
Moving in temporal graphs with very sparse random availability of edges
PG Spirakis, EC Akrida
arXiv preprint arXiv:1310.7898, 2013
2013
Temporal Vertex Cover with a Sliding Time
EC Akrida, GB Mertzios, PG Spirakis, V Zamaraev
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–18