{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:47Z","timestamp":1725512147132},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72951-8_18","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T00:03:25Z","timestamp":1183334605000},"page":"222-233","source":"Crossref","is-referenced-by-count":2,"title":["Location Oblivious Distributed Unit Disk Graph Coloring"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Couture","sequence":"first","affiliation":[]},{"given":"Michel","family":"Barbeau","sequence":"additional","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"18_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H. Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is np-hard. Comput. Geom. Theory Appl.\u00a09(1-2), 3\u201324 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"18_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., et al.: 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":"18_CR3","unstructured":"Couture, M., et al.: Location oblivious distributed unit disk graph coloring. Tech. Rep. TR-07-01, School of Computer Science, Carleton University (2007)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/11671541_5","volume-title":"Efficient Approximation and Online Algorithms","author":"T. Erlebach","year":"2006","unstructured":"Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks. In: Bampis, E., Jansen, K., Kenyon, C. (eds.) Efficient Approximation and Online Algorithms. LNCS, vol.\u00a03484, pp. 135\u2013155. Springer, Heidelberg (2006)"},{"issue":"3","key":"18_CR5","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":"18_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., et al.: Simple heuristics for unit disk graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/0122040","volume":"22","author":"D. Matula","year":"1972","unstructured":"Matula, D.: k-components, clusters, and slicings in graphs. SIAM Journal of Applied Mathematics\u00a022(3), 459\u2013480 (1972)","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D.W. Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM\u00a030(3), 417\u2013427 (1983), doi:10.1145\/2402.322385","journal-title":"J. ACM"},{"key":"18_CR10","unstructured":"Peeters, R.: On coloring j-unit sphere graphs. Tech. Rep. FEW 512, Department of Economics, Tilburg University, Tilburg, The Netherlands (1991)"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0196-6774(03)00048-8","volume":"48","author":"V. Raghavan","year":"2003","unstructured":"Raghavan, V., Spinrad, J.: Robust algorithms for restricted domains. J. Algorithms\u00a048(1), 160\u2013172 (2003)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:50Z","timestamp":1605762530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729181","9783540729518"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_18","relation":{},"subject":[]}}