| On the transformation capability of feasible mechanisms for programmable matter O Michail, G Skretas, PG Spirakis Journal of Computer and System Sciences 102, 18-39, 2019 | 24 | 2019 |
| On the transformation capability of feasible mechanisms for programmable matter O Michail, G Skretas, PG Spirakis arXiv preprint arXiv:1703.04381, 2017 | 12 | 2017 |
| Distributed computation and reconfiguration in actively dynamic networks O Michail, G Skretas, PG Spirakis Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 9 | 2020 |
| The complexity of growing a graph GB Mertzios, O Michail, G Skretas, PG Spirakis, M Theofilatos Algorithmics of Wireless Networks: 18th International Symposium on …, 2022 | 4 | 2022 |
| Minimizing reachability times on temporal graphs via shifting labels A Deligkas, E Eiben, G Skretas arXiv preprint arXiv:2112.08797, 2021 | 3 | 2021 |
| Temporal Network Creation Games D Bilň, S Cohen, T Friedrich, H Gawendowicz, N Klodt, P Lenzner, ... arXiv preprint arXiv:2305.07494, 2023 | | 2023 |
| Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source A Deligkas, M Döring, E Eiben, TL Goldsmith, G Skretas arXiv preprint arXiv:2303.11703, 2023 | | 2023 |
