{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T13:50:59Z","timestamp":1649166659996},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,7,19]],"date-time":"2014-07-19T00:00:00Z","timestamp":1405728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10898-014-0221-z","type":"journal-article","created":{"date-parts":[[2014,7,18]],"date-time":"2014-07-18T10:28:22Z","timestamp":1405679302000},"page":"793-799","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Note on coloring of double disk graphs"],"prefix":"10.1007","volume":"60","author":[{"given":"Jaka","family":"Kranjc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borut","family":"Lu\u017ear","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martina","family":"Mockov\u010diakov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Sot\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,19]]},"reference":[{"key":"221_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","volume":"153","author":"KI Aardal","year":"2007","unstructured":"Aardal, K.I., van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153, 79\u2013129 (2007)","journal-title":"Ann. Oper. Res."},{"key":"221_CR2","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1007\/978-0-387-74759-0_486","volume-title":"Encyclopedia of Optimization","author":"B Balasundaram","year":"2009","unstructured":"Balasundaram, B., Butenko, S.: Optimization problems in unit-disk graphs. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2832\u20132844. Springer, Dordrecht (2009)"},{"issue":"2\u20133","key":"221_CR3","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.tcs.2007.04.025","volume":"384","author":"I Caragiannis","year":"2007","unstructured":"Caragiannis, I., Fishkin, A.V., Kaklamanis, C., Papaioannou, E.: A tight bound for online colouring of disk graphs. Theor. Comput. Sci. 384(2\u20133), 152\u2013160 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"221_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discret. Math."},{"issue":"1","key":"221_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/B:JOGO.0000006750.85332.0f","volume":"28","author":"H Du","year":"2004","unstructured":"Du, H., Jia, X., Li, D., Wu, W.: Coloring of double disk graphs. J. Global Optim. 28(1), 115\u2013119 (2004)","journal-title":"J. Global Optim."},{"issue":"1\u20133","key":"221_CR6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.tcs.2004.06.026","volume":"326","author":"J Fiala","year":"2004","unstructured":"Fiala, J., Fishkin, A.V., Fomin, F.: On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1\u20133), 261\u2013292 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"221_CR7","doi-asserted-by":"crossref","unstructured":"Fishkin, A.: Disk graphs: a short survey. In: Solis-Oba, R., Jansen, K. (eds.) Approximation and Online Algorithms. Lecture Notes in Computer Science, vol. 2909, pp. 260\u2013264. Springer, Berlin Heidelberg (2004)","DOI":"10.1007\/978-3-540-24592-6_23"},{"issue":"3","key":"221_CR8","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"},{"issue":"3","key":"221_CR9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1002\/net.20318","volume":"54","author":"F Havet","year":"2009","unstructured":"Havet, F., Kang, R.J., Sereni, J.S.: Improper coloring of unit disk graphs. Networks 54(3), 150\u2013164 (2009)","journal-title":"Networks"},{"issue":"8","key":"221_CR10","doi-asserted-by":"crossref","first-page":"1438","DOI":"10.1016\/j.disc.2007.07.070","volume":"308","author":"RJ Kang","year":"2008","unstructured":"Kang, R.J., M\u00fcller, T., Sereni, J.S.: Improper colouring of (random) unit disk graphs. Discret. Math. 308(8), 1438\u20131454 (2008)","journal-title":"Discret. Math."},{"issue":"35","key":"221_CR11","doi-asserted-by":"crossref","first-page":"4704","DOI":"10.1016\/j.tcs.2011.05.005","volume":"412","author":"IA Kanj","year":"2011","unstructured":"Kanj, I.A., Wiese, A., Zhang, F.: Local algorithms for edge colorings in UDGs. Theor. Comput. Sci. 412(35), 4704\u20134714 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"221_CR12","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/j.dam.2008.09.005","volume":"157","author":"N Lev-Tov","year":"2009","unstructured":"Lev-Tov, N., Peleg, D.: Conflict-free coloring of unit disks. Discret. Appl. Math. 157(7), 1521\u20131532 (2009)","journal-title":"Discret. Appl. Math."},{"key":"221_CR13","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: k-Degenerate graphs. Can. J. Math. 22, 1082\u20131096 (1970)","journal-title":"Can. J. Math."},{"issue":"1","key":"221_CR14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/(SICI)1097-0037(199808)32:1<13::AID-NET2>3.0.CO;2-M","volume":"32","author":"E Malesi\u0144ska","year":"1998","unstructured":"Malesi\u0144ska, E., Piskorz, S., Wei\u00dfenfels, G.: On the chromatic number of disk graphs. Networks 32(1), 13\u201322 (1998)","journal-title":"Networks"},{"key":"221_CR15","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30, 417\u2013427 (1983)","journal-title":"J. ACM"},{"issue":"2","key":"221_CR16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV 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 25(2), 59\u201368 (1995)","journal-title":"Networks"},{"key":"221_CR17","unstructured":"Peeters, R.: On Coloring $$j$$ j -unit Sphere Graphs. FEW 512, Department of Economics, Tilburg University, Tilburg (1991)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0221-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0221-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0221-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:59:07Z","timestamp":1559264347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0221-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,19]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["221"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0221-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,19]]}}}