Victor Klee - RankMe

42 papers A* 1Journal 37Unranked 3

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