{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:11Z","timestamp":1725559451791},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_27","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"302-314","source":"Crossref","is-referenced-by-count":5,"title":["Generating and Radiocoloring Families of Perfect Graphs"],"prefix":"10.1007","author":[{"given":"M. I.","family":"Andreou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. G.","family":"Papadopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Theodorides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Xeros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Agnarsson, G., Greenlaw, R., Halldorsson, M.H.: Powers of chordal graphs and their coloring, Congressus Numerantium (since September 2000)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Andreou, M.I., Papadopoulou, V.G., Spirakis, P.G., Theodorides, B., Xeros, A.: Generating and Radiocoloring Families of Perfect Graphs, CRESCCO Technical Report (2004)","DOI":"10.1007\/11427186_27"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-44867-5_2","volume-title":"Experimental and Efficient Algorithms","author":"M. Andreou","year":"2003","unstructured":"Andreou, M., Nikoletseas, S., Spirakis, P.: Algorithms and Experiments on Colouring squares of Planar Graphs. In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol.\u00a02647, pp. 15\u201332. Springer, Heidelberg (2003)"},{"key":"27_CR4","unstructured":"Bodlaendera, H.L., Kloksb, T., Tana,c, R.B., Leeuwena, J.V.: Approximations for \u03bb-Coloring of Graphs. a Utrecht University, The Netherlands, b Vrije Universiteit, The Netherlands, c University of Sciences & Arts of Oklahoma, OK 73018, U.S.A"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Fotakis, D.A., Nikoletseas, S.E., Papadopoulou, V.G., Spirakis, P.G.: NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. Journal of Theoretical Computer Science (to appear)","DOI":"10.1007\/3-540-44612-5_32"},{"key":"27_CR6","unstructured":"Fotakis, D., Spirakis, P.: Assignment of Reusable and Non-Reusable Frequencies. In: International Conference on Combinatorial and Global Optimization (1998)"},{"key":"27_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press Inc., London (1980)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Hale, W.K.: Frequency Assignment: Theory and Applications. Proceedings of the IEEE\u00a068(12) (December 1980)","DOI":"10.1109\/PROC.1980.11899"},{"key":"27_CR9","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., Naher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"27_CR10","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."}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:47Z","timestamp":1605642947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11427186_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}