← Search

George Skretas

4 accepted papers

2025

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs

AAAI 2025technical

Logistics and transportation networks require a large amount of resources to realise necessary connections between locations and minimizing these resources is a vital aspect of planning research. Since such networks have dynamic connections that are only available at specific times, intricate model…

Cited by 1SourcePDFScholar
2023

Minimizing Reachability Times on Temporal Graphs via Shifting Labels

IJCAI 2023poster

We study how we can accelerate the spreading of information in temporal graphs via shifting operations; a problem that captures real-world applications varying from information flows to distribution schedules. In a temporal graph there is a set of fixed vertices and the available connections between…

Cited by 14SourcePDFScholar
2023

Temporal Network Creation Games

IJCAI 2023poster

Most networks are not static objects, but instead they change over time. This observation has sparked rigorous research on temporal graphs within the last years. In temporal graphs, we have a fixed set of nodes and the connections between them are only available at certain time steps. This gives ris…

Cited by 8SourcePDFScholar