1. Alber, J., Gramm, J., Niedermeier, R.: Faster exact algorithms for hard problems: a parameterized point of view. In: Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics. LNCS, pp. 168–185. Springer, Berlin (1998)
2. Alsinet, T., Manyà, F., Planes, J.: Improved branch and bound algorithms for Max-SAT. In: Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing. S. Margherita Ligure – Portofino, Italy (2003).
3. Battiti, R., Protasi, M.: Reactive search, a history-sensitive heuristic for MAX-SAT. ACM J. Exp. Algorithms, 2, Art. 2(1997)
4. Borchers B. and Furman J. (1999). A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J. Combi. Optim 2: 299–306
5. Cheriyan, J., Cunningham, W., Tunçel, L., Wang, Y.: A linear programming and rounding approach to MAX-2-SAT. In: Johnson D., Trick M. (eds.), Cliques, Coloring and Satisfiability, Vol. 26 of DIMACS, pp. 395–414. American Mathematical Society, Providence, USA (1996)