{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:54:13Z","timestamp":1750308853709,"version":"3.41.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T00:00:00Z","timestamp":1746748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T00:00:00Z","timestamp":1746748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006527","name":"Direcci\u00f3n General de Investigaci\u00f3n Cient\u00edfica y T\u00e9cnica","doi-asserted-by":"publisher","award":["PID2022-137283NB-C21\/AEI\/10.13039\/501100011033"],"award-info":[{"award-number":["PID2022-137283NB-C21\/AEI\/10.13039\/501100011033"]}],"id":[{"id":"10.13039\/501100006527","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010784","name":"Banco Santander","doi-asserted-by":"publisher","award":["21.SI03.6465821.SI03.64658"],"award-info":[{"award-number":["21.SI03.6465821.SI03.64658"]}],"id":[{"id":"10.13039\/100010784","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010789","name":"Direcci\u00f3n General de Universidades e Investigaci\u00f3n","doi-asserted-by":"publisher","award":["FPU19\/04163"],"award-info":[{"award-number":["FPU19\/04163"]}],"id":[{"id":"10.13039\/501100010789","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s00454-025-00738-1","type":"journal-article","created":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T14:00:52Z","timestamp":1746799252000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Associahedra Minimize F-Vectors of Secondary Polytopes of Planar Point Sets"],"prefix":"10.1007","volume":"74","author":[{"given":"Antonio","family":"Fern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2120-9068","authenticated-orcid":false,"given":"Francisco","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,9]]},"reference":[{"key":"738_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane graphs. In: Proceedings of the ACM-SIAM Symp. on Discrete Algorithms, SODA\u201906 (2006)","DOI":"10.1145\/1109557.1109613"},{"key":"738_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.comgeo.2004.02.003","volume":"29","author":"O Aichholzer","year":"2004","unstructured":"Aichholzer, O., Hurtado, F., Noy, M.: A lower bound on the number of triangulations of planar point sets. Comput. Geom. Theory Appl. 29, 135\u2013145 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"738_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1006\/eujc.1999.0319","volume":"21","author":"CA Athanasiadis","year":"2000","unstructured":"Athanasiadis, C.A., De Loera, J.A., Reiner, V., Santos, F.: Fiber polytopes for the projections between cyclic polytopes. Eur. J. Combin. 21(1), 19\u201347 (2000)","journal-title":"Eur. J. Combin."},{"key":"738_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00454-001-0050-y","volume":"27","author":"M Azaola","year":"2002","unstructured":"Azaola, M., Santos, F.: The number of triangulations of the cyclic polytope $$C(n, n-4)$$. Discrete Comput. Geom. 27, 29\u201348 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"738_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00283-009-9120-4","volume":"32","author":"L Beineke","year":"2010","unstructured":"Beineke, L., Wilson, R.: The early history of the brick factory problem. Math. Intell. 32, 41\u201348 (2010)","journal-title":"Math. Intell."},{"key":"738_CR6","volume-title":"Oriented Matroids","author":"A Bj\u00f6rner","year":"1992","unstructured":"Bj\u00f6rner, A., Vergnas, M.L., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids. Cambridge University Press, Cambridge (1992)"},{"key":"738_CR7","volume-title":"Triangulations, Structures for Algorithms and Applications","author":"JA De Loera","year":"2010","unstructured":"De Loera, J.A., Rambau, J., Santos, F.: Triangulations, Structures for Algorithms and Applications. Springer, Berlin (2010)"},{"key":"738_CR8","first-page":"278","volume":"40","author":"IM Gelfand","year":"1990","unstructured":"Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Newton polyhedra of principal $$A$$-determinants. Soviet Math. Dokl. 40, 278\u2013281 (1990)","journal-title":"Soviet Math. Dokl."},{"key":"738_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4771-1","volume-title":"Discriminants, Resultants and Multidimensional Determinants","author":"IM Gelfand","year":"1994","unstructured":"Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Discriminants, Resultants and Multidimensional Determinants. Birkh\u00e4user, Boston (1994)"},{"key":"738_CR10","first-page":"68","volume":"7","author":"RK Guy","year":"1960","unstructured":"Guy, R.K.: A combinatorial problem. Bull. Malayan Math. Soc. 7, 68\u201372 (1960)","journal-title":"Bull. Malayan Math. Soc."},{"key":"738_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0013091500025645","volume":"13","author":"F Harary","year":"1963","unstructured":"Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinb. Math. Soc. (2) 13, 333\u2013338 (1963)","journal-title":"Proc. Edinb. Math. Soc. (2)"},{"key":"738_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103636","volume":"108","author":"A Kupavskii","year":"2023","unstructured":"Kupavskii, A., Volostnov, A., Yarovikov, Y.: Minimum number of partial triangulations. Eur. J. Combin. 108, 103636 (2023)","journal-title":"Eur. J. Combin."},{"issue":"6","key":"738_CR13","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/S0195-6698(89)80072-1","volume":"10","author":"CW Lee","year":"1989","unstructured":"Lee, C.W.: The associahedron and triangulations of the $$n$$-gon. Eur. J. Combin. 10(6), 551\u2013560 (1989)","journal-title":"Eur. J. Combin."},{"key":"738_CR14","doi-asserted-by":"publisher","unstructured":"Rutschmann, D., Wettstein, M.: Chains, Koch chains, and point sets with many triangulations. J. ACM 70(3), Article 18 (2023). https:\/\/doi.org\/10.1145\/3585535","DOI":"10.1145\/3585535"},{"key":"738_CR15","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Combin. DS21 (2024). https:\/\/doi.org\/10.37236\/2713","DOI":"10.37236\/2713"},{"key":"738_CR16","unstructured":"OEIS Foundation Inc.: The On-Line Encyclopedia of Integer Sequences, Published electronically at https:\/\/oeis.org (2025)"},{"key":"738_CR17","volume-title":"Lectures on Polytopes","author":"GM Ziegler","year":"1994","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Springer, New York (1994)"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00738-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-025-00738-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00738-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:14:10Z","timestamp":1750281250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-025-00738-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,9]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["738"],"URL":"https:\/\/doi.org\/10.1007\/s00454-025-00738-1","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2025,5,9]]},"assertion":[{"value":"5 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}