{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:39Z","timestamp":1725558639385},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_14","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:49:20Z","timestamp":1277700560000},"page":"163-173","source":"Crossref","is-referenced-by-count":1,"title":["Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks"],"prefix":"10.1007","author":[{"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","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. ZIB-Report 01-40, Konrad-Zuse-Zentrum fur Informationstechnik Berlin (2001)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/90.413218","volume":"3","author":"A.A. Bertossi","year":"1995","unstructured":"Bertossi, A.A., Bonuccelli, M.A.: Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks. IEEE\/ACM Trans. On Networking\u00a03, 441\u2013449 (1995)","journal-title":"IEEE\/ACM Trans. On Networking"},{"key":"#cr-split#-14_CR3.1","doi-asserted-by":"crossref","unstructured":"Bertossi, A.A., Pinotti, C.M., Tan, R.B.: Channel assignment with separation for interference avoidance in wireless networks. IEEE Transactions on Parallel and Distributed Systems (in press);","DOI":"10.1109\/TPDS.2003.1189581"},{"key":"#cr-split#-14_CR3.2","unstructured":"Preliminary version in ACM Workshop DIAL M 2000 (2000)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/3-540-46541-3_33","volume-title":"STACS 2000","author":"H.L. Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: \u03bb-Coloring of Graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 395\u2013406. Springer, Heidelberg (2000)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Calamoneri, T., Petreschi, R.: L(2, 1)-Labeling of Planar Graphs (Extended Abstract). In: Proceedings of 5th ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M), pp. 28\u201333 (2001)","DOI":"10.1145\/381448.381452"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-36385-8_12","volume-title":"Distributed Computing","author":"T. Calamoneri","year":"2002","unstructured":"Calamoneri, T., Petreschi, R.: On the Radiocoloring Problem. In: Das, S.K., Bhattacharya, S. (eds.) IWDC 2002. LNCS, vol.\u00a02571, pp. 118\u2013127. Springer, Heidelberg (2002)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-45995-2_24","volume-title":"LATIN 2002: Theoretical Informatics","author":"T. Calamoneri","year":"2002","unstructured":"Calamoneri, T., Petreschi, R.: \u03bb-Coloring Unigraphs. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 236\u2013247. Springer, Heidelberg (2002)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Calamoneri, T., Pelc, A., Petreschi, R.: Labeling trees with a condition at distance two. In: Proceedings of R.C. Bose Centenary Symp. on Discr. Math. And Applications. electronic notes in discrete mathemathics (2002)","DOI":"10.1016\/S1571-0653(04)00529-3"},{"key":"14_CR9","unstructured":"Calamoneri, T., Vocca, P.: On the Approximability of the L(h, k)-Labelling Problem (2003) (manuscript)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G.J. Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The L(2, 1)-labeling Problem on Graphs. SIAM J. Disc. Math.\u00a09, 309\u2013316 (1996)","journal-title":"SIAM J. Disc. Math."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/3-540-44612-5_32","volume-title":"Mathematical Foundations of Computer Science 2000","author":"D.A. Fotakis","year":"2000","unstructured":"Fotakis, D.A., Nikoletseas, S.E., Papadoulou, V.G., Spirakis, P.G.: NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, p. 363. Springer, Heidelberg (2000)"},{"key":"14_CR12","first-page":"141","volume":"140","author":"J.P. Georges","year":"1999","unstructured":"Georges, J.P., Mauro, D.W.: Some results on \u03bb j k -numbers of the products of complete graphs. Congr. Numer.\u00a0140, 141\u2013160 (1999)","journal-title":"Congr. Numer."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/S0895480199351859","volume":"14","author":"J.P. Georges","year":"2000","unstructured":"Georges, J.P., Mauro, D.W., Stein, M.I.: Labeling products of complete graphs with a condition at distance two. SIAM J. Discr. Math.\u00a014, 28\u201335 (2000)","journal-title":"SIAM J. Discr. Math."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labeling graphs with a Condition at Distance 2. SIAM J. Disc. Math.\u00a05, 586\u2013595 (1992)","journal-title":"SIAM J. Disc. Math."},{"key":"14_CR15","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":"van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph Labelling and Radio Channel Assignment. Journal of Graph Theory\u00a029, 263\u2013283 (1998)","journal-title":"Journal of Graph Theory"},{"key":"14_CR16","unstructured":"Koster, A.M.C.A.: Frequency Assignment. Ph.D. thesis, Universiteit Maastricht (1999)"},{"key":"14_CR17","first-page":"13","volume":"47","author":"D. Liu","year":"1997","unstructured":"Liu, D., Yeh, R.K.: On distance two labelings of graphs. Ars Combinatoria\u00a047, 13\u201322 (1997)","journal-title":"Ars Combinatoria"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/3-540-45749-6_64","volume-title":"Algorithms - ESA 2002","author":"M. Molloy","year":"2002","unstructured":"Molloy, M., Salavatipour, M.R.: Frequency channel assignment on planar networks. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 736\u2013747. Springer, Heidelberg (2002)"},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-1-4757-3023-4_6","volume-title":"Handbook of Combinatorial Optimization","author":"R.A. Murphey","year":"1999","unstructured":"Murphey, R.A., Pardalos, P.M., Resende, M.G.C.: Frequency Assignment Problems. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 295\u2013377. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D. Sakai","year":"1994","unstructured":"Sakai, D.: Labeling Chordal Graphs: Distance Two Condition. SIAM J. Disc. Math.\u00a07, 133\u2013140 (1994)","journal-title":"SIAM J. Disc. Math."},{"key":"14_CR21","unstructured":"Sen, A., Roxborough, T., Medidi, S.: Upper and Lower Bounds of a Class of Channel Assignmet Problems in Cellular Networks. IEEE INFOCOM 1998 (1998)"},{"key":"14_CR22","unstructured":"Shepherd, M.: Radio Channel Assignment. Ph.D. thesis, Merton College, Oxford (1998)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T05:44:35Z","timestamp":1591422275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}