{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:18Z","timestamp":1750306878689,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T00:00:00Z","timestamp":1371427200000},"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":[[2013,6,17]]},"DOI":"10.1145\/2462356.2462392","type":"proceedings-article","created":{"date-parts":[[2014,1,7]],"date-time":"2014-01-07T17:18:46Z","timestamp":1389115126000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["A simple aggregative algorithm for counting triangulations of planar point sets and related problems"],"prefix":"10.1145","author":[{"given":"Victor","family":"Alvarez","sequence":"first","affiliation":[{"name":"Saarland University, Saarbrucken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raimund","family":"Seidel","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbrucken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,17]]},"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.1016\/j.comgeo.2004.01.002"},{"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","series-title":"North-Holland Mathematics Studies","first-page":"9","volume-title":"Theory and Practice of Combinatorics A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday","author":"Ajtai M."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261259"},{"key":"e_1_3_2_1_6_1","unstructured":"V. Alvarez K. Bringmann and S. Ray \"A simple sweep line algorithm for counting triangulations and pseudo-triangulations\" Submitted 2012.  V. Alvarez K. Bringmann and S. Ray \"A simple sweep line algorithm for counting triangulations and pseudo-triangulations\" Submitted 2012."},{"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","doi-asserted-by":"crossref","unstructured":"K.\n       \n      Buchin\n     and \n      \n      \n      A.\n       \n      Schulz \"\n  On the number of spanningtrees a planar graph can have \" in ESA\n   (M. de Berg and U. Meyer eds.) vol. \n  6346\n   of \n  Lecture Notes in Computer Science pp. 110?-\n  121 Springer 2010\n  .   K. Buchin and A. Schulz \"On the number of spanningtrees a planar graph can have \" in ESA (M. de Berg and U. Meyer eds.) vol. 6346 of Lecture Notes in Computer Science pp. 110?-121 Springer 2010.","DOI":"10.1007\/978-3-642-15775-2_10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"K.\n       \n      Buchin C.\n       \n      Knauer K.\n       \n      Kriegel A.\n       \n      Schulz and \n      \n      \n      R.\n       \n      Seidel \"\n  On the number of cycles in planar graphs \" in COCOON\n   (G. Lin ed.) vol. \n  4598\n   of \n  Lecture Notes in Computer Science pp. 97?-\n  107 Springer 2007\n  .   K. Buchin C. Knauer K. Kriegel A. Schulz and R. Seidel \"On the number of cycles in planar graphs \" in COCOON (G. Lin ed.) vol. 4598 of Lecture Notes in Computer Science pp. 97?-107 Springer 2007.","DOI":"10.1007\/978-3-540-73545-8_12"},{"volume-title":"USENIX Association","year":"2004","author":"Dean J.","key":"e_1_3_2_1_11_1"},{"volume":"25","volume-title":"Algorithms and Computation in Mathematics","author":"De Loera J. A.","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00372-0"},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/978-3-642-19805-2","volume-title":"WADS (F. Dehne, J. Iacono, and J.-R","author":"Hoffmann M.","year":"2011"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-009-9164-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.21"},{"volume-title":"European Workshop on Computational Geometry","year":"2004","author":"McCabe P.","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00010-9"},{"volume-title":"European Workshop on Computational Geometry","year":"2004","author":"Ray S.","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","series-title":"Lecture Notes in Computer Science","first-page":"46","volume-title":"Rainbow of Computer Science","author":"Razen A.","year":"2011"},{"key":"e_1_3_2_1_21_1","unstructured":"G. Rote Private Communication.  G. Rote Private Communication."},{"key":"e_1_3_2_1_22_1","unstructured":"A. Schulz \"The existence of a pseudo-triangulation in a given geometric graph \" in EuroCG 2006.  A. Schulz \"The existence of a pseudo-triangulation in a given geometric graph \" in EuroCG 2006."},{"issue":"1","key":"e_1_3_2_1_23_1","article-title":"Counting triangulations of planar point sets","volume":"18","author":"Sharir M.","year":"2011","journal-title":"Electr. J. Comb."},{"key":"e_1_3_2_1_24_1","first-page":"0194","article-title":"Counting plane graphs: Cross-graph charging schemes","volume":"1209","author":"Sharir M.","year":"2012","journal-title":"CoRR"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2011.04.002"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261277"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/050636036"},{"volume-title":"ETH Zurich","year":"2013","author":"Wettstein M.","key":"e_1_3_2_1_28_1"}],"event":{"name":"SoCG '13: Symposium on Computational Geometry 2013","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rio de Janeiro Brazil","acronym":"SoCG '13"},"container-title":["Proceedings of the twenty-ninth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2462356.2462392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:29Z","timestamp":1750234709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,17]]},"references-count":28,"alternative-id":["10.1145\/2462356.2462392","10.1145\/2462356"],"URL":"https:\/\/doi.org\/10.1145\/2462356.2462392","relation":{},"subject":[],"published":{"date-parts":[[2013,6,17]]},"assertion":[{"value":"2013-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}