So my understanding of bidimensionality is you are assured the problem solution is about O(k^2) so you can pay O(k) purely to reduce the instance to one of bounded treewidth. As far as I know, this breaks down in the weighted case since the O(k^2) in your final solution could all be very low value.
Has there been work done in applying bidimensionality to weighted problems?
