{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:35Z","timestamp":1740107135204,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T00:00:00Z","timestamp":1441152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T00:00:00Z","timestamp":1441152000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1001667"],"award-info":[{"award-number":["1001667"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NWO","award":["639.021.123"],"award-info":[{"award-number":["639.021.123"]}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["35586"],"award-info":[{"award-number":["35586"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1423615"],"award-info":[{"award-number":["1423615"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00373-015-1621-7","type":"journal-article","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T07:45:43Z","timestamp":1441093543000},"page":"923-942","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Counting Carambolas"],"prefix":"10.1007","volume":"32","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,2]]},"reference":[{"issue":"1","key":"1621_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00373-007-0704-5","volume":"23","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Hackl, T., Vogtenhuber, B., Huemer, C., Hurtado, F., Krasser, H.: On the number of plane geometric graphs. Graphs Combin. 23(1), 67\u201384 (2007)","journal-title":"Graphs Combin."},{"key":"1621_CR2","first-page":"9","volume":"12","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. Ann. Discrete Math. 12, 9\u201312 (1982)","journal-title":"Ann. Discrete Math."},{"key":"1621_CR3","doi-asserted-by":"crossref","unstructured":"Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. In: Proceedings of 13th Annual International Conference on Computing and Combinatorics (COCOON), LNCS 4598, pp. 97\u2013107. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73545-8_12"},{"key":"1621_CR4","doi-asserted-by":"crossref","unstructured":"Buchin, K., Schulz, A.: On the number of spanning trees a planar graph can have. In: Proc. 18th Annual European Symposium on Algorithms (ESA), LNCS 6346, pp. 110\u2013121. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15775-2_10"},{"key":"1621_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"key":"1621_CR6","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Rote, G., T\u00f3th, Cs. D.: Monotone paths in planar convex subdivisions. In: Bezdek, K., Deza, A., Ye, Y. (eds) Discrete Geometry and Optimization, Fields Institute Communications, vol.\u00a069, pp.\u00a079\u2013104. Springer, Berlin (2013)","DOI":"10.1007\/978-3-319-00200-2_6"},{"issue":"2","key":"1621_CR7","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1137\/110849407","volume":"27","author":"A Dumitrescu","year":"2013","unstructured":"Dumitrescu, A., Schulz, A., Sheffer, A., T\u00f3th, CsD: Bounds on the maximum multiplicity of some common geometric graphs. SIAM J. Discrete Math. 27(2), 802\u2013826 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"1621_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/2421119.2421136","volume":"43","author":"A Dumitrescu","year":"2012","unstructured":"Dumitrescu, A., T\u00f3th, Cs D.: Computational geometry column 54. SIGACT News Bull. 43(4), 90\u201397 (2012)","journal-title":"SIGACT News Bull."},{"key":"1621_CR9","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., T\u00f3th, Cs. D.: Convex polygons in geometric triangulations. In: Proc. 14th International Symposium on Algorithms and Data Structures (WADS), LNCS 9214, pp. 289\u2013300. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-21840-3_24"},{"key":"1621_CR10","doi-asserted-by":"crossref","unstructured":"Hoffmann, M., Schulz, A., Sharir, M., Sheffer, A., T\u00f3th, C.D., Welzl, E.: Counting plane graphs: flippability and its applications. In: Pach, J. (ed). Thirty Essays on Geometric Graph Theory, pp. 303\u2013326. Springer, Berlin (2013)","DOI":"10.1007\/978-1-4614-0110-0_16"},{"key":"1621_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"issue":"3","key":"1621_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/PL00009464","volume":"22","author":"F Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M., Urrutia, J.: Flipping edges in triangulations. Discrete Comput. Geom. 22(3), 333\u2013346 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"1621_CR13","unstructured":"L\u00f6ffler, M., Schulz, A., T\u00f3th, Cs.D.: Counting carambolas. In: Proc. 25th Canadian Conference on Computational Geometry (CCCG), pp. 163\u2013168. Waterloo (2013)"},{"issue":"1","key":"1621_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J Pach","year":"2004","unstructured":"Pach, J., T\u00f3th, G.: Monotone drawings of planar graphs. J. Graph Theory 46(1), 39\u201347 (2004)","journal-title":"J. Graph Theory"},{"issue":"4","key":"1621_CR15","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.jcta.2013.01.002","volume":"120","author":"M Sharir","year":"2013","unstructured":"Sharir, M., Sheffer, A., Welzl, E.: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn\u2019s technique. J. Combin. Theory Ser.\u00a0A 120(4), 777\u2013794 (2013)","journal-title":"J. Combin. Theory Ser.\u00a0A"},{"key":"1621_CR16","doi-asserted-by":"crossref","unstructured":"van Kreveld, M., L\u00f6ffler, M., Pach, J.: How many potatoes are in a mesh? In: Proc. 23rd International Symposium on Algorithms and Computation (ISAAC), LNCS 7676, pp. 166\u2013176. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-35261-4_20"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1621-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1621-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1621-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1621-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:53:25Z","timestamp":1589446405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1621-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,2]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["1621"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1621-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2015,9,2]]},"assertion":[{"value":"16 September 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2015","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}