{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:23Z","timestamp":1725559163242},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260523"},{"type":"electronic","value":"9783540320739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11429647_8","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:18:25Z","timestamp":1279045105000},"page":"78-88","source":"Crossref","is-referenced-by-count":3,"title":["A Tight Bound for Online Coloring of Disk Graphs"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksei V.","family":"Fishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evi","family":"Papaioannou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-28629-5_14","volume-title":"Mathematical Foundations of Computer Science 2004","author":"I. Caragiannis","year":"2004","unstructured":"Caragiannis, I., Fishkin, A.V., Kaklamanis, C., Papaioannou, E.: Online algorithms for disk graphs. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 215\u2013226. Springer, Heidelberg (2004)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"issue":"1-2","key":"8_CR4","first-page":"3","volume":"9","author":"T. Erlebach","year":"2002","unstructured":"Erlebach, T., Fiala, J.: On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications\u00a09(1-2), 3\u201324 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"8_CR5","unstructured":"Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks. Manuscript (2003)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-44676-1_39","volume-title":"Algorithms - ESA 2001","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Fishkin, A.V., Fomin, F.V.: Off-line and on-line distance constrained labeling of graphs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 464\u2013475. Springer, Heidelberg (2001)"},{"key":"8_CR7","unstructured":"Gr\u00e4f, A.: Coloring and recognizing special graph classes. Musikinformatik und Medientechnik Bericht 20\/95, Johannes Gutenberg, Universit\u00e4t Mainz (1995)"},{"issue":"3","key":"8_CR8","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., Weissenfels, G.: On coloring unit disk graphs. Algorithmica\u00a020(3), 277\u2013293 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A. Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and first fit colorings of graphs. Journal of Graph Theory\u00a012(2), 217\u2013227 (1988)","journal-title":"Journal of Graph Theory"},{"issue":"12","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"D.K. Hale","year":"1980","unstructured":"Hale, D.K.: Frequency assignment: theory and applications. Proc. of the IEEE\u00a068(12), 1497\u20131514 (1980)","journal-title":"Proc. of the IEEE"},{"issue":"1-3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P. Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P., Kratochv\u00edl, J.: Representing graphs by disks and balls. Discrete Mathematics\u00a0229(1-3), 101\u2013124 (2001)","journal-title":"Discrete Mathematics"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01294263","volume":"11","author":"S. Irani","year":"1994","unstructured":"Irani, S.: Coloring inductive graphs on-line. Algorithmica\u00a011, 53\u201372 (1994)","journal-title":"Algorithmica"},{"key":"8_CR13","unstructured":"Malesi\u0144ska, E.: Graph theoretical models for frequency assignment problems. PhD Thesis, Technical University of Berlin (1997)"},{"key":"8_CR14","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 hueristics for unit disk graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"key":"8_CR15","unstructured":"Peeters, R.: On coloring j-unit sphere graphs. Technical report, Dept. of Economics, Tilburg University (1991)"},{"key":"8_CR16","unstructured":"Vishwanathan, S.: Randomized online coloring of graphs. In: Proc. of the 31st Annual Symposium on Foundations of Computer Science, FOCS 1990 (1990)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11429647_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:39Z","timestamp":1619507439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11429647_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260523","9783540320739"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11429647_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}