{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:38:27Z","timestamp":1725849507811},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319295152"},{"type":"electronic","value":"9783319295169"}],"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-29516-9_24","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T05:05:19Z","timestamp":1455858319000},"page":"287-298","source":"Crossref","is-referenced-by-count":2,"title":["Computational Complexity of Distance Edge Labeling"],"prefix":"10.1007","author":[{"given":"Du\u0161an","family":"Knop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Masa\u0159\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2478\/v10209-011-0012-y","volume":"37","author":"P Formanowicz","year":"2012","unstructured":"Formanowicz, P., Tana\u015b, K.: A survey of graph coloring - its types, methods and applications. Found. Comput. Decis. Sci 37(3), 223\u2013238 (2012)","journal-title":"Found. Comput. Decis. Sci"},{"issue":"8","key":"24_CR2","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1093\/comjnl\/bxr037","volume":"54","author":"T Calamoneri","year":"2011","unstructured":"Calamoneri, T.: The L(h, k)-labelling problem: an updated survey and annotated bibliography. Comput. J. 54(8), 1344\u20131371 (2011)","journal-title":"Comput. J."},{"key":"24_CR3","unstructured":"Calamoneri, T.: The L(h, k)-labelling problem (online updated survey) (2013). \n                    http:\/\/wwwusers.di.uniroma1.it\/~calamo\/survey.html"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","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. Discrete Math. 5(4), 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"24_CR5","unstructured":"Yeh, R.K.: Labeling Graphs with a Condition of Distance Two. Ph.D. thesis, University of South Carolina (1990)"},{"issue":"12","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"issue":"1","key":"24_CR7","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 \n                    \n                      \n                    \n                    $$\\lambda $$\n                  -labelings. Discrete Appl. Math. 113(1), 59\u201372 (2001). Selected Papers: 12th Workshop on Graph-Theoretic Concepts in Computer Science","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"24_CR8","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a \n                    \n                      \n                    \n                    $$p$$\n                  -graph. Diskret. Analiz 3(7), 25\u201330 (1964)","journal-title":"Diskret. Analiz"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1137\/090763998","volume":"26","author":"F Havet","year":"2012","unstructured":"Havet, F., Reed, B., Sereni, J.S.: Griggs and yeh\u2019s conjecture and \n                    \n                      \n                    \n                    $$l(p,1)$$\n                  -labellings. SIAM J. Discrete Math. 26(1), 145\u2013168 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"24_CR10","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)"},{"key":"24_CR11","series-title":"Electronic library of mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2006","unstructured":"Diestel, R.: Graph Theory. Electronic library of mathematics. Springer, New York (2006)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226. ACM, New York (1978)","DOI":"10.1145\/800133.804350"},{"key":"24_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"101","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lonon Math. Socienty 101, 26\u201330 (1935)","journal-title":"J. Lonon Math. Socienty"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29516-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:40:41Z","timestamp":1559400041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29516-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319295152","9783319295169"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29516-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}