{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:11Z","timestamp":1725564971494},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_9","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"62-71","source":"Crossref","is-referenced-by-count":0,"title":["Coloring Octrees"],"prefix":"10.1007","author":[{"given":"Udo","family":"Adamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f3zsef","family":"Solymosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milo\u0161","family":"Stojakovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Benantar, M., Dogrus\u00f6z, U., Flaherty, J.E., Krishnamoorthy, M.S.: Coloring quadtrees (1996) (manuscript)"},{"key":"9_CR2","unstructured":"Benantar, M., Flaherty, J.E., Krishnamoorthy, M.S.: Coloring procedures for finite element computation on shared-memory parallel computers. In: Adaptive, Multilevel, and Hierarchical Computation Strategies, New York. AMD, vol.\u00a0157, pp. 435\u2013449 (1992)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00453-001-0054-2","volume":"32","author":"M.W. Bern","year":"2002","unstructured":"Bern, M.W., Eppstein, D., Hutchings, B.: Algorithms for coloring quadtrees. Algorithmica\u00a032(1), 87\u201394 (2002)","journal-title":"Algorithmica"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N. Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. J. Combin. Theory Ser. B\u00a070(1), 2\u201344 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structures. ACM Computing Surveys (CSUR)\u00a016(2), 187\u2013260 (1984)","journal-title":"ACM Computing Surveys (CSUR)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:43Z","timestamp":1620012403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}