1. E. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997.
2. H. Björklund, S. Sandberg, S. Vorobyov, Optimization on completely unimodal hypercubes, Technical Report 2002-018, Uppsala University/Information Technology, May 2002 .
3. H. Björklund, S. Sandberg, S. Vorobyov, A discrete subexponential algorithm for parity games, in: H. Al, M. Habib (Eds.), 20th Internat. Symp. on Theoretical Aspects of Computer Science, STACS’2003, Lecture Notes in Computer Science, Vol. 2607, Springer, Berlin, 2003, pp. 663–674 (Full preliminary version: TR-2002-026, Department of Information Technology, Uppsala University, September 2002).
4. Complexity of model checking by iterative improvement: the pseudo-Boolean framework;Björklund,2003
5. H. Björklund, S. Sandberg, S. Vorobyov, On combinatorial structure and algorithms for parity games, Technical Report 2003-002, Department of Information Technology, Uppsala University, January 2003 .