default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor Klee
- > Home > Persons > Victor Klee
Publications
- 2004
[r1]Peter Gritzmann, Victor Klee:
Computational Convexity. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 693-718- 2000
- [j25]Andreas Brieden, Peter Gritzmann, Victor Klee:
Oracle-polynomial-time approximation of largest simplices in convex bodies. Discret. Math. 221(1-3): 79-92 (2000) - 1998
- [c2]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 - 1997
- [i10]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
- [i9]Peter Gritzmann, Victor Klee:
Computational Convexity. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-25 (1996) - 1995
- [j19]Peter Gritzmann, Victor Klee, David G. Larman:
Largest j-Simplices n-Polytopes. Discret. Comput. Geom. 13: 477-515 (1995) - [i8]Thomas Burger, Peter Gritzmann, Victor Klee:
Polytope Projection and Projection Polytopes. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-14 (1995) - 1994
- [j18]Peter Gritzmann, Victor Klee:
On the complexity of some basic problems in computational convexity: I. Containment problems. Discret. Math. 136(1-3): 129-174 (1994) - [i7]Peter Gritzmann, Victor Klee, David G. Larman:
Largest j-Simplices in n-Polytopes. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-01 (1994) - [i6]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
- [j17]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) - [i5]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) - [i4]Peter Gritzmann, Victor Klee:
External Tangents and Closedness of Cone + Subspace. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-14 (1993) - [i3]Peter Gritzmann, Victor Klee, B. S. Tam:
Cross-Positive Matrices Revisited. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-17 (1993) - [i2]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
- [j16]Peter Gritzmann, Victor Klee:
Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces. Discret. Comput. Geom. 7: 255-280 (1992) - [j15]Peter Gritzmann, Victor Klee:
Deciding uniqueness in norm maximization. Math. Program. 57: 203-214 (1992) - [i1]Peter Gritzmann, Victor Klee, John Westwater:
Polytope Containment and Determination by Linear Probes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-26 (1992) - 1991
- [j14]Peter Gritzmann, Laurent Habsieger, Victor Klee:
Good and Bad Radii of Convex Polygons. SIAM J. Comput. 20(2): 395-403 (1991) - 1990
- [j13]Hans L. Bodlaender
, Peter Gritzmann, Victor Klee, Jan van Leeuwen:
Computational complexity of norm-maximization. Comb. 10(2): 203-225 (1990) - [c1]Peter Gritzmann, Victor Klee, John Westwater:
On the Limited Power of Linear Probes and Other Optimization Oracles. SCG 1990: 92-101
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 21:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
