{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:23Z","timestamp":1725574103939},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_19","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T11:01:51Z","timestamp":1294138911000},"page":"226-237","source":"Crossref","is-referenced-by-count":1,"title":["White Space Regions"],"prefix":"10.1007","author":[{"given":"Shayan","family":"Ehsani","sequence":"first","affiliation":[]},{"given":"MohammadAmin","family":"Fazli","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[]},{"given":"MohammadAli","family":"Safari","sequence":"additional","affiliation":[]},{"given":"Morteza","family":"Saghafian","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Tavakkoli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Federal Communications Commission, Notice of proposed rule making: Unlicensed operation in the TV broadcast bands. ET Docket No. 04-186 (FCC 04-113) (May 2004)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Cardoso, L.S., Debbah, M., Bianchi, P., Najim, J.: Cooperative spectrum sensing using random matrix theory. In: IEEE ISWPC, pp. 334\u2013338 (May 2008)","DOI":"10.1109\/ISWPC.2008.4556225"},{"key":"19_CR3","unstructured":"Abachi, T., Hemmatyar, M.A., Fazli, M.A., Izadi, M.: Centralized Spectrum Sensing Using New Algorithmic Techniques. In: CRNet 2010, Bijing, China, August 25-27 (2010)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Fischer, P.: Finding Maximum Convex Polygons. In: Proceedings of the 9th International Symposium on Fundamentals of Computation Theory, pp. 234\u2013243 (1993)","DOI":"10.1007\/3-540-57163-9_19"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Fischer, P.: More or less efficient agnostic learning of convex polygons. In: Proceedings of the Eighth Annual Conference on Computational Learning Theory, pp. 337\u2013344 (1995)","DOI":"10.1145\/225298.225339"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-13883-8_86","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"C.E. Veni Madhavan","year":"1984","unstructured":"Veni Madhavan, C.E.: Approximation algorithm for maximum independent set in planar traingle-free graphs. In: Joseph, M., Shyamasundar, R.K. (eds.) FSTTCS 1984. LNCS, vol.\u00a0181, pp. 381\u2013392. Springer, Heidelberg (1984)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"de Castro, N., Cobos, F.J., Dana, J.C., Marquez, A., Noy, M.: Triangle-free planar graphs as segment intersection graphs. J. Graph Algorithms Appl.\u00a06(1), 7\u201326 (2002) (electronic); Graph drawing and representations (Prague, 1999)","DOI":"10.7155\/jgaa.00043"},{"key":"19_CR8","first-page":"83","volume-title":"Computational Geometry: Theory and Applications","author":"P.K. Agarwal","year":"2006","unstructured":"Agarwal, P.K., Mustafa, N.H.: Independent Set of Intersection Graphs of Convex Objects in 2D. In: Computational Geometry: Theory and Applications, pp. 83\u201395. Elsevier Science Publishers, Amsterdam (2006)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"P. Dilworth","year":"1950","unstructured":"Dilworth, P.: A decomposition thorem for partially ordered sets. Annals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"19_CR10","first-page":"533","volume":"48","author":"E. S\u00e1s","year":"1941","unstructured":"S\u00e1s, E.: On a certain extremum-property of the ellipse (in Hungarian, English sum- mary). Mat. Fiz. Lapok\u00a048, 533\u2013542 (1941)","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T11:02:43Z","timestamp":1559905363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}