{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:41:58Z","timestamp":1761662518646},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_46","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"513-524","source":"Crossref","is-referenced-by-count":8,"title":["Exact Algorithms for L(2,1)-Labeling of Graphs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Kratochv\u00edl","sequence":"first","affiliation":[]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"H.L. Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for lambda-Colorings of Graphs. Computer Journal\u00a047, 193\u2013204 (2004)","journal-title":"Computer Journal"},{"key":"46_CR2","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 Journal of Discrete Mathematics\u00a09, 309\u2013316 (1996)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/11523468_30","volume-title":"Automata, Languages and Programming","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Golovach, P., Kratochv\u00edl, J.: Distance Constrained Labelings of Graphs of Bounded Treewidth. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 360\u2013372. Springer, Heidelberg (2005)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kloks, T., Kratochv\u00edl, J.: Fixed-parameter complexity of \u03bb-labelings. Discrete Applied Mathematics\u00a0113, 59\u201372 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"46_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45678-3_46","volume-title":"Algorithms and Computation","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J.: Complexity of partial covers of graphs. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 537\u2013549. Springer, Heidelberg (2001)"},{"key":"46_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.7151\/dmgt.1159","volume":"22","author":"J. Fiala","year":"2002","unstructured":"Fiala, J., Kratochv\u00edl, J.: Partial covers of graphs. Mathematicae Graph Theory\u00a022, 89\u201399 (2002)","journal-title":"Mathematicae Graph Theory"},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.endm.2005.05.012","volume":"19","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Kratochv\u00edl, J., P\u00f3r, A.: On the computational complexity of partial covers of theta graphs. Electronic Notes in Discrete Mathematics\u00a019, 79\u201385 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","first-page":"192","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: Domination - A case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 192\u2013203. Springer, Heidelberg (2005)"},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11537311_15","volume-title":"Fundamentals of Computation Theory","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Heggernes, P., Kratsch, D.: Exact algorithms for graph homomorphisms. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 161\u2013171. Springer, Heidelberg (2005)"},{"key":"46_CR10","unstructured":"Gon\u00e7alves, D.: On the L(p,1)-labelling of graphs. In: DMTCS Proceedings, vol.\u00a0AE, pp. 81\u201386"},{"key":"46_CR11","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.: Labelling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics\u00a05, 586\u2013595 (1992)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-colouring. Journal of Combinatorial Theory Series B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"46_CR13","unstructured":"Leese, R.A., Noble, S.D.: Cyclic labellings with constraints at two distances. Electronic Journal of Combinatorics, Research paper 16, 11, (2004)"},{"key":"46_CR14","first-page":"177","volume":"69","author":"D. Liu","year":"2003","unstructured":"Liu, D., Zhu, X.: Circular Distance Two Labelings and Circular Chromatic Numbers. Ars Combinatoria\u00a069, 177\u2013183 (2003)","journal-title":"Ars Combinatoria"},{"key":"46_CR15","unstructured":"Roberts, F.S.: Private communication to J. Griggs"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:14Z","timestamp":1619519354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}