• A full Halin grid theorem (A. Georgakopoulos and M. Hamann), preprint 2024; ArXiv
• Canonical graph decompositions via coverings (R. Diestel, R. Jacobs, P. Knappe and J. Kurkofka), preprint 2022; ArXiv
• Splitting groups with cubic Cayley graphs of connectivity two (Babak Miraftab and Konstantinos Stavropoulos), preprint 2019; ArXiv
• A Stallings’ type theorem for quasi-transitive graphs (Matthias Hamann, Florian Lehner, Babak Miraftab and Tim Rühmann), JCTB 157 (2022), 40-69; Arxiv
• Two-ended quasi-transitive graphs (Babak Miraftab and Tim Rühmann), preprint 2018; Arxiv
• Self-embeddings of trees (Matthias Hamann), preprint 2017; PDF
• Isoperimetry in integer lattices (Ben Barber and Joshua Erde), Discrete Analysis, Volume 7 (2018); ArXiv
• Hamilton decompositions of one-ended Cayley graphs (Joshua Erde, Florian Lehner and Max Pitz), J. Combin. Theory (Series B), 140 (2020) 171-191. PDF
• A zero-sum problem on graphs (D. Weißauer), preprint 2016; PDF
• From cycles to circles in Cayley graphs (Babak Miraftab and Tim Rühmann), preprint 2017; PDF
• Hamilton circles in Cayley graphs (Babak Miraftab and Tim Rühmann), Electron. J. Combin. 25 (2018), #P2.5; PDF
• Breaking graph symmetries by edge colourings (Florian Lehner), JCTB 127 (2017), 205–214; PDF
• Planar transitive graphs (Matthias Hamann), preprint 2016; PDF
• Local finiteness, distinguishing numbers and Tucker's conjecture (Florian Lehner and Rögnvaldur G. Möller), Electronic J. Combinatorics 22, #P4.19; PDF
• The planar Cayley graphs are effectively enumerable (Agelos Georgakopoulos and Matthias Hamann), preprint 2015; PDF
• Countable connected-homogeneous digraphs (Matthias Hamann), preprint 2014; PDF
• Accessibility in transitive graphs (Matthias Hamann), Combinatorica 38 (2018), 847–859; PDF
• Group actions on metric spaces: fixed points and free subgroups (Matthias Hamann), Abh. Math. Semin. Univ. Hambg. 87 (2017), 245-263; PDF
• On the tree-likeness of hyperbolic spaces (Matthias Hamann), Math. Proc. Cambridge Philos. Soc. 164 (2018), 345-361; PDF
• Spanning trees in hyperbolic graphs (Matthias Hamann), Combinatorica 36 (2016), 313–332; PDF
• The classification of finite and locally finite connected-homogeneous digraphs (Matthias Hamann), Combinatorica 37 (2017), 183-222; PDF
• Generating the cycle space of planar graphs (Matthias Hamann), Electonic J. Combinatorics 22, #P2.34; PDF
• Homogeneous 2-partite digraphs (Matthias Hamann), Discrete Math 327 (2013), 36-39; PDF
• The classification of connected-homogeneous digraphs with more than one end (Matthias Hamann and Fabian Hundertmark), Transactions AMS 365 (2013), 531-553; PDF
• End-transitive graphs (Matthias Hamann), Israel Journal of Mathematics 189 (2012), 437-459; PDF
• On fixing boundary points of transitive hyperbolic graphs (Agelos Georgakopoulos & Matthias Hamann), Arch. Math. (Basel) 99 (2012), 91-99; PDF
• Transitivity conditions in infinite graphs (Matthias Hamann and Julian Pott), Combinatorica 32 (2012), 649-688; PDF

Theses:

• Connected-homogeneous digraphs (M. Hamann), Habilitationsschrift, Hamburg 2014, PDF
• The Planar Cubic Cayley Graphs (A. Georgakopoulos), Habilitationsschrift, Hamburg 2012, PDF