George Skretas

According to our database, George Skretas authored at least 15 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The complexity of growing a graph.

George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos

J. Comput. Syst. Sci., 2025

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring.

Samuel Baguley, Yannic Maus, Janosch Ruff, George Skretas

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

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

Dynamic Network Discovery via Infection Tracing.

Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas

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

Temporal Network Creation Games: The Impact of Non-Locality and Terminals.

Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas

CoRR, 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

CoRR, 2024

Towards Linear Spanners in All Temporal Cliques.

Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells

CoRR, 2024

All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots.

Matthew Connor, Othon Michail, George Skretas

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

How to Reduce Temporal Cliques to Find Sparse Spanners.

Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Minimizing Reachability Times on Temporal Graphs via Shifting Labels.

Argyrios Deligkas, Eduard Eiben, George Skretas

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Temporal Network Creation Games.

Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

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

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Distributed computation and reconfiguration in actively dynamic networks.

Othon Michail, George Skretas, Paul G. Spirakis

Distributed Comput., 2022

2019

On the transformation capability of feasible mechanisms for programmable matter.

Othon Michail, George Skretas, Paul G. Spirakis

J. Comput. Syst. Sci., 2019