default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAgelos Georgakopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2007
[b1]Agelos Georgakopoulos:
Topological paths and cycles in infinite graphs (Topologische Wege und Kreise in unendlichen Graphen). University of Hamburg, Germany, 2007
Journal Articles
- 2025
- [j30]Agelos Georgakopoulos:
On graph classes with minor-universal elements. J. Comb. Theory B 170: 56-81 (2025) - 2023
- [j29]Agelos Georgakopoulos
, Christoforos Panagiotis:
On the exponential growth rates of lattice animals and interfaces. Comb. Probab. Comput. 32(6): 912-955 (2023) - [j28]Agelos Georgakopoulos, Matthias Hamann:
The planar Cayley graphs are effectively enumerable II. Eur. J. Comb. 110: 103668 (2023) - 2022
- [j27]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The power of two choices for random walks. Comb. Probab. Comput. 31(1): 73-100 (2022) - 2021
- [j26]Agelos Georgakopoulos, Florian Lehner:
Invariant spanning double rays in amenable groups. Discret. Math. 344(2): 112207 (2021) - 2020
- [j25]Agelos Georgakopoulos, John Haslegrave:
Percolation on an infinitely generated group. Comb. Probab. Comput. 29(4): 587-615 (2020) - [j24]Johannes Carmesin, Agelos Georgakopoulos:
Every planar graph with the Liouville property is amenable. Random Struct. Algorithms 57(3): 706-729 (2020) - 2019
- [j23]Agelos Georgakopoulos, Matthias Hamann:
The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs. Comb. 39(5): 993-1019 (2019) - [j22]Agelos Georgakopoulos, John Haslegrave, Richard Montgomery:
Forcing large tight components in 3-graphs. Eur. J. Comb. 77: 57-67 (2019) - 2018
- [j21]Agelos Georgakopoulos, Stephan Wagner:
Subcritical Graph Classes Containing All Planar Graphs. Comb. Probab. Comput. 27(5): 763-773 (2018) - [j20]Agelos Georgakopoulos, Konstantinos Tyros:
The Bradley-Terry condition is L1-testable. Discret. Math. 341(4): 1171-1177 (2018) - 2017
- [j19]Bruno Federici, Agelos Georgakopoulos:
Hyperbolicity vs. Amenability for Planar Graphs. Discret. Comput. Geom. 58(1): 67-79 (2017) - [j18]Agelos Georgakopoulos:
On covers of graphs by Cayley graphs. Eur. J. Comb. 64: 57-65 (2017) - [j17]Agelos Georgakopoulos:
The planar cubic Cayley graphs of connectivity 2. Eur. J. Comb. 64: 152-169 (2017) - [j16]Agelos Georgakopoulos, Stephan Wagner:
Hitting Times, Cover Cost, and the Wiener Index of a Tree. J. Graph Theory 84(3): 311-326 (2017) - 2014
- [j15]Agelos Georgakopoulos, Peter Winkler:
New Bounds for Edge-Cover by Random Walk. Comb. Probab. Comput. 23(4): 571-584 (2014) - [j14]Agelos Georgakopoulos:
Characterising planar Cayley graphs and Cayley complexes in terms of group presentations. Eur. J. Comb. 36: 282-293 (2014) - 2013
- [j13]Agelos Georgakopoulos:
Delay Colourings of Cubic Graphs. Electron. J. Comb. 20(3): 45 (2013) - 2012
- [j12]Agelos Georgakopoulos, Peter Winkler:
Two-Color Babylon. Integers 12: G1 (2012) - 2011
- [j11]Agelos Georgakopoulos:
Graph topologies induced by edge lengths. Discret. Math. 311(15): 1523-1542 (2011) - [j10]Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel:
The Max-Flow Min-Cut theorem for countable networks. J. Comb. Theory B 101(1): 1-17 (2011) - 2010
- [j9]Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. Comb. 30(5): 521-532 (2010) - [j8]Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Sámal:
An Eberhard-Like Theorem for Pentagons and Heptagons. Discret. Comput. Geom. 44(4): 931-945 (2010) - 2009
- [j7]Agelos Georgakopoulos:
Topological Circles and Euler Tours in Locally Finite Graphs. Electron. J. Comb. 16(1) (2009) - [j6]Agelos Georgakopoulos, Philipp Sprüssel:
Geodetic Topological Cycles in Locally Finite Graphs. Electron. J. Comb. 16(1) (2009) - [j5]Agelos Georgakopoulos:
A short proof of Fleischner's theorem. Discret. Math. 309(23-24): 6632-6634 (2009) - [j4]Ron Aharoni, Agelos Georgakopoulos, Philipp Sprüssel:
Perfect matchings in r-partite r-graphs. Eur. J. Comb. 30(1): 39-42 (2009) - [j3]Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. Electron. Notes Discret. Math. 34: 279-281 (2009) - 2008
- [j2]Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Philipp Sprüssel:
Strongly Maximal Matchings in Infinite Graphs. Electron. J. Comb. 15(1) (2008) - 2007
- [j1]Agelos Georgakopoulos:
Connected but not path-connected subspaces of infinite graphs. Comb. 27(6): 683-698 (2007)
Conference and Workshop Papers
- 2020
- [c2]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
Choice and Bias in Random Walks. ITCS 2020: 76:1-76:19 - 2018
- [c1]Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen:
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. SODA 2018: 1645-1649
Editorship
- 2015
- [e1]Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko:
Surveys in Combinatorics 2015. London Mathematical Society Lecture Note Series 424, Cambridge University Press 2015, ISBN 9781316106853 [contents]
Informal and Other Publications
- 2024
- [i5]Agelos Georgakopoulos, Martin Winter:
On 2-complexes embeddable in 4-space, and the excluded minors of their underlying graphs. CoRR abs/2408.12681 (2024) - 2019
- [i4]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The Power of Two Choices for Random Walks. CoRR abs/1911.05170 (2019) - 2012
- [i3]Agelos Georgakopoulos:
A Tractable Variant of Cover Time. CoRR abs/1206.6605 (2012) - 2011
- [i2]Agelos Georgakopoulos, Peter Winkler:
New Bounds for Edge-Cover by Random Walk. CoRR abs/1109.6619 (2011) - [i1]Agelos Georgakopoulos, Peter Winkler:
Two-Color Babylon. CoRR abs/1111.4189 (2011)
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 2024-12-10 21:44 CET 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:
