{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:37:10Z","timestamp":1725521830789},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_37","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T19:07:11Z","timestamp":1227640031000},"page":"416-427","source":"Crossref","is-referenced-by-count":1,"title":["Bounded-Degree Independent Sets in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana F.","family":"Wilkinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"issue":"3","key":"37_CR1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K. Appel","year":"1977","unstructured":"K. Appel and W. Haken. Every planar map is four colorable. I. Discharging. Illinois Journal of Mathematics, 21(3):429\u2013490, 1977.","journal-title":"Illinois Journal of Mathematics"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/0095-8956(76)90071-X","volume":"20","author":"M. Albertson","year":"1976","unstructured":"M. Albertson. A lower bound for the independence number of a planar graph. Journal of Combinatorial Theory (B), 20:84\u201393, 1976.","journal-title":"Journal of Combinatorial Theory (B)"},{"issue":"1","key":"37_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. Baker","year":"1994","unstructured":"B. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41(1):153\u2013180, January 1994.","journal-title":"Journal of the ACM"},{"key":"37_CR4","unstructured":"T. Biedl. Large independent sets in planar graphs in linear time. Technical report, Department of Computer Science, University of Waterloo, 1999."},{"key":"37_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in combinatorial geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in combinatorial geometry. Springer-Verlag, Berlin, 1987."},{"key":"37_CR6","unstructured":"J. Iacono. Optimal planar point location. In Twelfth Annual ACM-SIAM Symposium On Discrete Algorithms, pages 340\u2013341, New York, 2001. ACM."},{"issue":"1","key":"37_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal of Computing, 12(1):28\u201335, February 1983.","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"37_CR8","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R. Lipton","year":"1980","unstructured":"R. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM Journal of Computing, 9(3):615\u2013627, August 1980.","journal-title":"SIAM Journal of Computing"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N. Robertson","year":"1997","unstructured":"N. Robertson, D. Sanders, P. Seymour, and R. Thomas. The four-colour theorem. JCTB: Journal of Combinatorial Theory, Series B, 70:2\u201344, 1997.","journal-title":"JCTB: Journal of Combinatorial Theory, Series B"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"J. Snoeyink and M. van Kreveld. Linear-time reconstruction of Delau-nay triangulations with applications. In Algorithms: 5th Annual European Symposium (ESA\u2019 97), pages 459\u2013471, Berlin, 1997. Springer-Verlag.","DOI":"10.1007\/3-540-63397-9_35"},{"key":"37_CR11","unstructured":"D. F. Wilkinson. Bounded-degree independent sets. Master\u2019s thesis, School of Computer Science, University of Waterloo, May 2002."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:28:57Z","timestamp":1557944937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}