{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:32:34Z","timestamp":1743096754541,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_25","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"294-305","source":"Crossref","is-referenced-by-count":10,"title":["Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"5","key":"25_CR2","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T.: The L(h,k)-labeling problem: A survey and annotated bibliography. Computer Journal\u00a049(5), 585\u2013608 (2006)","journal-title":"Computer Journal"},{"issue":"1\u20133","key":"25_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","volume":"220","author":"G.J. Chang","year":"2000","unstructured":"Chang, G.J., Ke, W.-T., Liu, D.D.-F., Yeh, R.K.: On L(d,1)-labelings of graphs. Discrete Mathematics\u00a0220(1\u20133), 57\u201366 (2000)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"25_CR4","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 on Discrete Mathematics\u00a09(2), 309\u2013316 (1996)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a03580, pp. 360\u2013372. Springer, Heidelberg (2005)"},{"key":"25_CR6","unstructured":"Fiala, J., Golovach, P.\u00a0A., and Kratochv\u00edl, J.: Distance constrained labelings of trees. Tech. Rep. ITI Series 2008\u2013369, Charles University (2007)"},{"key":"25_CR7","doi-asserted-by":"publisher","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. Discussiones Mathematicae Graph Theory\u00a022, 89\u201399 (2002)","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"1","key":"25_CR8","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., Kratochv\u00edl, J., Kloks, T.: Fixed-parameter complexity of \u03bb-labelings. Discrete Applied Mathematics\u00a0113(1), 59\u201372 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45446-2_18","volume-title":"Theoretical Computer Science","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J., Proskurowski, A.: Distance constrained labeling of precolored trees. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 285\u2013292. Springer, Heidelberg (2001)"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2004.02.018","volume":"145","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Kratochv\u00edl, J., Proskurowski, A.: Systems of distant representatives. Discrete Applied Mathematics\u00a0145(2), 306\u2013316 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"25_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 on Discrete Mathematics\u00a05(4), 586\u2013595 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"25_CR12","series-title":"Addison-Wesley Series in Mathematics IX","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph theory. Addison-Wesley Series in Mathematics IX. Addison-Wesley, Reading (1969)"},{"key":"25_CR13","first-page":"621","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008","author":"F. Havet","year":"2008","unstructured":"Havet, F., Reed, B., Sereni, J.-S.: L(2,1)-labelling of graphs. In: Huang, S.-T. (ed.) Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 621\u2013630. SIAM, Philadelphia (2008)"},{"issue":"7-8","key":"25_CR14","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1016\/j.disc.2005.11.050","volume":"307","author":"D. Kr\u00e1l","year":"2007","unstructured":"Kr\u00e1l, D.: Mixed hypergraphs and other coloring problems. Discrete Mathematics\u00a0307(7-8), 923\u2013938 (2007)","journal-title":"Discrete Mathematics"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Leese, R.A., Noble, S.D.: Cyclic labellings with constraints at two distances. Electronic Journal of Combinatorics\u00a011(1) (2004)","DOI":"10.37236\/1769"},{"key":"25_CR16","first-page":"177","volume":"69","author":"D.D.-F. Liu","year":"2003","unstructured":"Liu, D.D.-F., Zhu, X.: Circulant distant two labeling and circular chromatic number. Ars Combinatoria\u00a069, 177\u2013183 (2003)","journal-title":"Ars Combinatoria"},{"key":"25_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502081.001.0001","volume-title":"Invitation to Discrete Mathematics","author":"J. Matou\u0161ek","year":"1998","unstructured":"Matou\u0161ek, J., Ne\u0161et\u0159il, J.: Invitation to Discrete Mathematics. Oxford University Press, Oxford (1998)"},{"issue":"2\u20133","key":"25_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"F.S. Roberts","year":"1991","unstructured":"Roberts, F.S.: T-colorings of graphs: recent results and open problems. Discrete Mathematics\u00a093(2\u20133), 229\u2013245 (1991)","journal-title":"Discrete Mathematics"},{"issue":"12","key":"25_CR19","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.disc.2005.11.029","volume":"306","author":"R.K. Yeh","year":"2006","unstructured":"Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discrete Mathematics\u00a0306(12), 1217\u20131231 (2006)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:26:13Z","timestamp":1714620373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}