 Egerváry's interests spanned the theory of algebraic equations, geometry, differential equations, and matrix theory.In what later became a classic result in the field of combinatorial optimization, Egerváry generalized Kőnig's theorem to the case of weighted graphs.This contribution was translated and published in 1955 by Harold W. Kuhn, who also showed how to apply Kőnig's and Egerváry's method to solve the assignment problem; the resulting algorithm has since been known as the "Hungarian method".