{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T13:50:27Z","timestamp":1781531427848,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210795","type":"print"},{"value":"9783540245926","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24592-6_23","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:13:33Z","timestamp":1280387613000},"page":"260-264","source":"Crossref","is-referenced-by-count":15,"title":["Disk Graphs: A Short Survey"],"prefix":"10.1007","author":[{"given":"Aleksei V.","family":"Fishkin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Agarwal, P.K., Overmars, M., Sharir, M.: Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. In: Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004) (to appear)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. Journal of the ACM\u00a041, 153\u2013180 (1994)","journal-title":"Journal of the ACM"},{"key":"23_CR3","unstructured":"Breu, H.: Algorithmic Aspects of constrained unit disk graphs. PhD thesis, University of british Columbia (1996)"},{"key":"23_CR4","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 disc graph recognition is NP-hard. Computational Geometry: Theory and Applications\u00a09, 3\u201324 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"23_CR5","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"},{"key":"23_CR6","unstructured":"Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks (2001) (manuscript)"},{"issue":"2","key":"23_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0925-7721(02)00089-5","volume":"23","author":"T. Erlebach","year":"2002","unstructured":"Erlebach, T., Fiala, J.: On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications\u00a023(2), 243\u2013255 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"23_CR8","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: Proceedings the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), Washington, DC, January 7-9, pp. 671\u2013679 (2001)"},{"key":"23_CR9","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.: Off-line and on-line distance constrained labeling of disk graphs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 464\u2013475. Springer, Heidelberg (2001)"},{"issue":"3","key":"23_CR10","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., Weisenfels, G.: On coloring unit disk graphs. Algorithmica\u00a020(3), 277\u2013293 (1998)","journal-title":"Algorithmica"},{"key":"23_CR11","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, 217\u2013227 (1988)","journal-title":"Journal of Graph Theory"},{"key":"23_CR12","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, 101\u2013124 (2001)","journal-title":"Discrete Mathematics"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. Journal of the ACM\u00a032, 130\u2013136 (1985)","journal-title":"Journal of the ACM"},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. HuntIII","year":"1998","unstructured":"HuntIII, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP and PSPACE-hard problems for geometric graphs. J. Algorithms\u00a026(2), 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"key":"23_CR15","series-title":"Berichte Verhande","first-page":"141","volume-title":"Math.-Phys. Klasse","author":"P. Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. In: Math.-Phys. Klasse. Berichte Verhande, vol.\u00a088, pp. 141\u2013164. Saechs. Akad. Wiss, Leipzig (1936)"},{"key":"23_CR16","unstructured":"Malesi\u0144ska, E.: Graph theoretical models for frequency assignment problems. PhD thesis, Technical University of Berlin, Germany (1997)"},{"key":"23_CR17","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, 59\u201368 (1995)","journal-title":"Networks"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-46515-7_16","volume-title":"Discrete and Computational Geometry","author":"T. Matsui","year":"2000","unstructured":"Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 194\u2013200. Springer, Heidelberg (2000)"},{"key":"23_CR19","unstructured":"Peeters, R.: On coloring j-unit sphere graphs. Tech. rep., Department of Economics, Tilburg University (1991)"},{"issue":"1","key":"23_CR20","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. Journal of Algorithms\u00a048(1), 160\u2013172 (2003)","journal-title":"Journal of Algorithms"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(88)90174-3","volume":"28","author":"D. Wang","year":"1988","unstructured":"Wang, D., Kuo, Y.-S.: A study on two geometric location problems. Information Processing Letters\u00a028, 281\u2013286 (1988)","journal-title":"Information Processing Letters"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0020-0190(02)00283-1","volume":"84","author":"Y.-T. Tsai","year":"2002","unstructured":"Tsai, Y.-T., Lin, Y.-L., Hsu, F.R.: The online firstfit algorithm for radio frequency assignment problems. Information Processing Letters\u00a084(4), 195\u2013199 (2002)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24592-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T14:31:02Z","timestamp":1552833062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24592-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210795","9783540245926"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24592-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}