{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:29:13Z","timestamp":1769077753280,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s00373-007-0704-5","type":"journal-article","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T11:26:17Z","timestamp":1183375577000},"page":"67-84","source":"Crossref","is-referenced-by-count":46,"title":["On the Number of Plane Geometric Graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Hackl","sequence":"additional","affiliation":[]},{"given":"Clemens","family":"Huemer","sequence":"additional","affiliation":[]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[]},{"given":"Hannes","family":"Krasser","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"704_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications. Order 19, 265\u2013281 (2002)","DOI":"10.1023\/A:1021231927255"},{"key":"704_CR2","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. Computing 76(1\u20132), 165\u2013176 (2006)","DOI":"10.1007\/s00607-005-0133-3"},{"key":"704_CR3","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.,Speckmann, B.: Convexity minimizes pseudo-triangulations. Comput. Geom. Theory Appl. 28, 3\u201310 (2004)"},{"key":"704_CR4","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane graphs. FSP S92 Industrial Geometry, Technical Report No.8, available online at http:\/\/www.ig.jku.at under FSP-Reports (2006)","DOI":"10.1145\/1109557.1109613"},{"key":"704_CR5","unstructured":"Aichholzer, O., Hurtado, F., Noy, M.: A lower bound on the number of triangulations of planar point sets. Comput. Geom. Theory Appl. 29(2), 135\u2013145 (2004)"},{"key":"704_CR6","unstructured":"Aichholzer, O., Krasser, H.: The point set order type data base: a collection of applications and results. In: Proceedings of 13th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, 17\u201320 (2001)"},{"key":"704_CR7","unstructured":"Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom. Theory Appl. 36(1), 2\u201315 (2006)"},{"key":"704_CR8","unstructured":"Aichholzer, O., Orden, D., Santos, F., Speckmann, B.: On the number of pseudo- triangulations of certain point sets. In: Proceedings of 20th European Workshop on Computational Geometry, Sevilla, Spain, pp. 119\u2013122 (2004)"},{"key":"704_CR9","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. Ann. Discrete Math. 12, 9\u201312 (1982)"},{"key":"704_CR10","unstructured":"Brass, P., Moser W., Pach, J.: Research problems in discrete geometry. Springer, New York (2005)"},{"key":"704_CR11","unstructured":"Dumitrescu, A.: On two lower bound constructions. In: Proceedings of 11th Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, pp. 111\u2013114 (1999)"},{"key":"704_CR12","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Noy, M.: Analytic combinatorics of non-crossing configurations. Discrete Math. 204, 203\u2013229 (1999)","DOI":"10.1016\/S0012-365X(98)00372-0"},{"key":"704_CR13","unstructured":"Garc\u00eda, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of Kn. Comput. Geom. Theory Appl. 16, 211\u2013221 (2000)"},{"key":"704_CR14","unstructured":"Goodman, J. E., O\u2019Rourke, J. (eds): Handbook of Discrete and Computational Geometry, 2nd edn. CRC Press LLC, Boca Raton (2004)"},{"key":"704_CR15","unstructured":"Leighton, T.: Complexity issues in VLSI. MIT Press, Cambridge (1983)"},{"key":"704_CR16","unstructured":"Orden, D., Santos, F.: The polytope of non-crossing graphs on a planar point set. Discrete Comput. Geom. 33(2), 275\u2013305 (2005)"},{"key":"704_CR17","unstructured":"Randall, D., Rote, G., Santos, F., Snoeyink, J.: Counting triangulations and pseudo- triangulations of wheels. In: Proceedings of 13th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, pp. 149\u2013152 (2001)"},{"key":"704_CR18","unstructured":"Ribo Mor, A., Rote, G.: Locked and unlocked self-touching linkages. Ph.D. thesis of Ares Ribo Mor personal communication (2005)"},{"key":"704_CR19","unstructured":"Santos, F., Seidel, R.: A better upper bound on the number of triangulations of a planar point set. J. Combin. Theory Ser. A 102, 186\u2013193 (2003)"},{"key":"704_CR20","doi-asserted-by":"crossref","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings, (cycles, and partitions). In: Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, Florida, pp. 860\u2013869 (2006) (to appear in SIAM Journal of Computing 2007)","DOI":"10.1145\/1109557.1109652"},{"key":"704_CR21","doi-asserted-by":"crossref","unstructured":"Sharir, M., Welzl, E.: Random triangulations of point sets to appear. In: Proceedings of 22nd Annual ACM-SIAM Symposium on Computational Geometry, Sedona, Arizona, pp. 273\u2013281 (2006)","DOI":"10.1145\/1137856.1137898"},{"key":"704_CR22","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free cycles and spanning trees (in preparation)"},{"key":"704_CR23","unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences.http:\/\/www.research.att. com\/~njas\/sequences\/"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0704-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0704-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0704-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:27Z","timestamp":1559055507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0704-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":23,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["704"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0704-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}