{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:23:52Z","timestamp":1648747432140},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T00:00:00Z","timestamp":1252972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00453-009-9334-z","type":"journal-article","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T22:08:19Z","timestamp":1252966099000},"page":"236-249","source":"Crossref","is-referenced-by-count":0,"title":["Location-Oblivious Distributed Unit Disk Graph Coloring"],"prefix":"10.1007","volume":"60","author":[{"given":"Michel","family":"Barbeau","sequence":"first","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Couture","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,15]]},"reference":[{"issue":"1\u20132","key":"9334_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. 9(1\u20132), 3\u201324 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9334_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/11671541_5","volume-title":"Approximation Algorithms in Combinatorial Optimization","author":"T. Erlebach","year":"2006","unstructured":"Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks. In: Approximation Algorithms in Combinatorial Optimization. Lecture Notes in Computer Science, vol.\u00a03484, pp. 135\u2013155. Springer, Berlin (2006)"},{"issue":"3","key":"9334_CR3","doi-asserted-by":"crossref","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 20(3), 277\u2013293 (1998)","journal-title":"Algorithmica"},{"key":"9334_CR4","doi-asserted-by":"crossref","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. In: Proceedings of the IEEE, vol.\u00a068, pp.\u00a01497\u20131514 (1980)","DOI":"10.1109\/PROC.1980.11899"},{"key":"9334_CR5","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, New York (1972)"},{"key":"9334_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M. Marathe","year":"1995","unstructured":"Marathe, M., Breu, H., Ravi, S., Rosenkrantz, D.: Simple heuristics for unit disk graphs. Networks 25, 59\u201368 (1995)","journal-title":"Networks"},{"issue":"3","key":"9334_CR7","first-page":"417","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.\u00a0ACM 30(3), 417\u2013427 (1983)","journal-title":"J.\u00a0ACM"},{"key":"9334_CR8","unstructured":"Peeters, R.: On coloring j-unit sphere graphs. Technical Report FEW 512, Department of Economics, Tilburg University, Tilburg, The Netherlands (1991)"},{"issue":"1","key":"9334_CR9","doi-asserted-by":"crossref","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 48(1), 160\u2013172 (2003)","journal-title":"J. Algorithms"},{"key":"9334_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/0470072644","volume-title":"Design and Analysis of Distributed Algorithms","author":"N. Santoro","year":"2006","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley, New York (2006)"},{"issue":"4","key":"9334_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0020-0190(02)00283-1","volume":"84","author":"Y. Tsai","year":"2002","unstructured":"Tsai, Y., Lin, Y., Hsu, F.: The online first-fit algorithm for radio frequency assignment problems. Inf. Process. Lett. 84(4), 195\u2013199 (2002)","journal-title":"Inf. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9334-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9334-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9334-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:04Z","timestamp":1559137504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9334-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,15]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9334"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9334-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,15]]}}}