1. E. Györi, An n-dimensional search problem with restricted questions. Combinatorica 1(4) (1981) 377–380.
2. J. Morávek, On the complexity of discrete programming problems. (talk) 6th International Symposium on Math. Programming, Princeton University 1967.
3. J. Morávek, Über die algorithmische Komplexität des Problems der diskreten Optimierung. 12. Int. Kolloquium, TH Ilmenau, DDR, 1967.
4. J. Morávek, On the complexity of disrete programming problems. Aplikace matematiky 14, 1969, 442–474.
5. J. Morávek, A localization problem in geometry and complexity of discrete programming. Kybernetika (Prague) 8: 498–516 (1972).