Discrete & Computational Geometry
| Discipline | discrete geometry, computational geometry |
|---|---|
| Language | English |
| Edited by | Kenneth L. Clarkson, János Pach, Csaba D. Tóth. |
| Publication details | |
| History | 1986–present |
| Publisher | |
| Frequency | Quarterly |
| 0.969 (2020) | |
| Standard abbreviations ISO 4 (alt) · Bluebook (alt) NLM (alt) · MathSciNet (alt Paid subscription required) | |
| ISO 4 | Discrete Comput. Geom. |
| Indexing CODEN (alt · alt2) · JSTOR (alt) · LCCN (alt) MIAR · NLM (alt) · Scopus · W&L | |
| CODEN | DCGEER |
| ISSN | 0179-5376 (print) 1432-0444 (web) |
| LCCN | 90656510 |
| Links | |
Discrete & Computational Geometry is a peer-reviewed mathematics journal published quarterly by Springer. Founded in 1986 by Jacob E. Goodman and Richard M. Pollack, the journal publishes articles on discrete geometry and computational geometry.
Abstracting and indexing
[edit ]The journal is indexed in:
- Mathematical Reviews
- Zentralblatt MATH
- Science Citation Index
- Current Contents /Engineering, Computing and Technology
Notable articles
[edit ]Two articles published in Discrete & Computational Geometry, one by Gil Kalai in 1992 with a proof of a subexponential upper bound on the diameter of a polytope [1] and another by Samuel Ferguson in 2006 on the Kepler conjecture on optimal three-dimensional sphere packing,[2] earned their authors the Fulkerson Prize.[3]
References
[edit ]- ^ Kalai, Gil (1992). "Upper bounds for the diameter and height of graphs of the convex polyhedra". Discrete & Computational Geometry. 8 (4): 363–372. doi:10.1007/bf02293053 .
- ^ Ferguson, Samuel P. (2006). "Sphere Packings, V. Pentahedral Prisms". Discrete & Computational Geometry. 36: 167–204. doi:10.1007/s00454-005-1214-y .
- ^ "The Fulkerson Prize". Mathematical Optimization Society. Retrieved 2023年07月10日.
External links
[edit ]
This article about a mathematics journal is a stub. You can help Wikipedia by expanding it.
See tips for writing articles about academic journals. Further suggestions might be found on the article's talk page.