1. , and , The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974).
2. A competitive (dual) simplex method for the assignment problem
3. TWO THEOREMS IN GRAPH THEORY
4. Matrixok kombinatorius tulajdonsagairol. Mat. Fiz. Lapok (1931) 16–28 [translated as “Combinatorial properties of matrices” by H. W. Kuhn, O.N. R. Logistics Project, Princeton University (1953)].