Victor Klee - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2000

Oracle-polynomial-time approximation of largest simplices in convex bodiesAndreas Brieden, Peter Gritzmann, Victor Klee. DM, 221(1-3):79-92, 2000. [doi]

Decomposition Theorems for Conditional Sign-Solvability and Sign-Solvability of General SystemsShawn Cokus, Victor Klee. siammax, 21(3):978-988, 2000. [doi]

Guest Editors ForewordGil Kalai, Victor Klee. dcg, 24(2-3):149-150, 2000. [doi]

Convex and Linear Orientations of Polytopal GraphsJ. Mihalisin, Victor Klee. dcg, 24(2-3):421-436, 2000. [doi]

1999

Inner Diagonals of Convex PolytopesDavid Bremner, Victor Klee. JCT, 87(1):175-197, 1999. [doi]

Inner diagonals of convex polytopesDavid Bremner, Victor Klee. cccg 1999: [doi]

Shapes of the future - some unsolved problems in high-dimensional intuitive geometryVictor Klee. cccg 1999: [doi]

1998

Approximation of Diameters: Randomization Doesn t HelpAndreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits. focs 1998: 244-251 [doi]

Many Polytopes Meeting the Conjectured Hirsch BoundF. B. Holt, Victor Klee. dcg, 20(1):1-17, 1998. [doi]

Counterexamples to the Strong d -Step Conjecture for d ge 5F. B. Holt, Victor Klee. dcg, 19(1):33-46, 1998. [doi]

1997

Appollonius Revisited: Supporting Spheres for Sundered SystemsVictor Klee, T. Lewis, Balder Von Hohenbalken. dcg, 18(4):385-395, 1997. [doi]

1995

Largest j-Simplices n-PolytopesPeter Gritzmann, Victor Klee, D. G. Larman. dcg, 13:477-515, 1995.

1994

On the complexity of some basic problems in computational convexity: I. Containment problemsPeter Gritzmann, Victor Klee. DM, 136(1-3):129-174, 1994. [doi]

1993

Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spacesPeter Gritzmann, Victor Klee. mp, 59:163-213, 1993.

1992

Deciding uniqueness in norm maximizationPeter Gritzmann, Victor Klee. mp, 57:203-214, 1992.

Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed SpacesPeter Gritzmann, Victor Klee. dcg, 7:255-280, 1992.

1991

Good and Bad Radii of Convex PolygonsPeter Gritzmann, Laurent Habsieger, Victor Klee. SICOMP, 20(2):395-403, 1991.

1990

Computational complexity of norm-maximizationHans Leo Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen. combinatorica, 10(2):203-225, 1990.

On the Limited Power of Linear Probes and Other Optimization OraclesPeter Gritzmann, Victor Klee, John Westwater. compgeom 1990: 92-101 [doi]

Geometry of the Gass-Saaty Parametric Cost LP AlgorithmVictor Klee, Peter Kleinschmidt. dcg, 5:13-26, 1990.

1988

A qualitative analysis of ::::I::::Terrence Bone, Clark Jeffries, Victor Klee. DAM, 20(1):9-30, 1988. [doi]

1987

d-Step Conjecture and Its RelativesVictor Klee, Peter Kleinschmidt. mor, 12(4):718-755, 1987. [doi]

1985

Finding the Smallest Triangles Containing a Given Convex PolygonVictor Klee, Michael C. Laskowski. jal, 6(3):359-375, 1985.

1984

Diameters of random bipartite graphsBéla Bollobás, Victor Klee. combinatorica, 4(1):7-19, 1984.

1980

Classification and enumeration of minimum (d, 3, 3)-graphs for odd dVictor Klee. JCT, 28(2):184-207, 1980. [doi]

Combinatorial Optimization: What is the State of the ArtVictor Klee. mor, 5(1):1-26, 1980. [doi]

1977

Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphsVictor Klee, Howard Quaife. JCT, 23(1):83-93, 1977. [doi]

1976

Minimum Graphs of Specified Diameter, Connectivity and Valence. IVictor Klee, Howard Quaife. mor, 1(1):28-31, 1976. [doi]

1972

Experimental designs through level reduction of the d-dimensional cuboctahedronD. H. Doehlert, Victor Klee. DM, 2(4):309-334, 1972. [doi]

1967

A Method for Constructing Circuit CodesVictor Klee. JACM, 14(3):520-528, 1967. [doi]

Sign in or sign up to see more results.

runs on WebDSL