Akrida, Eleni C.

1. The temporal explorer who returns to the base
   2018/05/12 by Akrida, Eleni C., Mertzios, George B., Spirakis, Paul G. · 5 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
2. The complexity of optimal design of temporally connected graphs
   2015/02/16 by Eleni C. Akrida, Akrida, Eleni C., Leszek Gąsieniec +5 · 2 citations
   Computer Science · #Caching and Content Delivery #Discrete Mathematics (cs.DM) #Distributed systems and fault tolerance #FOS: Computer and information sciences #G.2.2 #Opportunistic and Delay-Tolerant Networks
3. Temporal Vertex Cover with a Sliding Time Window
   2018/02/20 by Akrida, Eleni C., Mertzios, George B., Spirakis, Paul G. +1 · 2 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
4. How fast can we reach a target vertex in stochastic temporal graphs?
   2019/03/08 by Akrida, Eleni C., Mertzios, George B., Nikoletseas, Sotiris +3 · 2 citations
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences