default search action
George Skretas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j4]George B. Mertzios, Othon Michail, George Skretas
, Paul G. Spirakis, Michail Theofilatos:
The complexity of growing a graph. J. Comput. Syst. Sci. 147: 103587 (2025) - [c10]Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit:
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. AAAI 2025: 26498-26506 - [c9]Samuel Baguley, Yannic Maus, Janosch Ruff, George Skretas:
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring. STACS 2025: 13:1-13:20 - 2024
- [j3]Argyrios Deligkas
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. Inf. Comput. 299: 105171 (2024) - [c8]Sebastian Angrick
How to Reduce Temporal Cliques to Find Sparse Spanners. ESA 2024: 11:1-11:15 - [c7]Matthew Connor, Othon Michail, George Skretas:
All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots. SAND 2024: 9:1-9:20 - [i12]Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells:
Towards Linear Spanners in All Temporal Cliques. CoRR abs/2402.13624 (2024) - [i11]Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit:
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. CoRR abs/2408.17107 (2024) - [i10]Samuel Baguley, Yannic Maus, Janosch Ruff, George Skretas:
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring. CoRR abs/2410.11549 (2024) - [i9]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games: The Impact of Non-Locality and Terminals. CoRR abs/2411.03973 (2024) - [i8]Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas:
Catch Me If You Can: Finding the Source of Infections in Temporal Networks. CoRR abs/2412.10877 (2024) - [i7]Ben Bals, Michelle Döring, Nicolas Klodt, George Skretas:
Dynamic Network Discovery via Infection Tracing. CoRR abs/2412.10881 (2024) - 2023
- [c6]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas:
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. AAMAS 2023: 2222-2230 - [c5]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
Temporal Network Creation Games. IJCAI 2023: 2511-2519 - [c4]Argyrios Deligkas, Eduard Eiben, George Skretas
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. IJCAI 2023: 5333-5340 - [i6]Argyrios Deligkas
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. CoRR abs/2303.11703 (2023) - [i5]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games. CoRR abs/2305.07494 (2023) - 2022
- [j2]Othon Michail
Distributed computation and reconfiguration in actively dynamic networks. Distributed Comput. 35(2): 185-206 (2022) - [c3]George B. Mertzios
The Complexity of Growing a Graph. ALGOSENSORS 2022: 123-137 - 2021
- [i4]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. CoRR abs/2107.14126 (2021) - [i3]Argyrios Deligkas, Eduard Eiben, George Skretas:
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. CoRR abs/2112.08797 (2021) - 2020
- [c2]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. PODC 2020: 448-457 - [i2]Othon Michail, George Skretas, Paul G. Spirakis:
Distributed Computation and Reconfiguration in Actively Dynamic Networks. CoRR abs/2003.03355 (2020)
2010 – 2019
- 2019
- [j1]Othon Michail, George Skretas
On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102: 18-39 (2019) - 2017
- [c1]Othon Michail, George Skretas, Paul G. Spirakis:
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. ICALP 2017: 136:1-136:15 - [i1]Othon Michail, George Skretas, Paul G. Spirakis:
On the Transformation Capability of Feasible Mechanisms for Programmable Matter. CoRR abs/1703.04381 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-20 23:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: