1. H. Björklund, O. Nilsson, O. Svensson, S. Vorobyov, Controlled linear programming: boundedness and duality, Technical Report DIMACS-2004-56, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, December 2004 〈http://dimacs.rutgers.edu/TechnicalReports/〉.
2. H. Björklund, O. Nilsson, O. Svensson, S. Vorobyov, The controlled linear programming problem, Technical Report DIMACS-2004-41, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, September 2004 〈http://dimacs.rutgers.edu/TechnicalReports/〉.
3. H. Björklund, S. Sandberg, S. Vorobyov, A discrete subexponential algorithm for parity games, in: H. Alt, M. Habib (Eds.), 20th International Symposium on Theoretical Aspects of Computer Science, STACS’2003, Lecture Notes in Computer Science, vol. 2607, Springer, Berlin, 2003, pp. 663–674.
4. 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 〈http://www.it.uu.se/research/reports/〉.
5. H. Björklund, S. Sandberg, S. Vorobyov, Randomized subexponential algorithms for parity games, Technical Report 2003-019, Department of Information Technology, Uppsala University, 2003 〈http://www.it.uu.se/research/reports/〉.