George J. Minty

发表

An n-symbol receiver requires at most an n-symbol transmitter (Corresp.)

George J. Minty, Richard V. Palermo, 1963, IEEE Trans. Inf. Theory.

Letter to the Editor—On An Algorithm for Solving Some Network-Programming Problems

George J. Minty, 1962 .

Letter to the Editor—A Variant on the Shortest-Route Problem

George J. Minty, 1957 .

On maximal independent sets of vertices in claw-free graphs

George J. Minty, G. Minty, 1980, J. Comb. Theory B.

A “from scratch” proof of a theorem of Rockafellar and Fulkerson

George J. Minty, G. Minty, 1974, Math. Program..

Two theorems on nonlinear functional equations in Hilbert space

George J. Minty, G. Minty, 1963 .

A Theorem on n-Coloring the Points of a Linear Graph

George J. Minty, G. Minty, 1962 .

A theorem on three-coloring the edges of a trivalent graph*

George J. Minty, G. Minty, 1967 .