1. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STOC, pp. 226–234 (1993)
2. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11, 1–22 (1993)
3. Lecture Notes in Computer Science;H.L. Bodlaender,2007
4. Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.V.: On the red-blue set cover problem. In: SODA, pp. 345–353 (2000)
5. Chechik, S., Johnson, M.P., Parter, M., Peleg, D.: Secluded Connectivity Problems,
http://arxiv.org/abs/1212.6176