Agelos Georgakopoulos

45 papers A* 2A 1Journal 40

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Compact Metric Spaces with Infinite Cop Number. Discret. Comput. Geom. Agelos Georgakopoulos
2025	J	`jnl`	Excluding K CoRR Sandra Albrechtsen, Marc Distel, Agelos Georgakopoulos
2025	J	`jnl`	Graph Minors and Metric Spaces. Comb. Agelos Georgakopoulos, Panos Papasoglu
2025	J	`jnl`	On graph classes with minor-universal elements. J. Comb. Theory B Agelos Georgakopoulos
2025	A*	`conf`	Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs. SoCG James Davies, Agelos Georgakopoulos, Meike Hatzel, Rose McCarty
2025	J	`jnl`	Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs. CoRR James Davies, Agelos Georgakopoulos, Meike Hatzel, Rose McCarty
2025	J	`jnl`	The Excluded Minors for Embeddability into a Compact Surface. Comb. Agelos Georgakopoulos
2024	J	`jnl`	On 2-complexes embeddable in 4-space, and the excluded minors of their underlying graphs. CoRR Agelos Georgakopoulos, Martin Winter
2023	J	`jnl`	On the exponential growth rates of lattice animals and interfaces. Comb. Probab. Comput. Agelos Georgakopoulos, Christoforos Panagiotis
2023	J	`jnl`	The planar Cayley graphs are effectively enumerable II. Eur. J. Comb. Agelos Georgakopoulos, Matthias Hamann
2022	J	`jnl`	The power of two choices for random walks. Comb. Probab. Comput. Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
2021	J	`jnl`	Invariant spanning double rays in amenable groups. Discret. Math. Agelos Georgakopoulos, Florian Lehner
2020	A	`conf`	Choice and Bias in Random Walks. ITCS Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
2020	J	`jnl`	Every planar graph with the Liouville property is amenable. Random Struct. Algorithms Johannes Carmesin, Agelos Georgakopoulos
2020	J	`jnl`	Percolation on an infinitely generated group. Comb. Probab. Comput. Agelos Georgakopoulos, John Haslegrave
2019	J	`jnl`	Forcing large tight components in 3-graphs. Eur. J. Comb. Agelos Georgakopoulos, John Haslegrave, Richard Montgomery
2019	J	`jnl`	The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs. Comb. Agelos Georgakopoulos, Matthias Hamann
2019	J	`jnl`	The Power of Two Choices for Random Walks. CoRR Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
2018	A*	`conf`	A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. SODA Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen
2018	J	`jnl`	Subcritical Graph Classes Containing All Planar Graphs. Comb. Probab. Comput. Agelos Georgakopoulos, Stephan Wagner
2018	J	`jnl`	The Bradley-Terry condition is L1-testable. Discret. Math. Agelos Georgakopoulos, Konstantinos Tyros
2017	J	`jnl`	Hitting Times, Cover Cost, and the Wiener Index of a Tree. J. Graph Theory Agelos Georgakopoulos, Stephan Wagner
2017	J	`jnl`	Hyperbolicity vs. Amenability for Planar Graphs. Discret. Comput. Geom. Bruno Federici, Agelos Georgakopoulos
2017	J	`jnl`	On covers of graphs by Cayley graphs. Eur. J. Comb. Agelos Georgakopoulos
2017	J	`jnl`	The planar cubic Cayley graphs of connectivity 2. Eur. J. Comb. Agelos Georgakopoulos
2015	—	`book`	Surveys in Combinatorics 2015 Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko
2014	J	`jnl`	Characterising planar Cayley graphs and Cayley complexes in terms of group presentations. Eur. J. Comb. Agelos Georgakopoulos
2014	J	`jnl`	New Bounds for Edge-Cover by Random Walk. Comb. Probab. Comput. Agelos Georgakopoulos, Peter Winkler
2013	J	`jnl`	Delay Colourings of Cubic Graphs. Electron. J. Comb. Agelos Georgakopoulos
2012	J	`jnl`	A Tractable Variant of Cover Time CoRR Agelos Georgakopoulos
2012	J	`jnl`	Two-Color Babylon. Integers Agelos Georgakopoulos, Peter Winkler
2011	J	`jnl`	Graph topologies induced by edge lengths. Discret. Math. Agelos Georgakopoulos
2011	J	`jnl`	New Bounds for Edge-Cover by Random Walk CoRR Agelos Georgakopoulos, Peter Winkler
2011	J	`jnl`	The Max-Flow Min-Cut theorem for countable networks. J. Comb. Theory B Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel
2011	J	`jnl`	Two-Color Babylon CoRR Agelos Georgakopoulos, Peter Winkler
2010	J	`jnl`	An Eberhard-Like Theorem for Pentagons and Heptagons. Discret. Comput. Geom. Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Sámal
2010	J	`jnl`	Every rayless graph has an unfriendly partition. Comb. Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
2009	J	`jnl`	A short proof of Fleischner's theorem. Discret. Math. Agelos Georgakopoulos
2009	J	`jnl`	Every rayless graph has an unfriendly partition. Electron. Notes Discret. Math. Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
2009	J	`jnl`	Geodetic Topological Cycles in Locally Finite Graphs. Electron. J. Comb. Agelos Georgakopoulos, Philipp Sprüssel
2009	J	`jnl`	Perfect matchings in r-partite r-graphs. Eur. J. Comb. Ron Aharoni, Agelos Georgakopoulos, Philipp Sprüssel
2009	J	`jnl`	Topological Circles and Euler Tours in Locally Finite Graphs. Electron. J. Comb. Agelos Georgakopoulos
2008	J	`jnl`	Strongly Maximal Matchings in Infinite Graphs. Electron. J. Comb. Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Philipp Sprüssel
2007	J	`jnl`	Connected but not path-connected subspaces of infinite graphs. Comb. Agelos Georgakopoulos
2007	—	`—`	Topological paths and cycles in infinite graphs (Topologische Wege und Kreise in unendlichen Graphen) Agelos Georgakopoulos