On the transformation capability of feasible mechanisms for programmable matter. - Othon Michail; George Skretas; Paul G. Spirakis (J. Comput. Syst. Sci., 2019)

Distributed computation and reconfiguration in actively dynamic networks. - Othon Michail; George Skretas; Paul G. Spirakis (Distributed Comput., 2022)

Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. - Argyrios Deligkas; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas (AAMAS, 2023)

Temporal Network Creation Games. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Hans Gawendowicz; Nicolas Klodt; Pascal Lenzner; George Skretas (IJCAI, 2023)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels. - Argyrios Deligkas; Eduard Eiben; George Skretas (IJCAI, 2023)

How to Reduce Temporal Cliques to Find Sparse Spanners. - Sebastian Angrick; Ben Bals; Tobias Friedrich 001; Hans Gawendowicz; Niko Hastrich; Nicolas Klodt; Pascal Lenzner; Jonas Schmidt 002; George Skretas; Armin Wells (ESA, 2024)

All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots. - Matthew Connor; Othon Michail; George Skretas (SAND, 2024)

Towards Linear Spanners in All Temporal Cliques. - Sebastian Angrick; Ben Bals; Tobias Friedrich 001; Hans Gawendowicz; Niko Hastrich; Nicolas Klodt; Pascal Lenzner; Jonas Schmidt 002; George Skretas; Armin Wells (CoRR, 2024)

Catch Me If You Can: Finding the Source of Infections in Temporal Networks. - Ben Bals; Michelle Döring; Nicolas Klodt; George Skretas (CoRR, 2024)

Dynamic Network Discovery via Infection Tracing. - Ben Bals; Michelle Döring; Nicolas Klodt; George Skretas (CoRR, 2024)

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. - Argyrios Deligkas; Michelle Döring; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas (Inf. Comput., 2024)

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. - Argyrios Deligkas; Michelle Döring; Eduard Eiben; Tiger-Lily Goldsmith; George Skretas; Georg Tennigkeit (AAAI, 2025)

Temporal Network Creation Games: The Impact of Non-Locality and Terminals. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Hans Gawendowicz; Nicolas Klodt; Pascal Lenzner; George Skretas (AAMAS, 2025)

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring. - Samuel Baguley; Yannic Maus; Janosch Ruff; George Skretas (STACS, 2025)

The complexity of growing a graph. - George B. Mertzios; Othon Michail; George Skretas; Paul G. Spirakis; Michail Theofilatos (J. Comput. Syst. Sci., 2025)

All for one and one for all: An O(1)-musketeers generic transformation for rotating robots. - Matthew Connor; Othon Michail; George Skretas (Theor. Comput. Sci., 2025)

Temporal Exploration of Random Spanning Tree Models. - Samuel Baguley; Andreas Göbel 001; Nicolas Klodt; George Skretas; John Sylvester 001; Viktor Zamaraev (CoRR, 2025)