{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:05Z","timestamp":1725512105510},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79228-4_15","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T01:07:56Z","timestamp":1209431276000},"page":"170-181","source":"Crossref","is-referenced-by-count":5,"title":["Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"J.","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"S.","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"H.","family":"Gonz\u00e1lez-Aguilar","sequence":"additional","affiliation":[]},{"given":"R.","family":"Kralovic","sequence":"additional","affiliation":[]},{"given":"E.","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"J.","family":"Opatrny","sequence":"additional","affiliation":[]},{"given":"L.","family":"Stacho","sequence":"additional","affiliation":[]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. wireless networks\u00a07, 609\u2013616 (2001)","journal-title":"wireless networks"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/11429647_8","volume-title":"Structural Information and Communication Complexity","author":"I. Caragiannis","year":"2005","unstructured":"Caragiannis, I., Fishkin, A.V., Kaklamanis, C., Papaioannou, E.: A tight bound for online coloring of disk graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 78\u201388. Springer, Heidelberg (2005)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","first-page":"286","volume-title":"Semantic Web Services and Web Process Composition","author":"E. Chavez","year":"2005","unstructured":"Chavez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.: Local construction of planar spanners in unit disk graphs with irregular transmission ranges. In: Cardoso, J., Sheth, A.P. (eds.) SWSWPC 2004. LNCS, vol.\u00a03387, pp. 286\u2013297. Springer, Heidelberg (2005)"},{"key":"15_CR4","unstructured":"D\u00f6rre, P.: Every planar graph is 4-colourable and 5-choosable a joint proof. Fachhochschule S\u00fcdwestfalen (University of Applied Sciences) (unpublished note)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K.R. Gabriel","year":"1972","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Systemic Zoology\u00a018, 259\u2013278 (1972)","journal-title":"Systemic Zoology"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02278856","volume":"7","author":"S. Ghosh","year":"1993","unstructured":"Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing\u00a07, 55\u201359 (1993)","journal-title":"Distributed Computing"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/PL00009196","volume":"20","author":"A. Gr\u00e4f","year":"1998","unstructured":"Gr\u00e4f, A., Stumpf, M., Wei\u00dfenfels, G.: On coloring unit disk graphs. Algorithmica\u00a020(3), 277\u2013293 (1998)","journal-title":"Algorithmica"},{"key":"15_CR8","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. of 11th Canadian Conference on Computational Geometry, August 1999, pp. 51\u201354 (1999)"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. COMP.\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM J. COMP."},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks\u00a025(1), 59\u201368 (1995)","journal-title":"Networks"},{"key":"15_CR11","first-page":"895","volume-title":"SODA","author":"Y. Miyamoto","year":"2005","unstructured":"Miyamoto, Y., Matsui, T.: Multicoloring unit disk graphs on triangular lattice points. In: SODA, pp. 895\u2013896. SIAM, Philadelphia (2005)"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C. Thomassen","year":"1994","unstructured":"Thomassen, C.: Every planar graph is 5-choosable. Combinatorial Theory Series B\u00a062(1), 180\u2013181 (1994)","journal-title":"Combinatorial Theory Series B"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(01)00338-7","volume":"251","author":"Z. Tuza","year":"2002","unstructured":"Tuza, Z., Voigt, M.: A note on planar 5-list colouring: non-extendability at distance 4. Discrete Mathematics\u00a0251(1), 169\u2013172 (2002)","journal-title":"Discrete Mathematics"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, X.-Y.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In: DialM: Proceedings of the Discrete Algorithms and Methods for Mobile Computing & Communications (2003)","DOI":"10.1145\/941079.941088"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:25:34Z","timestamp":1558265134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540792277","9783540792284"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}