1. Every planar graph with the Liouville property is amenable. Issue 3 (7th June 2020) Authors: Carmesin, Johannes; Georgakopoulos, Agelos Journal: Random structures & algorithms Issue: Volume 57:Issue 3(2020) Page Start: 706 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Forcing large tight components in 3-graphs. (March 2019) Authors: Georgakopoulos, Agelos; Haslegrave, John; Montgomery, Richard Journal: European journal of combinatorics Issue: Volume 77(2019) Page Start: 57 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Hitting Times, Cover Cost, and the Wiener Index of a Tree. Issue 3 (29th February 2016) Authors: Georgakopoulos, Agelos; Wagner, Stephan Journal: Journal of graph theory Issue: Volume 84:Issue 3(2017) Page Start: 311 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. On covers of graphs by Cayley graphs. (August 2017) Authors: Georgakopoulos, Agelos Journal: European journal of combinatorics Issue: Volume 64(2017) Page Start: 57 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Percolation on an infinitely generated group. (20th July 2020) Authors: Georgakopoulos, Agelos; Haslegrave, John Journal: Combinatorics, probability and computing Issue: Volume 29:Number 4(2020) Page Start: 587 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. The planar Cayley graphs are effectively enumerable II. (May 2023) Authors: Georgakopoulos, Agelos; Hamann, Matthias Journal: European journal of combinatorics Issue: Volume 110(2023) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. The planar cubic Cayley graphs of connectivity 2. (August 2017) Authors: Georgakopoulos, Agelos Journal: European journal of combinatorics Issue: Volume 64(2017) Page Start: 152 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. The power of two choices for random walks. (28th January 2022) Authors: Georgakopoulos, Agelos; Haslegrave, John; Sauerwald, Thomas; Sylvester, John Journal: Combinatorics, probability and computing Issue: Volume 31:Number 1(2022) Page Start: 73 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