George J. Minty

Q: What Schools Are Affiliated With George J. Minty

George J. Minty is affiliated with the following schools: University of California, Berkeley, Indiana University Bloomington, Indiana University, University of Michigan, Princeton University, Waseda University

George J. Minty's AcademicInfluence.com Rankings

George J. Minty

Mathematics

#5281

Historical Rank

Measure Theory

#3384

Historical Rank

mathematics Degrees

Download Badge

Mathematics

George J. Minty's Degrees

PhD Mathematics Princeton University

Why Is George J. Minty Influential?

(Suggest an Edit or Addition)

According to Wikipedia, George James Minty Jr. was an American mathematician, specializing in mathematical analysis and discrete mathematics. He is known for the Klee–Minty cube, the Browder–Minty theorem, and the Minty-Vitaver theorem on graph coloring.

(See a Problem?)

George J. Minty's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Monotone (nonlinear) operators in Hilbert space (1962) (1087)
HOW GOOD IS THE SIMPLEX ALGORITHM (1970) (1054)
On maximal independent sets of vertices in claw-free graphs (1980) (458)
ON A "MONOTONICITY" METHOD FOR THE SOLUTION OF NONLINEAR EQUATIONS IN BANACH SPACES. (1963) (285)
On the monotonicity of the gradient of a convex function. (1964) (178)
On the generalization of a direct method of the calculus of variations (1967) (140)
Monotone networks (1960) (102)
A Simple Algorithm for Listing All the Trees of a Graph (1965) (81)
On the maximal domain of a ``monotone'' function. (1961) (78)
A Theorem on n-Coloring the Points of a Linear Graph (1962) (60)
On the extension of Lipschitz, Lipschitz-Hölder continuous, and monotone functions (1970) (58)
Solving Steady-State Nonlinear Networks of 'Monotone' Elements (1961) (52)
Letter to the Editor—A Variant on the Shortest-Route Problem (1957) (36)
On the solvability of nonlinear functional equations of `monotonic' type. (1964) (35)
A theorem on maximal monotonic sets in Hilbert space (1965) (26)
On variational inequalities for monotone operators, I (1978) (18)
On the simultaneous solution of a certain system of linear inequalities (1962) (16)
A theorem on three-coloring the edges of a trivalent graph* (1967) (14)
Two theorems on nonlinear functional equations in Hilbert space (1963) (13)
A “from scratch” proof of a theorem of Rockafellar and Fulkerson (1974) (6)
A finite-dimensional tool-theorem in monotone operator theory (1974) (5)
Frequency of occurrence of words : a study of Zipf's law, with application to mechanical translation (1957) (5)
An n-symbol receiver requires at most an n-symbol transmitter (Corresp.) (1963) (2)
Letter to the Editor—On An Algorithm for Solving Some Network-Programming Problems (1962) (2)
Problems for Solution: E1661-E1670 (1964) (0)
On the Notion of “Function” (1971) (0)
Finite Graphs and Networks (Robert G. Busacker and Thomas L. Saaty) (1966) (0)

This paper list is powered by the following services:

Other Resources About George J. Minty

en.wikipedia.org

What Schools Are Affiliated With George J. Minty?

George J. Minty is affiliated with the following schools:

George J. Minty's Academic­Influence.com Rankings