The Numbers of Faces of Polytope Pairs and Unbounded Polyhedra. - Louis J. Billera; Carl W. Lee (Eur. J. Comb., 1981)

A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes. - Louis J. Billera; Carl W. Lee (J. Comb. Theory A, 1981)

On k-stacked polytopes. - Peter Kleinschmidt; Carl W. Lee (Discret. Math., 1984)

On the Cone of Nonnegative Circuits. - Alan J. Hoffman; Carl W. Lee (Discret. Comput. Geom., 1986)

An Upper Bound Theorem for Polytope Pairs. - David W. Barnette; Peter Kleinschmidt; Carl W. Lee (Math. Oper. Res., 1986)

Transportation problems which can be solved by the use of hirsch-paths for the dual problems. - Peter Kleinschmidt; Carl W. Lee; Heinz Schannath (Math. Program., 1987)

The Associahedron and Triangulations of the n-gon. - Carl W. Lee (Eur. J. Comb., 1989)

Regular Triangulations of Convex Polvtopes. - Carl W. Lee (Applied Geometry And Discrete Mathematics, 1990)

Winding Numbers and the Generalized Lower-Bound Conjecture. - Carl W. Lee (Discrete and Computational Geometry, 1990)

P.L.-Spheres, Convex Polytopes, and Stress. - Carl W. Lee (Discret. Comput. Geom., 1996)

On a triangulation of the 3-ball and the solid torus. - Géza Bohus; William Jockusch; Carl W. Lee; Nagabhushana Prabhu (Discret. Math., 1998)

Kalai's Squeezed Spheres Are Shellable. - Carl W. Lee (Discret. Comput. Geom., 2000)

Guest Editors' Preface. - Margaret M. Bayer; Carl W. Lee; Bernd Sturmfels (Discret. Comput. Geom., 2004)

Subdivisions and Triangulationsof Polytopes. - Carl W. Lee (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

On the dominating set polytope. - Mustapha Bouchakour; T. M. Contenza; Carl W. Lee; Ali Ridha Mahjoub (Eur. J. Comb., 2008)

Sweeping the cd-Index and the Toric h-Vector. - Carl W. Lee (Electron. J. Comb., 2011)

Foundations of space-time finite element methods: polytopes, interpolation, and integration. - Cory V. Frontin; Gage S. Walters; Freddie D. Witherden; Carl W. Lee; David M. Williams; David L. Darmofal (CoRR, 2020)