Follow
George Skretas
George Skretas
Verified email at hpi.de
Title
Cited by
Cited by
Year
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
462019
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
122020
Minimizing reachability times on temporal graphs via shifting labels
A Deligkas, E Eiben, G Skretas
arXiv preprint arXiv:2112.08797, 2021
102021
The complexity of growing a graph
GB Mertzios, O Michail, G Skretas, PG Spirakis, M Theofilatos
International Symposium on Algorithms and Experiments for Wireless Sensor …, 2022
92022
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
Information and Computation 299, 105171, 2024
72024
Temporal network creation games
D Bilň, S Cohen, T Friedrich, H Gawendowicz, N Klodt, P Lenzner, ...
arXiv preprint arXiv:2305.07494, 2023
52023
Temporal Network Creation Games: The Impact of Non-Locality and Terminals
D Bilň, S Cohen, T Friedrich, H Gawendowicz, N Klodt, P Lenzner, ...
arXiv preprint arXiv:2411.03973, 2024
2024
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
S Baguley, Y Maus, J Ruff, G Skretas
arXiv preprint arXiv:2410.11549, 2024
2024
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
A Deligkas, M Döring, E Eiben, TL Goldsmith, G Skretas, G Tennigkeit
arXiv preprint arXiv:2408.17107, 2024
2024
Towards Linear Spanners in All Temporal Cliques
S Angrick, B Bals, T Friedrich, H Gawendowicz, N Hastrich, N Klodt, ...
arXiv preprint arXiv:2402.13624, 2024
2024
How to Reduce Temporal Cliques to Find Sparse Spanners
S Angrick, B Bals, T Friedrich, H Gawendowicz, N Hastrich, N Klodt, ...
32nd Annual European Symposium on Algorithms (ESA 2024), 2024
2024
All for One and One for All: An O (1)-Musketeers Universal Transformation for Rotating Robots
M Connor, O Michail, G Skretas
3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), 2024
2024
Temporal Network Creation Games
N Klodt, P Lenzner, G Skretas
The system can't perform the operation now. Try again later.
Articles 1–13