1. The growth rate of vertex-transitive planar graphs;['Babai, László'];Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA, 1997),1997
2. Canonical tree-decompositions of finite graphs I. Existence and algorithms;['Carmesin, Johannes', 'Diestel, Reinhard', 'Hamann, Matthias', 'Hundertmark, Fabian'];J. Combin. Theory Ser. B,2016
3. Connectivity and tree structure in finite graphs;['Carmesin, Johannes', 'Diestel, Reinhard', 'Hundertmark, Fabian', 'Stein, Maya'];Combinatorica,2014
4. [4] Carmesin, Johannes; Diestel, Reinhard; Miraftab, Babak Canonical trees of tree-decompositions (2020) (https://arxiv.org/pdf/2002.12030.pdf)
5. Locally finite graphs with ends: a topological approach, II. Applications;['Diestel, Reinhard'];Discrete Math.,2010