default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarl W. Lee
Person information
- affiliation: University of Kentucky, Lexington, KY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i1]Cory V. Frontin, Gage S. Walters, Freddie D. Witherden, Carl W. Lee, David M. Williams, David L. Darmofal:
Foundations of space-time finite element methods: polytopes, interpolation, and integration. CoRR abs/2012.08701 (2020)
2010 – 2019
- 2011
- [j13]Carl W. Lee:
Sweeping the cd-Index and the Toric h-Vector. Electron. J. Comb. 18(1) (2011)
2000 – 2009
- 2008
- [j12]Mustapha Bouchakour, T. M. Contenza, Carl W. Lee, Ali Ridha Mahjoub:
On the dominating set polytope. Eur. J. Comb. 29(3): 652-661 (2008) - 2004
- [j11]Margaret M. Bayer, Carl W. Lee, Bernd Sturmfels:
Guest Editors' Preface. Discret. Comput. Geom. 32(4): 435-436 (2004) - [r1]Carl W. Lee:
Subdivisions and Triangulationsof Polytopes. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 383-406 - 2000
- [j10]Carl W. Lee:
Kalai's Squeezed Spheres Are Shellable. Discret. Comput. Geom. 24(2-3): 391-396 (2000)
1990 – 1999
- 1998
- [j9]Géza Bohus, William Jockusch, Carl W. Lee, Nagabhushana Prabhu:
On a triangulation of the 3-ball and the solid torus. Discret. Math. 187(1-3): 259-264 (1998) - 1996
- [j8]Carl W. Lee:
P.L.-Spheres, Convex Polytopes, and Stress. Discret. Comput. Geom. 15(4): 389-421 (1996) - 1990
- [c2]Carl W. Lee:
Winding Numbers and the Generalized Lower-Bound Conjecture. Discrete and Computational Geometry 1990: 209-220 - [c1]Carl W. Lee:
Regular Triangulations of Convex Polvtopes. Applied Geometry And Discrete Mathematics 1990: 443-456
1980 – 1989
- 1989
- [j7]Carl W. Lee:
The Associahedron and Triangulations of the n-gon. Eur. J. Comb. 10(6): 551-560 (1989) - 1987
- [j6]Peter Kleinschmidt, Carl W. Lee, Heinz Schannath:
Transportation problems which can be solved by the use of hirsch-paths for the dual problems. Math. Program. 37(2): 153-168 (1987) - 1986
- [j5]Alan J. Hoffman, Carl W. Lee:
On the Cone of Nonnegative Circuits. Discret. Comput. Geom. 1: 229-239 (1986) - [j4]David W. Barnette, Peter Kleinschmidt, Carl W. Lee:
An Upper Bound Theorem for Polytope Pairs. Math. Oper. Res. 11(3): 451-464 (1986) - 1984
- [j3]Peter Kleinschmidt, Carl W. Lee:
On k-stacked polytopes. Discret. Math. 48(1): 125-127 (1984) - 1981
- [j2]Louis J. Billera, Carl W. Lee:
The Numbers of Faces of Polytope Pairs and Unbounded Polyhedra. Eur. J. Comb. 2(4): 307-322 (1981) - [j1]Louis J. Billera, Carl W. Lee:
A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes. J. Comb. Theory A 31(3): 237-255 (1981)
Coauthor Index
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-09-05 01:14 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:
