{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:39:10Z","timestamp":1725496750724},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402053"},{"type":"electronic","value":"9783540448679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44867-5_2","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T06:34:45Z","timestamp":1196404485000},"page":"15-32","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms and Experiments on Colouring Squares of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Maria I.","family":"Andreou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sotiris E.","family":"Nikoletseas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"2_CR1","volume-title":"Algorithms and Experiments on Colouring Squares of Planar Graphs","author":"M. Andreou","year":"2003","unstructured":"Maria Andreou, Sotiris Nikoletseas and Paul Spirakis: Algorithms and Experiments on Colouring Squares of Planar Graphs, TR2003\/03 Computer Technology Institute, Greece, 2003. http:\/\/students.ceid.upatras.gr\/~mandreou\/ ."},{"key":"2_CR2","volume-title":"Efficient Colouring of Squares of Planar Graphs","author":"M. Andreou","year":"2002","unstructured":"Maria Andreou and Paul Spirakis: Efficient Colouring of Squares of Planar Graphs, TR2002\/11\/01 Computer Technology Institute, Greece, 2002."},{"key":"2_CR3","unstructured":"Maria Andreou and Paul Spirakis: Planar Graphs, Hellenic Conference on Informatics, EPY, 2002."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Geir Agnarsson, Magnus M. Hallorsson: Coloring Powers of Planar Graphs, ACM Symposium on Discrete Algorithms (SODA).","DOI":"10.1137\/S0895480100367950"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz: New methods to color the vertices of a graph, Communications of the ACM 22, 1979, pp. 251\u2013256.","journal-title":"Communications of the ACM"},{"key":"2_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/3-540-44612-5_32","volume-title":"Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS)","author":"D. A. Fotakis","year":"2000","unstructured":"D. A. Fotakis, S. E. Nikoletseas, V. G. Papadopoulou and P. G. Spirakis: NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs, In the Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), Editors Mogens Nielsen, Branislav Rovan, LNCS 1893, pp 363\u2013372, 2000."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/dimacs\/045\/04","volume-title":"Networks in Distributed Computing","author":"Dimitris Fotakis","year":"1998","unstructured":"D. Fotakis, G. Pantziou, G. Pentaris and P. Spirakis: Frequency Assignment in Mobile and Radio Networks. Networks in Distributed Computing, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 45, American Mathematical Society (1999) 73\u201390."},{"key":"2_CR8","unstructured":"D. Fotakis and P. Spirakis: Assignment of Reusable and Non-Reusable Frequencies, International Conference on Combinatorial and Global Optimization (1998)."},{"key":"2_CR9","unstructured":"Harary: Graph Theory, Addison-Wesley, 1972."},{"key":"2_CR10","unstructured":"J. Van D. Heuvel and S. McGuiness: Colouring the Square of a Planar Graph, CDAM Research Report Series, July (1999)."},{"key":"2_CR11","unstructured":"Katsela I. and M. Nagshineh: Channel assignment schemes for cellular mobile telecommunication system, IEEE Personal Communication Complexity, 1070, 1996."},{"key":"2_CR12","unstructured":"K. Mehlhorn and S. Naher: The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press, 1999."},{"issue":"3","key":"2_CR13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"David S. Johnson","year":"1991","unstructured":"D. Johnson, C. Aragon, L. Mcgeoch, C. Schevon: Optimization by simulated annealing: an experimental evaluation; Part II, Graph Coloring and Number Partitioning, Operating Research, Vol. 39, No. 3, 1991.","journal-title":"Operations Research"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"M. Molloy and M. R. Salavatipour: Frequency Channel Assignment on Planar Networks, To appear in: Proceedings of 10th European Symposium on Algorithms, ESA 2002. The journal version is: A Bound on the Chromatic Number of the Square of a Planar Graph\u201d, submitted. ESA 2002.","DOI":"10.1007\/3-540-45749-6_64"},{"key":"2_CR15","unstructured":"S. Ramanathan, E. R. Loyd: The complexity of distance2-coloring, 4th International Conference of Computing and information, (1992) 71\u201374."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0196-6774(88)90005-3","volume":"9","author":"J. S. Turner","year":"1988","unstructured":"J. S. Turner: Almost all k-colorable graphs are easy to color: Journal of Algorithms, 9, pp. 217\u2013222, 1988.","journal-title":"Journal of Algorithms"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"G. Tinhofer, E. Mayr, H. Noltemeier, M. M. Syslo (eds) in cooreration with R. Albrecht: Computational Graph Theory, Springer-Verlag\/Wien, 1990 chapter \u201cheuristics for graph colouring\u201d.","DOI":"10.1007\/978-3-7091-9076-0"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44867-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T09:35:51Z","timestamp":1557048951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44867-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402053","9783540448679"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44867-5_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}