1. Mutilated chessboard problem is exponentially hard for resolution;Alekhnovich;Theoretical Computer Science,2004
2. T. Alsinet, F. Manyà, J. Planes, Improved branch and bound algorithms for Max-SAT, in: Proc. of the 6th Int. Conf. on the Theory and Applications of Satisfiability Testing, SAT'03, 2003
3. A Max-SAT solver with lazy data structures;Alsinet,2004
4. Improved exact solver for weighted Max-SAT;Alsinet,2005
5. The logic behind weighted CSP;Ansótegui,2007