Victor Klee

Publication Activity (10 Years)

Years Active: 1967-2000
Publications (10 Years): 0

Publications

Gil Kalai, Victor Klee
Guest Editors' Foreword. Discret. Comput. Geom. 24 (2-3) (2000)
Shawn Cokus, Victor Klee
Decomposition Theorems for Conditional Sign-Solvability and Sign-Solvability of General Systems. SIAM J. Matrix Anal. Appl. 21 (3) (2000)
J. Mihalisin, Victor Klee
Convex and Linear Orientations of Polytopal Graphs. Discret. Comput. Geom. 24 (2-3) (2000)
Andreas Brieden, Peter Gritzmann, Victor Klee
Oracle-polynomial-time approximation of largest simplices in convex bodies. Discret. Math. 221 (1-3) (2000)
David Bremner, Victor Klee
Inner Diagonals of Convex Polytopes. J. Comb. Theory, Ser. A 87 (1) (1999)
David Bremner, Victor Klee
Inner diagonals of convex polytopes. CCCG (1999)
Victor Klee
Shapes of the future - some unsolved problems in high-dimensional intuitive geometry. CCCG (1999)
F. B. Holt, Victor Klee
Counterexamples to the Strong d -Step Conjecture for d ge 5. Discret. Comput. Geom. 19 (1) (1998)
F. B. Holt, Victor Klee
Many Polytopes Meeting the Conjectured Hirsch Bound. Discret. Comput. Geom. 20 (1) (1998)
Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
Approximation of Diameters: Randomization Doesn't Help. FOCS (1998)
Victor Klee, T. Lewis, Balder Von Hohenbalken
Appollonius Revisited: Supporting Spheres for Sundered Systems. Discret. Comput. Geom. 18 (4) (1997)
Peter Gritzmann, Victor Klee
Separation by Hyperplanes in Finite-Dimensional Vector Spaces Over Archimedean Ordered Fields Universität Trier, Mathematik/Informatik, Forschungsbericht (1997)
Peter Gritzmann, Victor Klee
Computational Convexity Universität Trier, Mathematik/Informatik, Forschungsbericht (1996)
Peter Gritzmann, Victor Klee, David G. Larman
Largest j-Simplices n-Polytopes. Discret. Comput. Geom. 13 (1995)
Thomas Burger, Peter Gritzmann, Victor Klee
Polytope Projection and Projection Polytopes Universität Trier, Mathematik/Informatik, Forschungsbericht (1995)
Peter Gritzmann, Victor Klee
On the complexity of some basic problems in computational convexity: I. Containment problems. Discret. Math. 136 (1-3) (1994)
Peter Gritzmann, Victor Klee, David G. Larman
Largest j-Simplices in n-Polytopes Universität Trier, Mathematik/Informatik, Forschungsbericht (1994)
Peter Gritzmann, Victor Klee
On the Complexity of some Basic Problems in Computational Convexity: II. Volume and mixed volumes Universität Trier, Mathematik/Informatik, Forschungsbericht (1994)
Peter Gritzmann, Victor Klee, B. S. Tam
Cross-Positive Matrices Revisited Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Peter Gritzmann, Victor Klee
Computational Complexity of Inner and Outer j-RADII of Polytopes in Finite-Dimensional Normed Spaces Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Peter Gritzmann, Victor Klee
External Tangents and Closedness of Cone + Subspace Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Peter Gritzmann, Victor Klee
On the Complexity of some Basic Problems in Computational Convexity: 1. Containment Problems Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Peter Gritzmann, Victor Klee
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program. 59 (1993)
Peter Gritzmann, Victor Klee, John Westwater
Polytope Containment and Determination by Linear Probes Universität Trier, Mathematik/Informatik, Forschungsbericht (1992)
Peter Gritzmann, Victor Klee
Deciding uniqueness in norm maximization. Math. Program. 57 (1992)
Peter Gritzmann, Victor Klee
Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces. Discret. Comput. Geom. 7 (1992)
Peter Gritzmann, Laurent Habsieger, Victor Klee
Good and Bad Radii of Convex Polygons. SIAM J. Comput. 20 (2) (1991)
Peter Gritzmann, Victor Klee, John Westwater
On the Limited Power of Linear Probes and Other Optimization Oracles. SCG (1990)
Victor Klee, Peter Kleinschmidt
Geometry of the Gass-Saaty Parametric Cost LP Algorithm. Discret. Comput. Geom. 5 (1990)
Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen
Computational complexity of norm-maximization. Comb. 10 (2) (1990)
E. Engelhardt, Victor Klee, K. Li, Howard Quaife
Minimum graphs of specified diameter, connectivity and valence. II. Discret. Math. 78 (3) (1989)
Terrence Bone, Clark Jeffries, Victor Klee
. Discret. Appl. Math. 20 (1) (1988)
Victor Klee, Peter Kleinschmidt
-Step Conjecture and Its Relatives. Math. Oper. Res. 12 (4) (1987)
Victor Klee, Michael C. Laskowski
Finding the Smallest Triangles Containing a Given Convex Polygon. J. Algorithms 6 (3) (1985)
Béla Bollobás, Victor Klee
Diameters of random bipartite graphs. Comb. 4 (1) (1984)
Victor Klee
Classification and enumeration of minimum (d, 3, 3)-graphs for odd d. J. Comb. Theory, Ser. B 28 (2) (1980)
Victor Klee
Combinatorial Optimization: What is the State of the Art. Math. Oper. Res. 5 (1) (1980)
Victor Klee, Howard Quaife
Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphs. J. Comb. Theory, Ser. B 23 (1) (1977)
Victor Klee, Howard Quaife
Minimum Graphs of Specified Diameter, Connectivity and Valence. I. Math. Oper. Res. 1 (1) (1976)
D. H. Doehlert, Victor Klee
Experimental designs through level reduction of the d-dimensional cuboctahedron. Discret. Math. 2 (4) (1972)
Victor Klee
A Method for Constructing Circuit Codes. J. ACM 14 (3) (1967)