1. The number of labeled k-dimensional trees;Beineke;J. Combin. Theory,1969
2. Enumeration and limit laws for series-parallel graphs;Bodirsky;European J. Combin.,2007
3. Only Few Graphs Have Bounded Treewidth. Technical Report RUU-CS-92-35;Bodlaender,1992
4. H.L. Bodlaender, J. Nederlof, Subexponential time algorithms for finding small tree and path decompositions, 2016, CoRR abs/1601.02415.
5. H.L. Bodlaender, J. Nederlof, T.C. van der Zanden, Subexponential time algorithms for embedding H-minor free graphs, in: Proc. of the 43rd International Colloquium on Automata, Languages, and Programming, ICALP, in: LIPIcs, vol. 55, 2016, pp. 9:1–9:14.