Victor Klee

According to our database1, Victor Klee authored at least 41 papers between 1967 and 2004.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2004
Computational Convexity.
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.
SIAM J. Matrix Analysis Applications, 2000

Oracle-polynomial-time approximation of largest simplices in convex bodies.
Discrete Mathematics, 2000

Convex and Linear Orientations of Polytopal Graphs.
Discrete & Computational Geometry, 2000

Guest Editors' Foreword.
Discrete & Computational Geometry, 2000

1999
Shapes of the future - some unsolved problems in high-dimensional intuitive geometry.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Inner diagonals of convex polytopes.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Counterexamples to the Strong d -Step Conjecture for d ge 5.
Discrete & Computational Geometry, 1998

Many Polytopes Meeting the Conjectured Hirsch Bound.
Discrete & Computational Geometry, 1998

Approximation of Diameters: Randomization Doesn't Help.
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
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Appollonius Revisited: Supporting Spheres for Sundered Systems.
Discrete & Computational Geometry, 1997

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

1995
Polytope Projection and Projection Polytopes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Largest j-Simplices n-Polytopes.
Discrete & Computational Geometry, 1995

1994
On the Complexity of some Basic Problems in Computational Convexity: II. Volume and mixed volumes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Largest j-Simplices in n-Polytopes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

On the complexity of some basic problems in computational convexity: I. Containment problems.
Discrete Mathematics, 1994

1993
On the Complexity of some Basic Problems in Computational Convexity: 1. Containment Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Cross-Positive Matrices Revisited
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

External Tangents and Closedness of Cone + Subspace
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Computational Complexity of Inner and Outer j-RADII of Polytopes in Finite-Dimensional Normed Spaces
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces.
Math. Program., 1993

1992
Polytope Containment and Determination by Linear Probes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Deciding uniqueness in norm maximization.
Math. Program., 1992

Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces.
Discrete & Computational Geometry, 1992

1991
Good and Bad Radii of Convex Polygons.
SIAM J. Comput., 1991

1990
Geometry of the Gass-Saaty Parametric Cost LP Algorithm.
Discrete & Computational Geometry, 1990

Computational complexity of norm-maximization.
Combinatorica, 1990

On the Limited Power of Linear Probes and Other Optimization Oracles.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Minimum graphs of specified diameter, connectivity and valence. II.
Discrete Mathematics, 1989

1988
A qualitative analysis of I.
Discrete Applied Mathematics, 1988

1987
The d-Step Conjecture and Its Relatives.
Math. Oper. Res., 1987

1985
Finding the Smallest Triangles Containing a Given Convex Polygon.
J. Algorithms, 1985

1984
Diameters of random bipartite graphs.
Combinatorica, 1984

1980
Combinatorial Optimization: What is the State of the Art.
Math. Oper. Res., 1980

Classification and enumeration of minimum (d, 3, 3)-graphs for odd d.
J. Comb. Theory, Ser. B, 1980

1977
Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphs.
J. Comb. Theory, Ser. B, 1977

1976
Minimum Graphs of Specified Diameter, Connectivity and Valence. I.
Math. Oper. Res., 1976

1972
Experimental designs through level reduction of the d-dimensional cuboctahedron.
Discrete Mathematics, 1972

1967
A Method for Constructing Circuit Codes.
J. ACM, 1967


  Loading...