Size of tree decomposition
Not a complete answer, but in T. Kloks Treewidth you have the following lemma:


  There always exists a nice tree decomposition of width $k$ and with at most $4n$ bags.


It is NP-complete to determine the minimum number of bags in a tree decomposition of width $k$.