The following pages link to Eleni C. Akrida (Q2009636):
Displayed 12 items.
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs? (Q2194859) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- Temporal flows in temporal networks (Q2424668) (← links)
- On Temporally Connected Graphs of Small Cost (Q2788993) (← links)
- (Q5002837) (← links)
- On Verifying and Maintaining Connectivity of Interval Temporal Networks (Q5087856) (← links)
- (Q5092333) (← links)
- The temporal explorer who returns to the base (Q5918316) (← links)
- Connected subgraph defense games (Q5919367) (← links)
- The temporal explorer who returns to the base (Q5919395) (← links)
- Connected subgraph defense games (Q5925537) (← links)