{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:26:27Z","timestamp":1725823587189},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_64","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T06:07:39Z","timestamp":1434694059000},"page":"785-796","source":"Crossref","is-referenced-by-count":0,"title":["A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set"],"prefix":"10.1007","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dzmitry","family":"Sledneu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. In: SODA 2014","DOI":"10.1137\/1.9781611973402.49"},{"issue":"5","key":"64_CR2","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.comgeo.2014.12.006","volume":"48","author":"V Alvarez","year":"2015","unstructured":"Alvarez, V., Bringmann, K., Ray, S., Seidel, R.: Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48(5), 386\u2013397 (2015)","journal-title":"Comput. Geom."},{"key":"64_CR3","doi-asserted-by":"crossref","unstructured":"Alvarez, V., Bringmann, K., Curticapean, R., Ray, S.: Counting crossing-free structures. In: SoCG 2012","DOI":"10.1145\/2261250.2261259"},{"key":"64_CR4","doi-asserted-by":"crossref","unstructured":"Alvarez, V., Seidel, R.: A simple aggregative algorithm for counting triangulations of planar point sets and related problems. In: SoCG 2013","DOI":"10.1145\/2462356.2462392"},{"issue":"2","key":"64_CR5","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, C.D.: 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":"1\u20133","key":"64_CR6","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 Mathematics 204(1\u20133), 203\u2013229 (1999)","journal-title":"Discrete Mathematics"},{"key":"64_CR7","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Quasi-polynomial time approximation scheme for sparse subsets of polygons. In: SoCG 2014","DOI":"10.1145\/2582112.2582157"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-22300-6_44","volume-title":"Algorithms and Data Structures","author":"M Hoffmann","year":"2011","unstructured":"Hoffmann, M., Sharir, M., Sheffer, A., T\u00f3th, C.D., Welzl, E.: Counting plane graphs: flippability and its applications. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 524\u2013535. Springer, Heidelberg (2011)"},{"issue":"3","key":"64_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"GL Miller","year":"1986","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32(3), 265\u2013279 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"64_CR10","doi-asserted-by":"crossref","unstructured":"Sharir, M., Sheffer, A.: Counting triangulations of planar point sets. Electr. J. Comb. 18(1) (2011)","DOI":"10.37236\/557"},{"issue":"7","key":"64_CR11","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/j.jcta.2011.04.002","volume":"118","author":"M Sharir","year":"2011","unstructured":"Sharir, M., Sheffer, A., Welzl, E.: On degrees in random triangulations of point sets. J. Comb. Theory, Ser. A 118(7), 1979\u20131999 (2011)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"3","key":"64_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/comjnl\/21.3.243","volume":"21","author":"R Sibson","year":"1978","unstructured":"Sibson, R.: Locally equiangular triangulations. Comput. J. 21(3), 243\u2013245 (1978)","journal-title":"Comput. J."},{"key":"64_CR13","doi-asserted-by":"crossref","unstructured":"Wettstein, M.: Counting and enumerating crossing-free geometric graphs. In: SoCG 2014","DOI":"10.1145\/2582112.2582145"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T17:13:43Z","timestamp":1599153223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}