V. Klee

发表

Some characterizations of convex polyhedra

V. Klee, 1959 .

HOW GOOD IS THE SIMPLEX ALGORITHM

V. Klee, G. Minty, 1970 .

Combinatorial Geometry in the Plane

V. Klee, H. Hadwiger, H. Debrunner, 1964 .

On the Number of Vertices of a Convex Polytope

V. Klee, 1964, Canadian Journal of Mathematics.

On the complexity ofd- dimensional Voronoi diagrams

V. Klee, 1979 .

Thed-step conjecture for polyhedra of dimensiond<6

V. Klee, D. Walkup, 1967 .

The Critical Set of a Convex Body

V. Klee, 1953 .

The generation of convex hulls

V. Klee, W. Bonnice, 1963 .

Optimization of globally convex functions

T. C. Hu, V. Klee, D. Larman, 1989 .

Combinatorial and graph-theoretical problems in linear algebra

V. Klee, S. Friedland, R. Brualdi, 1993 .

CONVEX POLYTOPES AND LINEAR PROGRAMMING.

V. Klee, 1964 .

Approximation of diameters: randomization doesn't help

Miklós Simonovits, Peter Gritzmann, László Lovász, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

FACETS AND VERTICES OF TRANSPORTATION POLYTOPES

V. Klee, C. Witzgall, 1967 .

A String Algorithm for Shortest Path in Directed Networks

V. Klee, 1964 .

Helly's theorem and its relatives

V. Klee, L. Danzer, Branko Griinbaum, 1963 .

Some Unsolved Problems in Plane Geometry

V. Klee, 1979 .

Can Nine Tetrahedra Form a Neighboring Family

V. Klee, 1969 .

Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?

V. Klee, 1977 .

Heights of convex polytopes

V. Klee, 1965 .

A class of linear programming problems requiring a large number of iterations

V. Klee, 1965 .

Diameters of Polyhedral Graphs

V. Klee, 1964, Canadian Journal of Mathematics.

Mathematical Programming and Convex Geometry

V. Klee, P. Gritzmann, 1993 .

Separation properties of convex cones

V. Klee, 1955 .

When is a Matrix Sign Stable?

V. Klee, P. van den Driessche, C. Jeffries, 1977, Canadian Journal of Mathematics.

What Are the Intersection Graphs of Arcs in a Circle

V. Klee, 1969 .

Largest j-Simplices in n-Polytopes

Peter Gritzmann, Victor Klee, David G. Larman, 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

Paths on polyhedra. II.

V. Klee, 1964 .

Paths on Polyhedra. I

V. Klee, 1965 .

On the 0-1 Maximization of Positive Definite Quadratic Forms

V. Klee, P. Gritzmann, 1989 .

CONVEX FUNCTIONS ON CONVEX POLYTOPES

R. Rockafellar, V. Klee, D. Gale, 1968 .

A comparison of primal and dual methods of linear programming

V. Klee, 1966 .

Polytope pairs and their relationship to linear programming

V. Klee, 1974 .

A Combinatorial Analogue of Poincaré's Duality Theorem

V. Klee, 1964, Canadian Journal of Mathematics.

Shellings of Spheres and Polytopes.

V. Klee, Gopal Danaraj, 1974 .

Semicontinuity of the face-function of a convex set

V. Klee, Michael D. Martin, 1971 .

SEPARATION AND SUPPORT PROPERTIES OF CONVEX SETS: A SURVEY.

V. Klee, 1969 .

A proof of the strict monotone 4-step conjecture

V. Klee, F. Holt, 1998 .

36 COMPUTATIONAL CONVEXITY

V. Klee, P. Gritzmann, 2016 .

Shapes of the future - some unsolved problems in high-dimensional intuitive geometry

Victor Klee, V. Klee, 1999, CCCG.

What is the Expected Volume of a Simplex Whose Vertices are Chosen at Random from a Given Convex Body

Victor Klee, V. Klee, 1969 .

Convex Set

Victor Klee, V. Klee, 1971, Numerical Ranges of Hilbert Space Operators.

Linear algorithms for testing the sign stability of a matrix and for findingZ-maximum matchings in acyclic graphs

Victor Klee, Pauline van den Driessche, V. Klee, 1977 .

THE GREEDY ALGORITHM FOR FINITARY AND COFINITARY MATROIDS

Victor Klee, V. Klee, 1969 .

Counterexamples to the Strong d -Step Conjecture for d≥5

Victor Klee, F. B. Holt, V. Klee, 1998, Discret. Comput. Geom..

A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm

Victor Klee, Gopal Danaraj, V. Klee, 1978 .

Which generalized prisms admit H-circuits?

Victor Klee, V. Klee, 1972 .

Recursive structure of S-matrices and an O(m2) algorithm for recognizing strong sign solvability

V. Klee, 1987 .

Asymptotes of Convex Bodies.

Victor Klee, V. Klee, 1967 .

Every non-normable Frechet space is homeomorphic with all of its closed convex bodies

V. Klee, C. Bessaga, 1966 .

COMMON SECANTS FOR PLANE CONVEX SETS1

