Dr. Georgios Skretas

Chair for Algorithm Engineering
Hasso Plattner Institute
 

Office: K-2.07
Tel.:
E-Mail: Georgios.Skretas(at)hpi.de

My interests lie around static and dynamic networks and how they work. Modern networks are become more complex and there is an immediate need to study how their behaviour in both centralized and distributed settings. The main topics I am currently working in are:
 

  • Graph Theory
  • Distributed Algorithms
  • Dynamic/Temporal Graphs
  • Programmable Matter

Short CV

2018-2022: PhD degree in computer science from University of Liverpool.
 

2010-2018: Integrated Master Degree from the Computer Engineering and Informatics Department, University of Patras.

Publications

2025

  •  

    Baguley, Samuel; Maus, Yannic Maus; Ruff, Janosch; Skretas, George Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for ColouringInternational Symposium on Theoretical Aspects of Computer Science (STACS) 2025: 13:1–13:20

    [ ] [ ] [ URL ] [ DOI ] [ Download ]

  •  

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

    [ ] [ ] [ Download ]

2024

  •  

    Angrick, Sebastian; Bals, Ben; Friedrich, Tobias; Gawendowicz, Hans; Hastrich, Niko; Klodt, Nicolas; Lenzner, Pascal; Schmidt, Jonas; Skretas, George; Wells, Armin How to Reduce Temporal Cliques to Find Sparse SpannersEuropean Symposium on Algorithms (ESA) 2024

    [ ]

2023

  •  

    Deligkas, Argyrios; Eiben, Eduard; Goldsmith, Tiger-Lily; Skretas, George Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed SourceAutonomous Agents and Multi-Agent Systems (AAMAS) 2023: 2222–2230

    [ ] [ ] [ URL ] [ Download ]

  •  

    Bilò, Davide; Cohen, Sarel; Friedrich, Tobias; Gawendowicz, Hans; Klodt, Nicolas; Lenzner, Pascal; Skretas, George Temporal Network Creation GamesInternational Joint Conference on Artificial Intelligence (IJCAI) 2023: 2511–2519

    [ ] [ ] [ URL ] [ DOI ] [ Download ]

  •  

    Deligkas, Argyrios; Eiben, Eduard; Skretas, George Minimizing Reachability Times on Temporal Graphs via Shifting LabelsInternational Joint Conference on Artificial Intelligence (IJCAI) 2023: 5333–5340

    [ ] [ ] [ URL ] [ DOI ] [ Download ]

2022

  •  

    Mertzios, George B; Michail, Othon; Skretas, George; Spirakis, Paul G.; Theofilatos, Michail The Complexity of Growing a GraphInternational Symposium on Algorithms and Experiments for Wireless Sensor Networks 2022: 123–137

    [ ] [ DOI ] [ Download ]

2021

  •  

    Michail, Othon; Skretas, George; Spirakis, Paul G. Distributed computation and reconfiguration in actively dynamic networksDistributed Computing 2021: 185–206

    [ ] [ URL ] [ DOI ] [ Download ]

2020

  •  

    Michail, Othon; Skretas, George; Spirakis, G. Paul Distributed Computation and Reconfiguration in Actively Dynamic NetworksPrinciples of Distributed Computing (PODC) 2020: 448–457

    [ ] [ ] [ URL ] [ DOI ] [ Download ]

2019

  •  

    Michail, Othon; Skretas, George; Spirakis, G. Paul On the transformation capability of feasible mechanisms for programmable matterComputer and System Sciences 2019: 18–39

    [ ] [ ] [ URL ] [ DOI ] [ Download ]

2017

  •  

    Michail, Othon; Skretas, George; Spirakis, G. Paul On the Transformation Capability of Feasible Mechanisms for Programmable MatterInternational Colloquium on Automata, Languages and Programming (ICALP) 2017: 136:1–136:15

    [ ] [ ] [ URL ] [ DOI ] [ Download ]