Prof. Dr. Tobias Friedrich

Dr. George Skretas

Chair for Algorithm Engineering
Hasso Plattner Institute

Office: K-2.07
E-Mail: Georgios.Skretas(at)hpi.de
Links: Homepage, Publications

Research Interests

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.


[ 2023 ] [ 2021 ] [ 2020 ] [ 2019 ] [ 2017 ]

2023 [ nach oben ]

  • Being an Influencer is Ha... - Download
    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

2021 [ nach oben ]

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

2020 [ nach oben ]

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

2019 [ nach oben ]

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

2017 [ nach oben ]

  • On the Transformation Cap... - Download
    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