| 2000 |
|---|
| 36 | EE | Gil Kalai,
Victor Klee:
Guest Editors' Foreword.
Discrete & Computational Geometry 24(2-3): 149-150 (2000) |
| 35 | EE | J. Mihalisin,
Victor Klee:
Convex and Linear Orientations of Polytopal Graphs.
Discrete & Computational Geometry 24(2-3): 421-436 (2000) |
| 34 | EE | Andreas Brieden,
Peter Gritzmann,
Victor Klee:
Oracle-polynomial-time approximation of largest simplices in convex bodies.
Discrete Mathematics 221(1-3): 79-92 (2000) |
| 1999 |
|---|
| 33 | EE | David Bremner,
Victor Klee:
Inner diagonals of convex polytopes.
CCCG 1999 |
| 32 | EE | Victor Klee:
Shapes of the future - some unsolved problems in high-dimensional intuitive geometry.
CCCG 1999 |
| 31 | EE | David Bremner,
Victor Klee:
Inner Diagonals of Convex Polytopes.
J. Comb. Theory, Ser. A 87(1): 175-197 (1999) |
| 1998 |
|---|
| 30 | EE | Andreas Brieden,
Peter Gritzmann,
Ravi Kannan,
Victor Klee,
László Lovász,
Miklós Simonovits:
Approximation of Diameters: Randomization Doesn't Help.
FOCS 1998: 244-251 |
| 29 | EE | F. B. Holt,
Victor Klee:
Counterexamples to the Strong d -Step Conjecture for d ge 5.
Discrete & Computational Geometry 19(1): 33-46 (1998) |
| 28 | EE | F. B. Holt,
Victor Klee:
Many Polytopes Meeting the Conjectured Hirsch Bound.
Discrete & Computational Geometry 20(1): 1-17 (1998) |
| 1997 |
|---|
| 27 | EE | Victor Klee,
T. Lewis,
Balder Von Hohenbalken:
Appollonius Revisited: Supporting Spheres for Sundered Systems.
Discrete & Computational Geometry 18(4): 385-395 (1997) |
| 26 | | Peter Gritzmann,
Victor Klee:
Separation by Hyperplanes in Finite-Dimensional Vector Spaces Over Archimedean Ordered Fields
Universität Trier, Mathematik/Informatik, Forschungsbericht 97-02: (1997) |
| 1996 |
|---|
| 25 | | Peter Gritzmann,
Victor Klee:
Computational Convexity
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-25: (1996) |
| 1995 |
|---|
| 24 | | Peter Gritzmann,
Victor Klee,
D. G. Larman:
Largest j-Simplices n-Polytopes.
Discrete & Computational Geometry 13: 477-515 (1995) |
| 23 | | Thomas Burger,
Peter Gritzmann,
Victor Klee:
Polytope Projection and Projection Polytopes
Universität Trier, Mathematik/Informatik, Forschungsbericht 95-14: (1995) |
| 1994 |
|---|
| 22 | EE | Peter Gritzmann,
Victor Klee:
On the complexity of some basic problems in computational convexity: I. Containment problems.
Discrete Mathematics 136(1-3): 129-174 (1994) |
| 21 | | Peter Gritzmann,
Victor Klee,
D. G. Larman:
Largest j-Simplices in n-Polytopes
Universität Trier, Mathematik/Informatik, Forschungsbericht 94-01: (1994) |
| 20 | | 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 94-07: (1994) |
| 1993 |
|---|
| 19 | | Peter Gritzmann,
Victor Klee:
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces.
Math. Program. 59: 163-213 (1993) |
| 18 | | 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 93-06: (1993) |
| 17 | | Peter Gritzmann,
Victor Klee:
External Tangents and Closedness of Cone + Subspace
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-14: (1993) |
| 16 | | Peter Gritzmann,
Victor Klee,
B. S. Tam:
Cross-Positive Matrices Revisited
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-17: (1993) |
| 15 | | Peter Gritzmann,
Victor Klee:
On the Complexity of some Basic Problems in Computational Convexity: 1. Containment Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-18: (1993) |
| 1992 |
|---|
| 14 | | Peter Gritzmann,
Victor Klee:
Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces.
Discrete & Computational Geometry 7: 255-280 (1992) |
| 13 | | Peter Gritzmann,
Victor Klee:
Deciding uniqueness in norm maximization.
Math. Program. 57: 203-214 (1992) |
| 12 | | Peter Gritzmann,
Victor Klee,
John Westwater:
Polytope Containment and Determination by Linear Probes
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-26: (1992) |
| 1991 |
|---|
| 11 | | Peter Gritzmann,
Laurent Habsieger,
Victor Klee:
Good and Bad Radii of Convex Polygons.
SIAM J. Comput. 20(2): 395-403 (1991) |
| 1990 |
|---|
| 10 | EE | Peter Gritzmann,
Victor Klee,
John Westwater:
On the Limited Power of Linear Probes and Other Optimization Oracles.
Symposium on Computational Geometry 1990: 92-101 |
| 9 | | Hans L. Bodlaender,
Peter Gritzmann,
Victor Klee,
Jan van Leeuwen:
Computational complexity of norm-maximization.
Combinatorica 10(2): 203-225 (1990) |
| 8 | | Victor Klee,
Peter Kleinschmidt:
Geometry of the Gass-Saaty Parametric Cost LP Algorithm.
Discrete & Computational Geometry 5: 13-26 (1990) |
| 1989 |
|---|
| 7 | EE | E. Engelhardt,
Victor Klee,
K. Li,
Howard Quaife:
Minimum graphs of specified diameter, connectivity and valence. II.
Discrete Mathematics 78(3): 257-266 (1989) |
| 1988 |
|---|
| 6 | EE | Terrence Bone,
Clark Jeffries,
Victor Klee:
A qualitative analysis of I.
Discrete Applied Mathematics 20(1): 9-30 (1988) |
| 1985 |
|---|
| 5 | | Victor Klee,
Michael C. Laskowski:
Finding the Smallest Triangles Containing a Given Convex Polygon.
J. Algorithms 6(3): 359-375 (1985) |
| 1984 |
|---|
| 4 | | Béla Bollobás,
Victor Klee:
Diameters of random bipartite graphs.
Combinatorica 4(1): 7-19 (1984) |
| 1980 |
|---|
| 3 | EE | Victor Klee:
Classification and enumeration of minimum (d, 3, 3)-graphs for odd d.
J. Comb. Theory, Ser. B 28(2): 184-207 (1980) |
| 1977 |
|---|
| 2 | EE | 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): 83-93 (1977) |
| 1967 |
|---|
| 1 | EE | Victor Klee:
A Method for Constructing Circuit Codes.
J. ACM 14(3): 520-528 (1967) |
