George Skretas

35 papers A* 7A 4C 1Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
FO and MSO Model Checking on Temporal Graphs.
CoRR
Michelle Döring, Jessica A. Enright, Laura Larios-Jones, George Skretas
2026 A* conf
Temporal Exploration of Random Spanning Tree Models.
SODA
Samuel Baguley, Andreas Göbel, Nicolas Klodt, George Skretas, John Sylvester, Viktor Zamaraev
2026 J jnl
Temporal Network Creation Games: The Impact of Flexible Labels.
CoRR
Hans Gawendowicz, Nicolas Klodt, Aleksandrs Morgensterns, George Skretas
2025 J jnl
All for one and one for all: An O(1)-musketeers generic transformation for rotating robots.
Theor. Comput. Sci.
Matthew Connor, Othon Michail, George Skretas
2025 A* conf
Dynamic Network Discovery via Infection Tracing.
IJCAI
Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas
2025 A* conf
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs.
AAAI
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2025 A conf
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring.
STACS
Samuel Baguley, Yannic Maus, Janosch Ruff, George Skretas
2025 J jnl
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs.
CoRR
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2025 J jnl
Temporal Exploration of Random Spanning Tree Models.
CoRR
Samuel Baguley, Andreas Göbel, Nicolas Klodt, George Skretas, John Sylvester, Viktor Zamaraev
2025 J jnl
Temporal Graph Reconfiguration for Always-Connected Graphs.
CoRR
Paul Sievers, George Skretas, Georg Tennigkeit
2025 A conf
Temporal Network Creation Games: The Impact of Non-Locality and Terminals.
AAMAS
Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2025 J jnl
The complexity of growing a graph.
J. Comput. Syst. Sci.
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
2024 — conf
All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots.
SAND
Matthew Connor, Othon Michail, George Skretas
2024 J jnl
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source.
Inf. Comput.
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2024 J jnl
Catch Me If You Can: Finding the Source of Infections in Temporal Networks.
CoRR
Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas
2024 J jnl
Dynamic Network Discovery via Infection Tracing.
CoRR
Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas
2024 J jnl
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs.
CoRR
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
2024 A conf
How to Reduce Temporal Cliques to Find Sparse Spanners.
ESA
Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells
2024 J jnl
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring.
CoRR
Samuel Baguley, Yannic Maus, Janosch Ruff, George Skretas
2024 J jnl
Temporal Network Creation Games: The Impact of Non-Locality and Terminals.
CoRR
Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2024 J jnl
Towards Linear Spanners in All Temporal Cliques.
CoRR
Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells
2023 A conf
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source.
AAMAS
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2023 J jnl
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source.
CoRR
Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
2023 A* conf
Minimizing Reachability Times on Temporal Graphs via Shifting Labels.
IJCAI
Argyrios Deligkas, Eduard Eiben, George Skretas
2023 A* conf
Temporal Network Creation Games.
IJCAI
Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2023 J jnl
Temporal Network Creation Games.
CoRR
Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2022 J jnl
Distributed computation and reconfiguration in actively dynamic networks.
Distributed Comput.
Othon Michail, George Skretas, Paul G. Spirakis
2022 C conf
The Complexity of Growing a Graph.
ALGOSENSORS
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
2021 J jnl
Minimizing Reachability Times on Temporal Graphs via Shifting Labels.
CoRR
Argyrios Deligkas, Eduard Eiben, George Skretas
2021 J jnl
The Complexity of Growing a Graph.
CoRR
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
2020 A* conf
Distributed Computation and Reconfiguration in Actively Dynamic Networks.
PODC
Othon Michail, George Skretas, Paul G. Spirakis
2020 J jnl
Distributed Computation and Reconfiguration in Actively Dynamic Networks.
CoRR
Othon Michail, George Skretas, Paul G. Spirakis
2019 J jnl
On the transformation capability of feasible mechanisms for programmable matter.
J. Comput. Syst. Sci.
Othon Michail, George Skretas, Paul G. Spirakis
2017 A* conf
On the Transformation Capability of Feasible Mechanisms for Programmable Matter.
ICALP
Othon Michail, George Skretas, Paul G. Spirakis
2017 J jnl
On the Transformation Capability of Feasible Mechanisms for Programmable Matter.
CoRR
Othon Michail, George Skretas, Paul G. Spirakis