ACM Fellows
United States – 1994
CITATION

For his continuing contributions to the theory of algorithms including the development of efficient algorithms for network flow and other combinatorial optimization problems, the identification of polynomial -time computability with the intuitive notion