The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Victor Klee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Bremner, Victor Klee
    Inner diagonals of convex polytopes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  2. Victor Klee
    Shapes of the future - some unsolved problems in high-dimensional intuitive geometry. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  3. Peter Gritzmann, Victor Klee, John Westwater
    On the Limited Power of Linear Probes and Other Optimization Oracles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:92-101 [Conf]
  4. Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
    Approximation of Diameters: Randomization Doesn't Help. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:244-251 [Conf]
  5. Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen
    Computational complexity of norm-maximization. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:203-225 [Journal]
  6. Béla Bollobás, Victor Klee
    Diameters of random bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:7-19 [Journal]
  7. Peter Gritzmann, Victor Klee
    Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:255-280 [Journal]
  8. Peter Gritzmann, Victor Klee, D. G. Larman
    Largest j-Simplices n-Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:477-515 [Journal]
  9. F. B. Holt, Victor Klee
    Many Polytopes Meeting the Conjectured Hirsch Bound. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:1, pp:1-17 [Journal]
  10. F. B. Holt, Victor Klee
    Counterexamples to the Strong d -Step Conjecture for d ge 5. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:1, pp:33-46 [Journal]
  11. Gil Kalai, Victor Klee
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:149-150 [Journal]
  12. Victor Klee, Peter Kleinschmidt
    Geometry of the Gass-Saaty Parametric Cost LP Algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:13-26 [Journal]
  13. Victor Klee, T. Lewis, Balder Von Hohenbalken
    Appollonius Revisited: Supporting Spheres for Sundered Systems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:4, pp:385-395 [Journal]
  14. J. Mihalisin, Victor Klee
    Convex and Linear Orientations of Polytopal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:421-436 [Journal]
  15. Andreas Brieden, Peter Gritzmann, Victor Klee
    Oracle-polynomial-time approximation of largest simplices in convex bodies. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:221, n:1-3, pp:79-92 [Journal]
  16. Victor Klee
    A Method for Constructing Circuit Codes. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1967, v:14, n:3, pp:520-528 [Journal]
  17. Victor Klee, Michael C. Laskowski
    Finding the Smallest Triangles Containing a Given Convex Polygon. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:3, pp:359-375 [Journal]
  18. David Bremner, Victor Klee
    Inner Diagonals of Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:87, n:1, pp:175-197 [Journal]
  19. Victor Klee
    Classification and enumeration of minimum (d, 3, 3)-graphs for odd d. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:184-207 [Journal]
  20. Victor Klee, Howard Quaife
    Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:1, pp:83-93 [Journal]
  21. Peter Gritzmann, Victor Klee
    Deciding uniqueness in norm maximization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:203-214 [Journal]
  22. Peter Gritzmann, Victor Klee
    Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:59, n:, pp:163-213 [Journal]
  23. Peter Gritzmann, Laurent Habsieger, Victor Klee
    Good and Bad Radii of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:395-403 [Journal]
  24. E. Engelhardt, Victor Klee, K. Li, Howard Quaife
    Minimum graphs of specified diameter, connectivity and valence. II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:78, n:3, pp:257-266 [Journal]
  25. Peter Gritzmann, Victor Klee
    On the complexity of some basic problems in computational convexity: I. Containment problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:129-174 [Journal]

  26. A qualitative analysis of I. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002