{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:54Z","timestamp":1740109614533,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T00:00:00Z","timestamp":1496361600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["20GG21 134318\/1"],"award-info":[{"award-number":["20GG21 134318\/1"]}],"id":[{"id":"10.13039\/501100001711","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":[[2017,10]]},"DOI":"10.1007\/s00454-017-9896-5","type":"journal-article","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T13:44:26Z","timestamp":1496411066000},"page":"505-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers"],"prefix":"10.1007","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5360-265X","authenticated-orcid":false,"given":"Manuel","family":"Wettstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"key":"9896_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9di, E.: Crossing-free subgraphs. In: Turgeon, J., Rosa, A., Sabidussi, G. (eds.) Theory and Practice of Combinatorics. North-Holland Mathematical Studies, vol. 60, pp. 9\u201312. North-Holland, Amsterdam (1982)","DOI":"10.1016\/S0304-0208(08)73484-4"},{"key":"9896_CR2","doi-asserted-by":"crossref","unstructured":"Alvarez, V., Seidel, R.: A simple aggregative algorithm for counting triangulations of planar point sets and related problems. In: Computational Geometry (SoCG\u201913), pp. 1\u20138. ACM, New York (2013)","DOI":"10.1145\/2462356.2462392"},{"key":"9896_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"9896_CR4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.tcs.2014.04.024","volume":"544","author":"F Frati","year":"2014","unstructured":"Frati, F., Gudmundsson, J., Welzl, E.: On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. 544, 32\u201359 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9896_CR5","first-page":"265","volume":"33","author":"K G\u00f3rska","year":"2013","unstructured":"G\u00f3rska, K., Karol, A.: Multidimensional Catalan and related numbers as Hausdorff moments. Probab. Math. Stat. 33(2), 265\u2013274 (2013)","journal-title":"Probab. Math. Stat."},{"issue":"2\u20133","key":"9896_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","volume":"63","author":"D Kelly","year":"1987","unstructured":"Kelly, D.: Fundamentals of planar ordered sets. Discrete Math. 63(2\u20133), 197\u2013216 (1987)","journal-title":"Discrete Math."},{"issue":"4","key":"9896_CR7","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1016\/j.jcta.2010.12.010","volume":"118","author":"JB Lewis","year":"2011","unstructured":"Lewis, J.B.: Pattern avoidance for alternating permutations and Young tableaux. J. Comb. Theory Ser. A 118(4), 1436\u20131450 (2011)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"9896_CR8","first-page":"53","volume":"1","author":"J-C Novelli","year":"1997","unstructured":"Novelli, J.-C., Pak, I., Stoyanovskii, A.V.: A direct bijective proof of the hook-length formula. Discrete Math. Theor. Comput. Sci. 1(1), 53\u201367 (1997)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"6\u20137","key":"9896_CR9","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/j.comgeo.2010.03.003","volume":"43","author":"R Seidel","year":"2010","unstructured":"Seidel, R.: Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. 43(6\u20137), 556\u2013564 (2010)","journal-title":"Comput. Geom."},{"issue":"1","key":"9896_CR10","doi-asserted-by":"crossref","first-page":"P70","DOI":"10.37236\/557","volume":"18","author":"M Sharir","year":"2011","unstructured":"Sharir, M., Sheffer, A.: Counting triangulations of planar point sets. Electron. J. Comb. 18(1), P70 (2011)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"9896_CR11","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/050636036","volume":"36","author":"M Sharir","year":"2006","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings, cycles, and partitions. SIAM J. Comput. 36(3), 695\u2013720 (2006)","journal-title":"SIAM J. Comput."},{"key":"9896_CR12","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics. Vol. 2. Cambridge Studies in Advanced Mathematics, vol. 62. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin. Cambridge University Press, Cambridge (1999)","DOI":"10.1017\/CBO9780511609589"},{"issue":"1","key":"9896_CR13","doi-asserted-by":"crossref","first-page":"R54","DOI":"10.37236\/1807","volume":"11","author":"RA Sulanke","year":"2004","unstructured":"Sulanke, R.A.: Generalizing Narayana and Schr\u00f6der numbers to higher dimensions. Electron. J. Comb. 11(1), R54 (2004)","journal-title":"Electron. J. Comb."},{"issue":"4","key":"9896_CR14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1(4), 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9896_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.4153\/CJM-1962-002-9","volume":"14","author":"WT Tutte","year":"1962","unstructured":"Tutte, W.T.: A census of planar triangulations. Can. J. Math. 14, 21\u201338 (1962)","journal-title":"Can. J. Math."},{"key":"9896_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"JH Lint van","year":"2001","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-017-9896-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9896-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9896-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T09:21:37Z","timestamp":1602235297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-017-9896-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,2]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9896"],"URL":"https:\/\/doi.org\/10.1007\/s00454-017-9896-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2017,6,2]]}}}