{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:16:28Z","timestamp":1760440588977},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424932"},{"type":"electronic","value":"9783540446767"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_39","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T12:43:15Z","timestamp":1179492195000},"page":"464-475","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Online and Offline Distance Constrained Labeling of Disk Graphs"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksei V.","family":"Fishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"39_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/3-540-46541-3_33","volume-title":"Proceedings of the 17th Annual Symp. on Theoretical Aspects of Computer Science (STACS 2000)","author":"H. L. Bodlaender","year":"2000","unstructured":"H. L. Bodlaender, T. Kloks, R. B. Tan, AND J. Van Leeuwen, \u03bb-coloring of graphs, in Proceedings of the 17th Annual Symp. on Theoretical Aspects of Computer Science (STACS 2000), H. Reichel and S. Tison, eds., Springer Verlag, Lecture Notes in Computer Science, vol. 1770, 2000, pp. 395\u2013406."},{"key":"39_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H. Breu","year":"1998","unstructured":"H. Breu AND D. G. Kirkpatrick, Unit disc graph recognition is NP-hard, Computational Geometry: Theory and Applications, 9 (1998), pp. 3\u201324.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G. J. Chang","year":"1996","unstructured":"G. J. Chang AND D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM Journal of Discrete Mathematics, 9 (1996), pp. 309\u2013316.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B. N. Clark","year":"1990","unstructured":"B. N. Clark, C. J. Colbourn, AND D. S. Johnson, Unit disk graphs., Discrete Math., 86 (1990), pp. 165\u2013177.","journal-title":"Discrete Math"},{"key":"39_CR5","unstructured":"personal communication to Thomas Erlebach."},{"key":"39_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-46784-X_33","volume-title":"Graph-Theoretical Concepts in Computer Science, 25th WG\u2019 99, Ascona","author":"J. Fiala","year":"1999","unstructured":"J. Fiala, J. Kratochv\u00edl, AND T. Kloks, Fixed-parameter tractability of \u03bb-colorings, in Graph-Theoretical Concepts in Computer Science, 25th WG\u2019 99, Ascona, no. 1665 in Lecture Notes in Computer Science, Springer Verlag, 1999, pp. 350\u2013363."},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-L","volume":"22","author":"J. P. Georges","year":"1996","unstructured":"J. P. Georges AND D. W. Mauro, On the size of graphs labeled with a condition at distance two, Journal of Graph Theory, 22 (1996), pp. 47\u201357.","journal-title":"Journal of Graph Theory"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J. R. Griggs","year":"1992","unstructured":"J. R. Griggs AND R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM Journal of Discrete Mathematics, 5 (1992), pp. 586\u2013595.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A. Gy\u00e1rf\u00e1s","year":"1988","unstructured":"A. Gy\u00e1rf\u00e1s AND J. Lehel, On-line and first fit colourings of graphs, Jornal of Graph Theory, 12 (1988), pp. 217\u2013227.","journal-title":"Jornal of Graph Theory"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W. K. Hale","year":"1980","unstructured":"W. K. Hale, Frequency assignment: Theory and applications, Proc. of the IEEE, 68 (1980), pp. 1497\u20131514.","journal-title":"Proc. of the IEEE"},{"key":"39_CR11","unstructured":"P. Hlin\u011bn\u00fd AND J. Kratochv\u00edl, Representing graphs by disks and balls. to appear in Discrete Math."},{"key":"39_CR12","unstructured":"R. A. Leese, Radio spectrum: a raw material for the telecommunications industry. 10th Conference of the European Consortium for Mathematics in Industry, Goteborg, 1998."},{"key":"39_CR13","unstructured":"E. Malesi\u0144ska, Graph theoretical models for frequency assignment problems, PhD thesis, Technical University of Berlin, 1997."},{"key":"39_CR14","unstructured":"R. Peeters, On coloring j-unit sphere graphs, tech. rep., Dept. of Economics, Tilburg University, 1991."},{"key":"39_CR15","unstructured":"V. Raghavan AND J. Spinrad, Robust algorithms for restricted domains manuscript submitted to Special Issue of Journal of Algorithms."},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","volume":"29","author":"J. Heuvel Van den","year":"1998","unstructured":"J. Van den Heuvel, R. A. Leese, AND M. A. Shepherd, Graph labeling and radio channel assignment, Journal of Graph Theory, 29 (1998), pp. 263\u2013283.","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:26:28Z","timestamp":1558257988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_39"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}