{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:57:50Z","timestamp":1725861470022},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_6","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:50:21Z","timestamp":1468929021000},"page":"67-78","source":"Crossref","is-referenced-by-count":3,"title":["Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Gaven\u010diak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kouteck\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/3-540-46541-3_33","volume-title":"STACS 2000","author":"HL Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: $$\\lambda $$ -Coloring of graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 395\u2013406. Springer, Heidelberg (2000)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The $$L(2,1)$$ -labeling problem on graphs. SIAM J. Discret. Math. 9(2), 309\u2013316 (1996)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"6_CR3","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"DC Corneil","year":"2005","unstructured":"Corneil, D.C., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 34(4), 825\u2013847 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"6_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1\u20133), 77\u2013114 (2000)","journal-title":"Discret. Appl. Math."},{"key":"6_CR5","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.A., 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. 3580, pp. 360\u2013372. Springer, Heidelberg (2005)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-540-70575-8_25","volume-title":"Automata, Languages and Programming","author":"J Fiala","year":"2008","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Computational complexity of the distance constrained labeling problem for trees (extended abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"issue":"23","key":"6_CR7","doi-asserted-by":"crossref","first-page":"2513","DOI":"10.1016\/j.tcs.2010.10.043","volume":"412","author":"J Fiala","year":"2011","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: treewidth versus vertex cover. Theor. Comput. Sci. 412(23), 2513\u20132523 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J., Kloks, T.: Fixed-parameter complexity of $$\\lambda $$ -labelings. Discret. Appl. Math. 113(1), 59\u201372 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"6_CR9","doi-asserted-by":"crossref","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM J. Comput. 39(5), 1941\u20131956 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-319-03898-8_15","volume-title":"Parameterized and Exact Computation","author":"J Gajarsk\u00fd","year":"2013","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 163\u2013176. Springer, Heidelberg (2013)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-642-45278-9_15","volume-title":"Combinatorial Algorithms","author":"R Ganian","year":"2013","unstructured":"Ganian, R., Obdr\u017e\u00e1lek, J.: Expanding the expressive power of monadic second-order logic on restricted graph classes. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 164\u2013177. Springer, Heidelberg (2013)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discret. Math. 5(4), 586\u2013595 (1992)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"6_CR14","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.dam.2008.08.031","volume":"157","author":"F Gurski","year":"2009","unstructured":"Gurski, F., Wanke, E.: The NLC-width and clique-width for powers of graphs of bounded tree-width. Discret. Appl. Math. 157(4), 583\u2013595 (2009)","journal-title":"Discret. Appl. Math."},{"key":"6_CR15","unstructured":"Kobler, D., Rotics, U.: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). In: 12th ACM-SIAM of the Symposium on Discrete Algorithms, SODA 2001, Washington, pp. 468\u2013476 (2001)"},{"issue":"3","key":"6_CR16","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1137\/040619636","volume":"20","author":"D Kr\u00e1l","year":"2006","unstructured":"Kr\u00e1l, D.: The channel assignment problem with variable weights. SIAM J. Discret. Math. 20(3), 690\u2013704 (2006)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"6_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR18","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"6_CR19","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0012-365X(03)00236-X","volume":"273","author":"C McDiarmid","year":"2003","unstructured":"McDiarmid, C., Reed, B.: Channel assignment on graphs of bounded treewidth. Discret. Math. 273(1\u20133), 183\u2013192 (2003)","journal-title":"Discret. Math."},{"key":"6_CR20","unstructured":"\u0160kvarek, M.: The channel assignment problem for series-parallel graphs. Bachelor\u2019s thesis, Charles University, Prague (2010). (in Czech)"},{"issue":"2\u20133","key":"6_CR21","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","volume":"54","author":"E Wanke","year":"1994","unstructured":"Wanke, E.: $$k$$ -NLC graphs and polynomial algorithms. Discret. Appl. Math. 54(2\u20133), 251\u2013266 (1994)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:44:10Z","timestamp":1498315450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}