* The Klee-Minty cube: A specific example of a linear program that shows the limitations of some algorithms.
* The Klee-Minty problem: A class of linear programming problems that have a high sensitivity to small changes in input data.
* The Klee measure problem: A problem in convex geometry that asks for the smallest possible volume of a convex body containing a given set of points.
* The Klee-Wagon theorem: A result in discrete geometry that gives a lower bound on the number of vertices of a convex polytope.
While Klee did not write fiction or non-fiction books for general audiences, he wrote extensively in mathematical journals and papers on these and other topics.