V. Klee, 2010 .

On a conjecture of Carmichael

V. Klee, 1947 .

Deterministic and randomized polynomial-time approximation of radii

Miklós Simonovits, Peter Gritzmann, László Lovász, 2001 .

Diameters of random bipartite graphs

Béla Bollobás, Victor Klee, B. Bollobás, 1984, Comb..

Ratio-sequences of chains in connected metric spaces

V. Klee, 1975 .

The use of research problems in high school geometry

V. Klee, 1971 .

How Many Steps

V. Klee, 1980 .

A NOTE ON TOPOLOGICAL PROPERTIES OF NORMED LINEAR SPACES

V. Klee, 1956 .

Topological equivalence of a Banach space with its unit cell

V. Klee, 1961 .

A characterization of reflexivity by the lattice of closed subspaces

V. Klee, E. Floyd, 1954 .

Experimental designs through level reduction of the d-dimensional cuboctahedron

Victor Klee, D. H. Doehlert, V. Klee, 1972, Discret. Math..

Largest j-simplices in d-cubes: Some relatives of the hadamard maximum determinant problem

Victor Klee, Matthew Hudelson, V. Klee, 1996 .

Inner diagonals of convex polytopes

Victor Klee, David Bremner, V. Klee, 1999, CCCG.

Unsolved Problems in Intuitive Geometry

V. Klee, 1960 .

On the Complexity of some Basic Problems in Computational Convexity: II. Volume and mixed volumes

Peter Gritzmann, Victor Klee, V. Klee, 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

On the complexity of some basic problems in computational convexity: I. Containment problems

Peter Gritzmann, Victor Klee, V. Klee, 1994, Discret. Math..

Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces

Peter Gritzmann, Victor Klee, V. Klee, 1993, Math. Program..

Inner and outerj-radii of convex bodies in finite-dimensional normed spaces

Peter Gritzmann, Victor Klee, V. Klee, 1992, Discret. Comput. Geom..

Sign-Patterns and Stability

Victor Klee, V. Klee, 1989 .

Invariant metrics in groups (solution of a problem of Banach)

V. Klee, 1952 .

The Euler Characteristic in Combinatorial Geometry

Victor Klee, V. Klee, 1963 .

Rotundity and smoothness of convex bodies in reflexive and nonreflexive spaces

V. Klee, C. Zanco, L. Veselý, 1996 .

Polytope Projection and Projection Polytopes

Peter Gritzmann, Thomas Burger, Victor Klee, 1996, Universität Trier, Mathematik/Informatik, Forschungsbericht.

The d-Step Conjecture and Its Relatives

Victor Klee, Peter Kleinschmidt, V. Klee, 1987, Math. Oper. Res..

Adjoints of projective transformations and face-figures of convex polytopes

V. Klee, 1978 .

INTERSECTION THEOREMS FOR POSITIVE SETS

V. Klee, W. Hansen, 1969 .

Old And New Unsolved Problems In Plane Geometry And Number Theory

Victor Klee, Stan Wagon, V. Klee, 1991 .

Some new results on smoothness and rotundity in normed linear spaces

Victor Klee, V. Klee, 1959 .

Convex functions and upper semi-continuous collections

V. Klee, R. D. Anderson, V. L. Klee, 1952 .

Invariant extension of linear functionals

Victor Klee, V. Klee, 1954 .

Leray-Schauder theory without local convexity

V. Klee, 1960 .

What is the Maximum Length of a d-Dimensional Snake?

Victor Klee, V. Klee, 1970 .

Combinatorial Optimization: What is the State of the Art

Victor Klee, V. Klee, 1980, Math. Oper. Res..

Combinatorial Optimization: What is the State of the Art

Victor Klee, V. Klee, 1980, Mathematics of Operations Research.

The Connectedness Game and the c-Complexity of Certain Graphs

Victor Klee, Gopal Danaraj, V. Klee, 1977 .

Convex and Linear Orientations of Polytopal Graphs

Victor Klee, J. Mihalisin, V. Klee, 2000, Discret. Comput. Geom..

A D-pseudomanifold with Fo Vertices Has at Least Dfo-(d-1 )(d+2) D-simplices

V. Klee, 2004 .

Linear Programming and Extensions. George B. Dantzig. Princeton University Press, Princeton, N.J., 1963. xviii + 625 pp. Illus. $11.50

Victor Klee, V. Klee, 1964 .

Some topological properties of convex sets

V. Klee, 1955 .

Some Characterizations of Compactness

V. Klee, 1951 .

A qualitative analysis of I

Victor Klee, Terrence Bone, Clark Jeffries, 1988, Discrete Applied Mathematics.

Qualitative stability of linear systems

Victor Klee, Pauline van den Driessche, V. Klee, 1987 .

QUALITATIVE MATRICES: STRONG SIGN-SOLVABILITY AND WEAK SATISFIABILITY

Richard E. Ladner, Victor Klee, V. Klee, 1981 .

Computational Convexity

Peter Gritzmann, Victor Klee, V. Klee, 1996, Handbook of Discrete and Computational Geometry, 2nd Ed..

