1. Alimonti, P., Ausiello, G., Giovaniello, L., Protasi, M.: On the complexity of approximating weighted satisfiability problems. Tech. rep., Università degli Studi di Roma La Sapienza, rapporto Tecnico RAP 38.97 (1997)
2. Bazgan, C., Toubaline, S., Vanderpooten, D.: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. J. Comb. Optim. 26(1), 178–189 (2012)
3. Bazgan, C., Bentz, C., Picouleau, C., Ries, B.: Blockers for the stability number and the chromatic number. Graphs Comb. 31(1), 73–90 (2015)
4. Bazgan, C., Nichterlein, A., Niedermeier, R.: A refined complexity analysis of finding the most vital edges for undirected shortest paths. In: Paschos, V.T., Widmayer, P. (eds.) Algorithms and Complexity—9th International Conference, CIAC 2015, Paris, France, May 20–22, 2015. Proceedings, Lecture Notes in Computer Science, vol. 9079, pp. 47–60. Springer, Berlin (2015)
5. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1–2), 1–21 (1993)