{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:44:40Z","timestamp":1758278680032},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0196-6774(03)00092-0","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:40:25Z","timestamp":1062603625000},"page":"134-167","source":"Crossref","is-referenced-by-count":7,"title":["The complexity of finding small triangulations of convex 3-polytopes"],"prefix":"10.1016","volume":"50","author":[{"given":"Alexander","family":"Below","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jes\u00fas A.","family":"De\u00a0Loera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Richter-Gebert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0196-6774(03)00092-0_BIB001","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","article-title":"Characterization and recognition of partial 3-trees","volume":"7","author":"Arnborg","year":"1986","journal-title":"SIAM J. Algebraic Discrete Meth."},{"issue":"2","key":"10.1016\/S0196-6774(03)00092-0_BIB002","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB003","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB004","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02187874","article-title":"Triangulating point sets in space","volume":"2","author":"Avis","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB005","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s004540010058","article-title":"Minimal simplicial dissections and triangulations of convex 3-polytopes","volume":"24","author":"Below","year":"2000","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB006","series-title":"Computing in Euclidean Geometry","article-title":"Mesh generation and optimal triangulation","author":"Bern","year":"1992"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB007","series-title":"Handbook of Discrete and Computational Geometry","first-page":"271","article-title":"Face numbers of polytopes and complexes","author":"Billera","year":"1997"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB008","series-title":"Oriented Matroids","author":"Bj\u00f6rner","year":"1992"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB009","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF02187807","article-title":"Triangulating a nonconvex polytope","volume":"5","author":"Chazelle","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB010","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02573985","article-title":"An optimal convex hull algorithm in any fixed dimension","volume":"10","author":"Chazelle","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB011","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0012-365X(82)90185-6","article-title":"Minimal triangulation of the 4-cube","volume":"40","author":"Cottle","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB012","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(90)90293-Q","article-title":"On two dual classes of planar graphs","volume":"80","author":"El-Mallah","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB013","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0747-7171(08)80068-5","article-title":"Tetrahedrizing point sets in three dimensions","volume":"10","author":"Edelsbrunner","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB014","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB015","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02574690","article-title":"A simple and relatively efficient triangulation of the n-cube","volume":"6","author":"Haiman","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB016","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(95)00075-8","article-title":"Simplexity of the cube","volume":"158","author":"Hughes","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB017","series-title":"Handbook of Discrete and Computational Geometry","first-page":"271","article-title":"Subdivisions and triangulations of polytopes","author":"Lee","year":"1997"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB018","series-title":"Applied Geometry and Discrete Mathematics\u2014The Victor Klee Festschrift","first-page":"443","article-title":"Regular triangulations of convex polytopes","volume":"vol. 4","author":"Lee","year":"1991"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB019","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1090\/S1088-4173-98-00025-3","article-title":"Volume formulae for regular hyperbolic cubes","volume":"2","author":"Marshall","year":"1998","journal-title":"Conform. Geom. Dynam."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB020","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB021","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s004540010052","article-title":"Finding small triangulations of polytope boundaries is hard","volume":"24","author":"Richter-Gebert","year":"2000","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB022","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF02579380","article-title":"On triangulations of the convex hull of n points","volume":"5","author":"Rothschild","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB023","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02187840","article-title":"On the difficulty of triangulating three-dimensional non-convex polyhedra","volume":"7","author":"Ruppert","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB024","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01451597","article-title":"\u00dcber die Zerlegung von Dreieckspolyedern in Tetraeder","volume":"98","author":"Sch\u00f6nhardt","year":"1928","journal-title":"Math. Ann."},{"issue":"1","key":"10.1016\/S0196-6774(03)00092-0_BIB025","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/eujc.1999.0327","article-title":"A lower bound for the simplexity of the n-cube via hyperbolic volumes","volume":"21","author":"Smith","year":"2000","journal-title":"Combinatorics of Polytopes, European J. Combin."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB026","series-title":"Surveys in Combinatorics","article-title":"Graph minors\u2014a survey","author":"Robertson","year":"1985"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB027","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0894-0347-1988-0928904-4","article-title":"Rotation distance, triangulations, and hyperbolic geometry","volume":"1","author":"Sleator","year":"1988","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/S0196-6774(03)00092-0_BIB028","doi-asserted-by":"crossref","first-page":"907","DOI":"10.2307\/2589283","article-title":"Polynomial equations and convex polytopes","volume":"105","author":"Sturmfels","year":"1998","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB029","article-title":"The Computation of Fixed Points and Applications","volume":"vol. 124","author":"Todd","year":"1976"},{"key":"10.1016\/S0196-6774(03)00092-0_BIB030","series-title":"Lectures on Polytopes","author":"Ziegler","year":"1994"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000920?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000920?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:29:50Z","timestamp":1551094190000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677403000920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0196677403000920"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00092-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}