{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T11:45:12Z","timestamp":1747136712033},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193903"},{"type":"electronic","value":"9783642193910"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19391-0_3","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T04:53:35Z","timestamp":1303966415000},"page":"36-46","source":"Crossref","is-referenced-by-count":9,"title":["Counting Plane Graphs with Exponential Speed-Up"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Razen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_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., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the Number of Plane Geometric Graphs. Graphs and Combinatorics\u00a023, 67\u201384 (2007)","journal-title":"Graphs and Combinatorics"},{"key":"3_CR2","first-page":"9","volume":"12","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9di, E.: Crossing-Free Subgraphs. Annals Discrete Math.\u00a012, 9\u201312 (1982)","journal-title":"Annals Discrete Math."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse Search for Enumeration. Discrete Appl. Math.\u00a065, 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0925-7721(02)00111-6","volume":"23","author":"S. Bespamyatnikh","year":"2002","unstructured":"Bespamyatnikh, S.: An Efficient Algorithm for Enumeration of Triangulations. Comput. Geom. Theory Appl.\u00a023, 271\u2013279 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0012-365X(98)00372-0","volume":"204","author":"P. Flajolet","year":"1999","unstructured":"Flajolet, P., Noy, M.: Analytic Combinatorics of Non-Crossing Configurations. Discrete Math.\u00a0204, 203\u2013229 (1999)","journal-title":"Discrete Math."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Katoh, N., Tanigawa, S.: Fast Enumeration Algorithms for Non-Crossing Geometric Graphs. In: Proc. 24th Ann. Symp. on Comput. Geom., pp. 328\u2013337 (2008)","DOI":"10.1145\/1377676.1377733"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BF02187695","volume":"1","author":"D.T. Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Generalized Delaunay triangulation for planar graphs. Discrete Comput. Geom.\u00a01, 210\u2013217 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0097-3165(03)00002-5","volume":"102","author":"F. Santos","year":"2003","unstructured":"Santos, F., Seidel, R.: A Better Upper Bound on the Number of Triangulations of a Planar Point Set. J. Comb. Theory, Ser. A\u00a0102, 186\u2013193 (2003)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"3_CR9","unstructured":"Sharir, M., Sheffer, A.: Counting Triangulations of Planar Point Sets (2010), \n                    \n                      http:\/\/arxiv.org\/abs\/0911.3352"},{"key":"3_CR10","doi-asserted-by":"publisher","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.\u00a0Comput.\u00a036, 695\u2013720 (2006)","journal-title":"SIAM J.\u00a0Comput."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Sharir, M., Welzl, E.: Random Triangulations of Planar Point Sets. In: Proc. 22nd Ann. ACM Symp. on Comput. Geom., pp. 273\u2013281 (2006)","DOI":"10.1145\/1137856.1137898"}],"container-title":["Lecture Notes in Computer Science","Rainbow of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19391-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:40:11Z","timestamp":1558575611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19391-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193903","9783642193910"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19391-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}