Before revision:  We also reveal some further algorithmic implications of (tw,\omega)-boundedness related to list k-coloring and clique problems  .
After revision:  We also reveal some further algorithmic implications of (tw,\omega)-boundedness related to list k-coloring and clique problems . In addition, we propose a question about the complexity of the Maximum Weight Independent Set problem in (tw,\omega)-bounded graph classes and prove that the problem is polynomial-time solvable in every class of graphs excluding a fixed star as an induced minor .