1. I. Bárány, T. Fiala, Többgépes ütemezési problémák közel optimális megoldása, Szigma-Mat.-Közgazdasági Folyóirat 15 (1982) 177–191.
2. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness I: Basic results, SIAM J. Comput. 24 (1995) 873–921.
3. R.G. Downey, M.R. Fellows, B.M. Kapron, M.T. Hallett, H.T. Wareham, The parameterized complexity of some problems in logic and linguistics, in: A. Nerode, Yu.V. Matiyasevich (Eds.), Logical Foundations of Computer Science, Proceedings of the Third International Symposium, LFCS 1994, Lecture Notes in Computer Science 813, Springer, Berlin, 1994, pp. 89–100.
4. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
5. M.R. Garey, D.S. Johnson, R. Sethi, The complexity of flowshop and jobshop scheduling, Math. Oper. Res. 1 (1976) 117–129.