Victor Klee

发表

Computational Convexity

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

Finding the Smallest Triangles Containing a Given Convex Polygon

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

Polytope Projection and Projection Polytopes

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

Convex and Linear Orientations of Polytopal Graphs

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

A qualitative analysis of I

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

Oracle-polynomial-time approximation of largest simplices in convex bodies

Peter Gritzmann, Victor Klee, Andreas Brieden, 2000, Discret. Math..

Computational complexity of norm-maximization

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

Separation by Hyperplanes in Finite-Dimensional Vector Spaces Over Archimedean Ordered Fields

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

Diameters of random bipartite graphs

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

QUALITATIVE MATRICES: STRONG SIGN-SOLVABILITY AND WEAK SATISFIABILITY

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

Appollonius Revisited: Supporting Spheres for Sundered Systems

Victor Klee, T. Lewis, Balder Von Hohenbalken, 1997, Discret. Comput. Geom..

Cross-Positive Matrices Revisited

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

Combinatorial Optimization: What is the State of the Art

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

Decomposition Theorems for Conditional Sign-Solvability and Sign-Solvability of General Systems

Victor Klee, Shawn Cokus, 2000, SIAM J. Matrix Anal. Appl..

A Comment on Floyd's Algorithm for Shortest Chains.

Victor Klee, 1973 .

Convex Polyhedra and Mathematical Programming.

Victor Klee, 1974 .

Efficient Width-Computation of high-dimensional point sets

Peter Gritzmann, Victor Klee, Andreas Brieden, 1998 .

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

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

Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphs

Victor Klee, Howard Quaife, 1977, J. Comb. Theory, Ser. B.

Minimum graphs of specified diameter, connectivity and valence. II

Victor Klee, K. Li, E. Engelhardt, 1989, Discret. Math..

THE USE OF CIRCUIT CODES IN ANALOG-TO-DIGITAL CONVERSION,

Victor Klee, 1970 .

Combinatorial Optimization: What is the State of the Art

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

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

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

Problems for Solution: 4350-4354

Paul Erdös, Victor Klee, Victor Thebault, 1949 .

Is Every Polygonal Region Illuminable from Some Point

Victor Klee, 1969 .

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

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

Good and Bad Radii of Convex Polygons

Peter Gritzmann, Victor Klee, Laurent Habsieger, 1991, SIAM J. Comput..

Minimum Graphs of Specified Diameter, Connectivity and Valence. I

Victor Klee, Howard Quaife, 1976, Math. Oper. Res..

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

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

Experimental designs through level reduction of the d-dimensional cuboctahedron

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

External Tangents and Closedness of Cone + Subspace

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

Deciding uniqueness in norm maximization

Peter Gritzmann, Victor Klee, 1992, Math. Program..

Largest j-Simplices in n-Polytopes

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

Geometry of the Gass-Saaty parametric cost LP algorithm

Victor Klee, Peter Kleinschmidt, 1990, Discret. Comput. Geom..

Which Spheres are Shellable

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

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.

Inner diagonals of convex polytopes

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

On the limited power of linear probes and other optimization oracles

Peter Gritzmann, Victor Klee, John Westwater, 1990, SCG '90.

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).

Guest Editors' Foreword

Victor Klee, Gil Kalai, 2000, Discret. Comput. Geom..

Many Polytopes Meeting the Conjectured Hirsch Bound

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

A Method for Constructing Circuit Codes

Victor Klee, V. Klee, 1967, JACM.

Polytope Containment and Determination by Linear Probes

Peter Gritzmann, Victor Klee, John Westwater, 1992, Universität Trier, Mathematik/Informatik, Forschungsbericht.

Largestj-simplices inn-polytopes

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

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

Victor Klee, V. Klee, 1999, CCCG.

The d-Step Conjecture and Its Relatives

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

Classification and enumeration of minimum (d, 3, 3)-graphs for odd d

Victor Klee, 1980, J. Comb. Theory, Ser. B.

Asymptotes of Convex Bodies.

Victor Klee, V. Klee, 1967 .

Convex Set

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

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

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

On the recognition of S-systems

Victor Klee, Balder Von Hohenbalken, Ted Lewis, 1993 .

Extremal structure of convex sets. II

Victor Klee, V. Klee, 1958 .

Some new results on smoothness and rotundity in normed linear spaces

Victor Klee, V. Klee, 1959 .

Continuous Convex Sets.

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

Problem in Barycentric Coordinates

Victor Klee, 1965 .

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

Victor Klee, V. Klee, 1969 .

Deterministic and randomized polynomial-time approximation of radii

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

Impressions of Mathematical Education in the People's Republic of China

Victor Klee, 1977 .

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 .

Random Bipartite Graphs: Connectedness, Isolated Nodes, Diameters.

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

Old And New Unsolved Problems In Plane Geometry And Number Theory

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

Lengths of snakes in boxes

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

Sign-Patterns and Stability

Victor Klee, V. Klee, 1989 .

Linear algebra, polytopes, and the hirsch conjecture

Victor Klee, Fredrick Baden Holt, 1996 .

Inspheres and inner products

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

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 .

Maximal separation theorems for convex sets

Victor Klee, V. Klee, 1968 .

On a theorem of Dubins

Victor Klee, 1963 .

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

Victor Klee, V. Klee, 1975 .

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

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

Monthly Research Problems, 1969–71

Victor Klee, Richard K. Guy, 1971 .

Common supports as fixed points

Victor Klee, Balder Von Hohenbalken, Ted Lewis, 1996 .

THE GREEDY ALGORITHM FOR FINITARY AND COFINITARY MATROIDS

Victor Klee, V. Klee, 1969 .

Qualitative stability of linear systems

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

Which generalized prisms admit H-circuits?

Victor Klee, V. Klee, 1972 .

Asymptotes and Projections of Convex Sets.

Victor Klee, 1960 .

Circumspheres and Inner Products.

Victor Klee, V. Klee, 1960 .

Can the Measure of be Computed in Less than O(n log n) Steps

Victor Klee, 1977 .

The Connectedness Game and the c-Complexity of Certain Graphs

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

On certain intersection properties of convex sets

Victor Klee, 1951 .

Convex polytopes and related complexes

Victor Klee, Peter Kleinschmidt, 1996 .

Diameters of Random Graphs

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

The Euler Characteristic in Combinatorial Geometry

Victor Klee, V. Klee, 1963 .

Invariant extension of linear functionals

Victor Klee, V. Klee, 1954 .

Inapproximability of some Geometric and Quadratic Optimization Problems

Peter Gritzmann, Victor Klee, Andreas Brieden, 2000 .

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

Victor Klee, V. Klee, 1970 .

Extreme points of convex sets without completeness of the Scalar field

Victor Klee, 1964 .

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

Victor Klee, V. Klee, 1969 .

Some semicontinuity theorems for convex polytopes and cell-complexes

Victor Klee, Branko Grünbaum, H. G. Eggleston, 1964 .

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 .

Convexity of Chebyshev sets

Victor Klee, V. Klee, 1961 .