{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:00:16Z","timestamp":1742940016917,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_30","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"377-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Number of Anchored Rectangle Packings for a Planar Point Set"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"30_CR1","unstructured":"Ackerman, E.: Counting problems for geometric structures: rectangulations, floorplans, and quasi-planar graphs, PhD thesis, Technion (2016)"},{"issue":"6","key":"30_CR2","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1016\/j.jcta.2005.10.003","volume":"113","author":"E Ackerman","year":"2006","unstructured":"Ackerman, E., Barequet, G., Pinter, R.: On the number of rectangulations of a planar point set. J. Combin. Theory, Ser. A 113(6), 1072\u20131091 (2006)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: Approximation schemes for maximum weight independent set of rectangles. In: Proc. 54th FOCS. IEEE (2013)","DOI":"10.1109\/FOCS.2013.50"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Wiese, A.: A quasi-PTAS for the two-dimensional geometric knapsack problem. In: Proc. 26th SODA. SIAM (2015)","DOI":"10.1137\/1.9781611973730.98"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"H-K Ahn","year":"2004","unstructured":"Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M., van Oostrum, R.: Competitive facility location: the Voronoi game. Theoret. Comput. Sci. 310, 457\u2013467 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR6","first-page":"9","volume":"12","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. Annals Discrete Math. 12, 9\u201312 (1982)","journal-title":"Annals Discrete Math."},{"key":"30_CR7","first-page":"21","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration Discrete Appl. Math. 65, 21\u201346 (1996)","journal-title":"Math."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Bansal, N., Khan, A.: Improved approximation algorithm for two-dimensional bin packing. In: Proc. 25th SODA, pp. 13\u201325. SIAM (2014)","DOI":"10.1137\/1.9781611973402.2"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00454-003-2951-4","volume":"31","author":"O Cheong","year":"2004","unstructured":"Cheong, O., Har-Peled, S., Linial, N., Matou\u0161ek, J.: The one-round Voronoi game. Discrete Comput. Geom. 31, 125\u2013138 (2004)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"30_CR10","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."},{"key":"#cr-split#-30_CR11.1","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Packing anchored rectangles. In: Proc. 23rd SODA, pp. 294-305. SIAM (2012)","DOI":"10.1137\/1.9781611973099.28"},{"key":"#cr-split#-30_CR11.2","doi-asserted-by":"crossref","unstructured":"and Combinatorica 35(1), 39-61 (2015)","DOI":"10.1007\/s00493-015-3006-1"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Francke, A., T\u00f3th, C.D.: A census of plane graphs with polyline edges. In: Proc. 30th SoCG, pp. 242\u2013250. ACM Press (2014)","DOI":"10.1145\/2582112.2582116"},{"key":"30_CR13","first-page":"309","volume":"22","author":"O Gim\u00e9nez","year":"2009","unstructured":"Gim\u00e9nez, O., Noy, M.: Asymptotic enumeration and limit laws of planar graphs. J. AMS 22, 309\u2013329 (2009)","journal-title":"J. AMS"},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.comgeo.2013.08.008","volume":"47","author":"R Harren","year":"2014","unstructured":"Harren, R., Jansen, K., Pr\u00e4del, L., van Stee, R.: A $$(5\/3+\\varepsilon )$$-approximation for strip packing. Comput. Geom. 47(2), 248\u2013267 (2014)","journal-title":"Comput. Geom."},{"key":"30_CR15","unstructured":"Kakoulis, K.G., Tollis, I.G.: Labeling algorithms, chap. 28. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press (2013)"},{"key":"30_CR16","first-page":"36","volume":"5","author":"D Knuth","year":"1992","unstructured":"Knuth, D., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discete Math. 5, 36\u201347 (1992)","journal-title":"SIAM J. Discete Math."},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0925-7721(99)00005-X","volume":"13","author":"M van Kreveld","year":"1999","unstructured":"van Kreveld, M., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom. 13, 21\u201347 (1999)","journal-title":"Comput. Geom."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Murata, H., Fujiyoshi, K., Nakatake, S., Kajitani, Y.: VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Trans. CAD Integrated Circuits and Systems 15(12) (1996)","DOI":"10.1109\/43.552084"},{"key":"30_CR19","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. Combin. Theory, Ser. A 102, 186\u2013193 (2003)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1017\/S096354831300031X","volume":"22","author":"M Sharir","year":"2013","unstructured":"Sharir, M., Sheffer, A.: Counting plane graphs: cross-graph charging schemes. Combinat. Probab. Comput. 22, 935\u2013954 (2013)","journal-title":"Combinat. Probab. Comput."},{"key":"30_CR21","unstructured":"Stanley, R.: Problem $$k^8$$ in Catalan addendum to Enumerative Combinatorics, vol. 2, May 25, 2013. http:\/\/www-math.mit.edu\/~rstan\/ec\/catadd.pdf"},{"issue":"4","key":"30_CR22","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1023\/A:1022851226643","volume":"19","author":"H Thomas","year":"2002","unstructured":"Thomas, H.: New combinatorial descriptions of the triangulations of cyclic polytopes and the second higher Stasheff-Tamari posets. Order 19(4), 327\u2013342 (2002)","journal-title":"Order"},{"key":"30_CR23","unstructured":"Tutte, W.: Recent Progress in Combinatorics: Proceedings of the 3rd Waterloo Conference on Combinatorics, May 1968. Academic Press, New York (1969)"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Winkler, P.: Packing rectangles. In: Mathematical Mind-Benders, pp. 133\u2013134, A.K. Peters Ltd., Wellesley (2007)","DOI":"10.1201\/b15447"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:32:54Z","timestamp":1674228774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}