Victor Klee

According to our database, Victor Klee authored at least 39 papers between 1967 and 2004.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2004

Computational Convexity.

Peter Gritzmann, Victor Klee

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2000

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

Shawn Cokus, Victor Klee

SIAM J. Matrix Anal. Appl., 2000

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

Andreas Brieden, Peter Gritzmann, Victor Klee

Discret. Math., 2000

Convex and Linear Orientations of Polytopal Graphs.

J. Mihalisin, Victor Klee

Discret. Comput. Geom., 2000

Guest Editors' Foreword.

Gil Kalai, Victor Klee

Discret. Comput. Geom., 2000

1999

Inner Diagonals of Convex Polytopes.

David Bremner, Victor Klee

J. Comb. Theory, Ser. A, 1999

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

Victor Klee

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Counterexamples to the Strong d -Step Conjecture for d ge 5.

Fred B. Holt, Victor Klee

Discret. Comput. Geom., 1998

Many Polytopes Meeting the Conjectured Hirsch Bound.

Fred B. Holt, Victor Klee

Discret. Comput. Geom., 1998

Approximation of Diameters: Randomization Doesn't Help.

Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

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

Peter Gritzmann, Victor Klee

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Appollonius Revisited: Supporting Spheres for Sundered Systems.

Victor Klee, T. Lewis, Balder Von Hohenbalken

Discret. Comput. Geom., 1997

1996

Computational Convexity

Peter Gritzmann, Victor Klee

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

1995

Polytope Projection and Projection Polytopes

Thomas Burger, Peter Gritzmann, Victor Klee

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

1994

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

Peter Gritzmann, Victor Klee

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Largest j-Simplices in n-Polytopes

Peter Gritzmann, Victor Klee, David G. Larman

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

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

Peter Gritzmann, Victor Klee

Discret. Math., 1994

1993

On the Complexity of some Basic Problems in Computational Convexity: 1. Containment Problems

Peter Gritzmann, Victor Klee

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Cross-Positive Matrices Revisited

Peter Gritzmann, Victor Klee, B. S. Tam

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

External Tangents and Closedness of Cone + Subspace

Peter Gritzmann, Victor Klee

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Computational Complexity of Inner and Outer j-RADII of Polytopes in Finite-Dimensional Normed Spaces

Peter Gritzmann, Victor Klee

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

1992

Polytope Containment and Determination by Linear Probes

Peter Gritzmann, Victor Klee, John Westwater

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Deciding uniqueness in norm maximization.

Peter Gritzmann, Victor Klee

Math. Program., 1992

Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces.

Peter Gritzmann, Victor Klee

Discret. Comput. Geom., 1992

1991

Good and Bad Radii of Convex Polygons.

Peter Gritzmann, Laurent Habsieger, Victor Klee

SIAM J. Comput., 1991

1990

Geometry of the Gass-Saaty Parametric Cost LP Algorithm.

Victor Klee, Peter Kleinschmidt

Discret. Comput. Geom., 1990

Computational complexity of norm-maximization.

Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen

Comb., 1990

On the Limited Power of Linear Probes and Other Optimization Oracles.

Peter Gritzmann, Victor Klee, John Westwater

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Minimum graphs of specified diameter, connectivity and valence. II.

E. Engelhardt, Victor Klee, K. Li, Howard Quaife

Discret. Math., 1989

1988

A qualitative analysis of <i>I</i>.

Terrence Bone, Clark Jeffries, Victor Klee

Discret. Appl. Math., 1988

1987

The <i>d</i>-Step Conjecture and Its Relatives.

Victor Klee, Peter Kleinschmidt

Math. Oper. Res., 1987

1985

Finding the Smallest Triangles Containing a Given Convex Polygon.

Victor Klee, Michael C. Laskowski

J. Algorithms, 1985

1984

Diameters of random bipartite graphs.

Béla Bollobás, Victor Klee

Comb., 1984

1980

Combinatorial Optimization: What is the State of the Art.

Victor Klee

Math. Oper. Res., 1980

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

Victor Klee

J. Comb. Theory, Ser. B, 1980

1977

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

Victor Klee, Howard Quaife

J. Comb. Theory, Ser. B, 1977

1976

Minimum Graphs of Specified Diameter, Connectivity and Valence. I.

Victor Klee, Howard Quaife

Math. Oper. Res., 1976

1972

Experimental designs through level reduction of the d-dimensional cuboctahedron.

D. H. Doehlert, Victor Klee

Discret. Math., 1972

1967

A Method for Constructing Circuit Codes.

Victor Klee

J. ACM, 1967