Extremal structure of convex sets. II

Victor Klee, V. Klee, 1958 .

Finding the Smallest Triangles Containing a Given Convex Polygon

Victor Klee, Michael C. Laskowski, V. Klee, 1985, J. Algorithms.

A Method for Constructing Circuit Codes

Victor Klee, V. Klee, 1967, JACM.

Lengths of snakes in boxes

Victor Klee, Ludwig Danzer, V. Klee, 1967 .

Continuous Convex Sets.

David Gale, Victor Klee, V. Klee, 1959 .

Maximal separation theorems for convex sets

Victor Klee, V. Klee, 1968 .

Which Spheres are Shellable

Victor Klee, Gopal Danaraj, V. Klee, 1978 .

A SURPRISING BUT EASILY PROVED GEOMETRIC DECOMPOSITION THEOREM

V. Klee, J. R. Reay, 1998 .

Computational complexity of norm-maximization

Jan van Leeuwen, Peter Gritzmann, Victor Klee, 1990, Comb..

A note on certain function spaces

V. Klee, M. Rudin, 1957 .

A conjecture on weak compactness

V. Klee, 1962 .

Shrinkable neighborhoods in Hausdorff linear spaces

V. Klee, 1960 .

The finite topology of a linear space

V. Klee, S. Kakutani, 1963 .

Convex bodies and periodic homeomorphisms in Hilbert space

V. Klee, 1953 .

HOMOGENEITY OF INFINITE-DIMENSIONAL PARALLELOTOPES*

V. Klee, 1957 .

Fixed-Point Sets of Periodic Homeomorphisms of Hilbert Space

V. Klee, 1956 .

Two topological properties of topological linear spaces

V. Klee, C. Bessaga, 1964 .

Mappings into normed linear spaces

V. Klee, 1960 .

On a method of mapping due to Kadeč and Bernstein

V. Klee, R. G. Long, 1957 .

On metric independence and linear independence

V. Klee, L. M. Blumenthal, 1955 .

SOME TOPOLOGICAL PROPERTIES OF CONVEX SETS(1)

V. Klee, 2016 .

SOME TOPOLOGICAL PROPERTIES OF CONVEX SETSO

V. Klee, 2010 .

Leray-Schauder theory without local convexity

V. Klee, 1960 .

Basic properties of evenly convex sets

V. Klee, E. Maluta, C. Zanco, 2007 .

Polyhedral sections of convex bodies

V. Klee, 1960 .

Strict separation of convex sets

V. Klee, 1956 .

On the Borelian and Projective Types of Linear Subspaces.

V. Klee, 1958 .

Circumspheres and Inner Products.

Victor Klee, V. Klee, 1960 .

Shapes of the Future.

V. Klee, 1971 .

Archimedean levels, semispaces, and majorization of convex cones

V. Klee, E. Maluta, C. Zanco, 1993 .

Utility functions and the ‘lin’ operation for convex sets

V. Klee, 1964 .

Another generalization of Carathéodory's theorem

V. Klee, 1980 .

Spira's Theorems on Complete Linear Proofs of Systems of Linear Inequalities.

Victor Klee, V. Klee, 1975 .

Is a Body Spherical if its HA-Measurements are Constant?

Victor Klee, V. Klee, 1969 .

Title Strict convexity and smoothness of normed spaces

V. Klee, J. Wada, 2022 .

A question of Katětov concerning the Hilbert parallelotope

V. Klee, 1961 .

In a remarkable paper, Bishop and Phelps (1) settle several important questions concerning supporting hyperplanes of convex sets in Banach spaces. In particular, they show that if C is a closed convex subset of a Banach space

V. Klee, 2016 .

Diameters of Random Graphs

Victor Klee, V. Klee, D. Larman, 1981, Canadian Journal of Mathematics.

Random Bipartite Graphs: Connectedness, Isolated Nodes, Diameters.

Victor Klee, V. Klee, D. Larman, 1979 .

Use of Floyd's Algorithm to Find Shortest Restricted Paths.

Victor Klee, V. Klee, D. Larman, 1979 .

The structure of semispaces

V. Klee, V. L. Jr. Klee, 1956 .

Stability of the fixed-point property

V. Klee, 1961 .

Inspheres and inner products

Victor Klee, Elisabetta Maluta, V. Klee, 1986 .

An example in the theory of topological linear spaces

V. Klee, 1956 .

Exotic topologies for linear spaces

V. Klee, 1962 .

Idempotency of the hull-formation Hγ

V. Klee, 1963 .

Inapproximability of some Geometric and Quadratic Optimization Problems

Peter Gritzmann, Victor Klee, Andreas Brieden, 2000 .

Cross-Positive Matrices Revisited

Peter Gritzmann, Victor Klee, B. S. Tam, 1995, Universität Trier, Mathematik/Informatik, Forschungsbericht.

Convexity of Chebyshev sets

Victor Klee, V. Klee, 1961 .

Largestj-simplices inn-polytopes

Peter Gritzmann, Victor Klee, David G. Larman, 1995, Discret. Comput. Geom..

A theorem on convex kernels

V. Klee, 1965 .