The Library
Browse by Warwick Author
Up a level |
Number of items: 42.
Journal Article
Georgakopoulos, Agelos and Kim, Jaehoon (2023) 2βcomplexes with unique embeddings in 3βspace. Bulletin of the London Mathematical Society, 55 (1). pp. 156-174. doi:10.1112/blms.12718 ISSN 1469-2120.
Georgakopoulos, Agelos and Wendland, Alex (2022) Presentations for vertex-transitive graphs. Journal of Algebraic Combinatorics, 55 . pp. 795-826. doi:10.1007/s10801-021-01070-6 ISSN 0925-9899.
Georgakopoulos, Agelos, Haslegrave, John, Sauerwald, Thomas and Sylvester, John (2022) The power of two choices in random walks. Combinatorics, Probability and Computing, 31 (1). pp. 73-100. doi:10.1017/S0963548321000183 ISSN 0963-5483.
Georgakopoulos, Agelos and Haslegrave, John (2021) A time-invariant random graph with splitting events. Electronic Communications in Probability, 26 . pp. 1-15. 66. doi:10.1214/21-ECP436 ISSN 1083-589X.
Georgakopoulos, Agelos, Haslegrave, John, Montgomery, Richard and Narayanan, Bhargav (2021) Spanning surfaces in 3-graphs. Journal of the European Mathematical Society, 24 (1). pp. 303-339. doi:10.4171/JEMS/1101 ISSN 1435-9855.
Georgakopoulos, Agelos and Haslegrave, John (2020) Percolation on an infinitely generated group. Combinatorics, Probability & Computing, 29 (4). pp. 587-615. doi:10.1017/S096354832000005X ISSN 0963-5483.
Georgakopoulos, Agelos (2020) On Planar Cayley graphs and Kleinian groups. Transactions of the American Mathematical Society, 373 . pp. 4649-4684. doi:10.1090/tran/8026 ISSN 0002-9947.
Georgakopoulos, Agelos and Hamann, Matthias (2019) The planar Cayley graphs are effectively enumerable I : consistently planar graphs. Combinatorica, 39 . pp. 993-1019. doi:10.1007/s00493-019-3763-3 ISSN 0209-9683.
Georgakopoulos, Agelos, Haslegrave, John and Montgomery, Richard (2019) Forcing large tight components in 3-graphs. European Journal of Combinatorics, 77 . pp. 57-67. doi:10.1016/j.ejc.2018.11.001 ISSN 0195-6698.
Georgakopoulos, Agelos and Wagner, Stephan (2018) Subcritical graph classes containing all planar graphs. Combinatorics, Probability and Computing, 27 (5). pp. 763-773. doi:10.1017/S0963548318000056 ISSN 0963-5483.
Georgakopoulos, Agelos (2017) The planar cubic Cayley graphs. Memoirs of the American Mathematical Society, 250 (1190). doi:10.1090/memo/1190 ISSN 0065-9266.
Georgakopoulos, Agelos (2017) On covers of graphs by Cayley graphs. European Journal of Combinatorics, 64 . ISSN 0195-6698.
Federici, Bruno and Georgakopoulos, Agelos (2017) Hyperbolicity vs. amenability for planar graphs. Discrete & Computational Geometry, 58 (1). pp. 67-79. doi:10.1007/s00454-017-9859-x ISSN 0179-5376.
Carmesin, J., Federici, Bruno and Georgakopoulos, Agelos (2017) A Liouville hyperbolic souvlaki. Electronic Journal of Probability, 22 . 23. doi:10.1214/17-EJP44 ISSN 1083-6489.
Georgakopoulos, Agelos and Wagner, Stephan (2017) Hitting times, cover cost, and the Wiener Index of a tree. Journal of Graph Theory, 84 (3). pp. 311-326. doi:10.1002/jgt.22029 ISSN 0364-9024.
Georgakopoulos, Agelos and Kolountzakis, M. N. (2017) On particles in equilibrium on the real line. Proceedings of the American Mathematical Society, 145 . pp. 3501-3511. doi:10.1090/proc/13492 ISSN 0002-9939.
Georgakopoulos, Agelos (2016) The boundary of a square tiling of a graph coincides with the Poisson boundary. Inventiones Mathematicae, 203 (3). pp. 773-821. doi:10.1007/s00222-015-0601-0 ISSN 0020-9910.
Georgakopoulos, Agelos, Haeseler, Sebastian, Keller, Matthias, Lenz, Daniel and Wojciechowski, RadosΕaw K. (2015) Graphs of finite measure. Journal de Mathematiques Pures et Appliquees, 103 (5). pp. 1093-1131. doi:10.1016/j.matpur.2014.10.006 ISSN 0021-7824.
Georgakopoulos, Agelos (2014) Characterising planar Cayley graphs and Cayley complexes in terms of group presentations. European Journal of Combinatorics, Volume 36 . pp. 282-293. doi:10.1016/j.ejc.2013.07.014 ISSN 0195-6698.
Georgakopoulos, Agelos and Winkler, Peter (2014) New bounds for edge-cover by random walk. Combinatorics, Probability and Computing, Volume 23 (Number 4). pp. 571-584. doi:10.1017/S096354831400008X ISSN 0963-5483.
Georgakopoulos, Agelos (2012) Cycle decompositions : from graphs to continua. Advances in Mathematics, Vol.229 (No.2). pp. 935-967. doi:10.1016/j.aim.2011.10.015 ISSN 0001-8708.
Benjamini, Itai, Curien, Nicolas and Georgakopoulos, Agelos (2012) The Liouville and the intersection properties are equivalent for planar graphs. Electronic communications in probability, Vol.17 . Article no. 42. doi:10.1214/ECP.v17-1913 ISSN 1083-589X.
Georgakopoulos, Agelos and Hamann, Matthias (2012) On fixing boundary points of transitive hyperbolic graphs. Archiv der Mathematik, Vol.99 (No.1). pp. 91-99. doi:10.1007/s00013-012-0390-2 ISSN 0003-889X.
Georgakopoulos, Agelos and Winkler, Peter (2012) Two-color Babylon. Integers : electronic journal of combinatorial number theory, Vol.12 (No.5). pp. 787-794. doi:10.1515/integers-2012-0003 ISSN 1553-1732.
Bruhn, Henning and Georgakopoulos, Agelos (2011) Bases and closures under infinite sums. Linear Algebra and Its Applications, Vol.435 (No.8). pp. 2007-2018. doi:10.1016/j.laa.2011.03.029 ISSN 0024-3795.
Georgakopoulos, Agelos (2011) Graph topologies induced by edge lengths. Discrete Mathematics, Vol.311 (No.15). pp. 1523-1542. doi:10.1016/j.disc.2011.02.012 ISSN 0012-365X.
Aharoni, Ron, Berger, Eli, Georgakopoulos, Agelos, Perlstein, Amitai and SprΓΌssel, Philipp (2011) The max-flow min-cut theorem for countable networks. Journal of Combinatorial Theory, Series B, Vol.101 (No.1). pp. 1-17. doi:10.1016/j.jctb.2010.08.002 ISSN 0095-8956.
DeVos, Matt, Georgakopoulos, Agelos, Mohar, Bojan and Ε Γ‘mal, Robert (2010) An Eberhard-like theorem for pentagons and heptagons. Discrete & Computational Geometry, Vol.44 (No.4). pp. 931-945. doi:10.1007/s00454-010-9264-1 ISSN 0179-5376.
Georgakopoulos, Agelos (2010) Lamplighter graphs do not admit harmonic functions of finite energy. Proceedings of the American Mathematical Society, Vol.138 (No.9). pp. 3057-3061. doi:10.1090/S0002-9939-2010-10279-4 ISSN 0002-9939.
Georgakopoulos, Agelos (2010) Uniqueness of electrical currents in a network of finite total resistance. Journal of the London Mathematical Society, Vol.82 (No.1). pp. 256-272. doi:10.1112/jlms/jdq034 ISSN 0024-6107.
Bruhn, Henning, Diestel, Reinhard, Georgakopoulos, Agelos and SprΓΌssel, Philipp (2009) Every rayless graph has an unfriendly partition. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 279-281. doi:10.1016/j.endm.2009.07.045 ISSN 1571-0653.
Georgakopoulos, Agelos (2009) Infinite Hamilton cycles in squares of locally finite graphs. Advances in Mathematics, Vol.220 (No.3). pp. 670-705. doi:10.1016/j.aim.2008.09.014 ISSN 0001-8708.
Aharoni, Ron, Georgakopoulos, Agelos and SprΓΌssel, Philipp (2009) Perfect matchings in -partite -graphs. European Journal of Combinatorics, Vol.30 (No.1). pp. 39-42. doi:10.1016/j.ejc.2008.02.011 ISSN 0195-6698.
Georgakopoulos, Agelos (2009) A short proof of Fleischnerβs theorem. Discrete Mathematics, Vol.309 (No.23-24). pp. 6632-6634. doi:10.1016/j.disc.2009.06.024 ISSN 0012-365X.
Georgakopoulos, Agelos and SprΓΌssel, Philipp (2008) Geodetic topological cycles in locally finite graphs. The Electronic Journal of Combinatorics, Vol.16 . Article no. R144. ISSN 2150-959X.
Aharoni, Ron, Berger, Eli, Georgakopoulos, Agelos and SprΓΌssel, Philipp (2008) Strongly maximal matchings in infinite graphs. The Electronic Journal of Combinatorics, Vol.15 . Article no. R136. ISSN 2150-959X.
Georgakopoulos, Agelos (2008) Topological circles and Euler tours in locally finite graphs. The Electronic Journal of Combinatorics, Vol.16 . Article no. R40. ISSN 2150-959X.
Book Item
Georgakopoulos, Agelos (2017) Group-walk random graphs. In: Ceccherini-Silberstein, T. and Salvatori, M. and Sava-Huss, E., (eds.) Groups, Graphs, and Random Walks. London mathematical society lecture note series (436). Cambridge: Cambridge University Press. ISBN 9781316604403 (In Press)
Conference Item
Georgakopoulos, Agelos, Haslegrave, John, Sauerwald, Thomas and Sylvester, John A. (2020) Choice and bias in random walks. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Seattle, 12-14 Jan 2019. Published in: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 151 76 :1-76 :19. ISBN 9783959771344. doi:10.4230/LIPIcs.ITCS.2020.76 ISSN 1868-8969.
Alstrup, Stephen, Georgakopoulos, Agelos, Rotenberg, Eva and Thomassen, Carsten (2018) A Hamiltonian cycle in the square of a 2-connected graph in linear time. In: Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, USA, 7-10 Jan 2018 pp. 1645-1649. doi:10.1137/1.9781611975031.107
Wang, Bo, Liakata, Maria, Tsakalidis, Adam, Georgakopoulos, Agelos, Papadopoulos, Orestis, Apostolidis, Lazaros, Zubiaga, Arkaitz, Procter, Rob and Kompatsiaris, Yiannis (2017) TOTEMSS : topic-based, temporal sentiment summarisation for Twitter. In: International Joint Conference on Natural Language Processing, Taipei, Taiwan, 27 Nov - 01 Dec 2017. Published in: Proceedings of the IJCNLP 2017 pp. 21-24.
Submitted Journal Article
Georgakopoulos, Agelos and Panagiotis, Christoforos (2018) Analyticity results in Bernoulli percolation. (Unpublished)
This list was generated on Tue Apr 23 18:36:30 2024 BST.