{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:49Z","timestamp":1761621169587,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,8]],"date-time":"2014-06-08T00:00:00Z","timestamp":1402185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,8]]},"DOI":"10.1145\/2582112.2582145","type":"proceedings-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T14:01:31Z","timestamp":1399039291000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Counting and Enumerating Crossing-free Geometric Graphs"],"prefix":"10.1145","author":[{"given":"Manuel","family":"Wettstein","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Department of Computer Science, CH-8092 Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/304893.304896"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-007-0750-z"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-007-0704-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261259"},{"key":"e_1_3_2_1_5_1","volume-title":"A simple sweep line algorithm for counting triangulations and pseudo-triangulations. Submitted","author":"Alvarez V.","year":"2013","unstructured":"V. Alvarez , K. Bringmann , and S. Ray . A simple sweep line algorithm for counting triangulations and pseudo-triangulations. Submitted , 2013 . V. Alvarez, K. Bringmann, and S. Ray. A simple sweep line algorithm for counting triangulations and pseudo-triangulations. Submitted, 2013."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2462356.2462392"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00111-6"},{"key":"e_1_3_2_1_9_1","first-page":"637","volume-title":"Proc. 28th Symp. on Theoretical Aspects of Comp. Sci.","author":"Dumitrescu A.","year":"2011","unstructured":"A. Dumitrescu , A. Schulz , A. Sheffer , and C. D. T\u00f3th . Bounds on the maximum multiplicity of some common geometric graphs . In Proc. 28th Symp. on Theoretical Aspects of Comp. Sci. , pages 637 -- 648 , 2011 . A. Dumitrescu, A. Schulz, A. Sheffer, and C. D. T\u00f3th. Bounds on the maximum multiplicity of some common geometric graphs. In Proc. 28th Symp. on Theoretical Aspects of Comp. Sci., pages 637--648, 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00372-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00010-9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033190.2033234"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377676.1377733"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2001113.2001117"},{"issue":"1","key":"e_1_3_2_1_15_1","article-title":"Counting triangulations of planar point sets","volume":"18","author":"Sharir M.","year":"2011","unstructured":"M. Sharir and A. Sheffer . Counting triangulations of planar point sets . Electr. J. Comb. , 18 ( 1 ), 2011 . M. Sharir and A. Sheffer. Counting triangulations of planar point sets. Electr. J. Comb., 18(1), 2011.","journal-title":"Electr. J. Comb."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36763-2_3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810959.1811009"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261277"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/050636036"},{"key":"e_1_3_2_1_20_1","unstructured":"A. Sheffer. Numbers of plane graphs. http:\/\/www.cs.tau.ac.il\/~sheffera\/counting\/PlaneGraphs.html. Accessed: November 28th 2013.  A. Sheffer. Numbers of plane graphs. http:\/\/www.cs.tau.ac.il\/~sheffera\/counting\/PlaneGraphs.html. Accessed: November 28th 2013."},{"key":"e_1_3_2_1_21_1","volume-title":"ETH Z\u00fcrich","author":"Wettstein M.","year":"2013","unstructured":"M. Wettstein . Algorithms for counting crossing-free configurations. Master's thesis , ETH Z\u00fcrich , April 2013 . M. Wettstein. Algorithms for counting crossing-free configurations. Master's thesis, ETH Z\u00fcrich, April 2013."}],"event":{"name":"SOCG'14: Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Kyoto Japan","acronym":"SOCG'14"},"container-title":["Proceedings of the thirtieth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582145","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2582112.2582145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:09Z","timestamp":1750234209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,8]]},"references-count":21,"alternative-id":["10.1145\/2582112.2582145","10.1145\/2582112"],"URL":"https:\/\/doi.org\/10.1145\/2582112.2582145","relation":{},"subject":[],"published":{"date-parts":[[2014,6,8]]},"assertion":[{"value":"2014-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}