{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:24:24Z","timestamp":1725582264206},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20877-5_9","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T02:35:17Z","timestamp":1303871717000},"page":"82-93","source":"Crossref","is-referenced-by-count":2,"title":["Fast Exact Algorithm for L(2,1)-Labeling of Graphs"],"prefix":"10.1007","author":[{"given":"Konstanty","family":"Junosza-Szaniawski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Rza\u0327\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Wormald, N.: igh degree graphs contain large-star factors. Fete of Combinatorics and Computer Science, Bolyai Soc. Math. Studies\u00a0(20), 9\u201321 (2010)","DOI":"10.1007\/978-3-642-13580-4_1"},{"key":"9_CR2","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":"9_CR3","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)-Labelling Problem: A Survey and Annotated Bibliography. Computer Journal\u00a049, 585\u2013608 (2006)","journal-title":"Computer Journal"},{"key":"9_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 of Discrete Mathematics\u00a09, 309\u2013316 (1996)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"9_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., 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":"9_CR6","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":"9_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cosrev.2008.06.001","volume":"2","author":"J. Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally constrained graph homomorphisms - structure, complexity, and applications. Computer Science Review\u00a02, 97\u2013111 (2008)","journal-title":"Computer Science Review"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11523468_16","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: Domination \u2013 A case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 191\u2013203. Springer, Heidelberg (2005)"},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"F. Fomin","year":"2010","unstructured":"Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"2646","DOI":"10.1016\/j.dam.2008.08.024","volume":"157","author":"J.R. Griggs","year":"2009","unstructured":"Griggs, J.R., Kr\u00e1l, D.: Graph labellings with variable weights, a survey. Discrete Applied Mathematics\u00a0157, 2646\u20132658 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"9_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":"9_CR12","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignemnt: Theory and applications. Proc. IEEE\u00a068, 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-04128-0_4","volume-title":"Algorithms - ESA 2009","author":"T. Hasunuma","year":"2009","unstructured":"Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A Linear Time Algorithm for L(2,1)-Labeling of Trees. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 35\u201346. Springer, Heidelberg (2009)"},{"key":"9_CR14","unstructured":"Havet, F., Reed, B., Sereni, J.-S.: L(2,1)-labellings of graphs. In: Proceedings of SODA 2008, pp. 621\u2013630 (2008)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00453-009-9302-7","volume":"59","author":"F. Havet","year":"2011","unstructured":"Havet, F., Klazar, M., Kratochv\u00edl, J., Kratsch, D., Liedloff, M.: Exact algorithms for L(2,1)-labeling of graphs. Algorithmica\u00a059, 169\u2013194 (2011)","journal-title":"Algorithmica"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"3270","DOI":"10.1016\/j.disc.2008.09.028","volume":"309","author":"R. Janczewski","year":"2009","unstructured":"Janczewski, R., Kosowski, A., Ma\u0142afiejski, M.: The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree. Discrete Mathematics\u00a0309, 3270\u20133279 (2009)","journal-title":"Discrete Mathematics"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-19222-7_4","volume-title":"Combinatorial Algorithms","author":"K. Junosza-Szaniawski","year":"2011","unstructured":"Junosza-Szaniawski, K., Rz\u0105\u017cewski, P.: On Improved Exact Algorithms for L(2,1)-Labeling of Graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 34\u201337. Springer, Heidelberg (2011)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Junosza-Szaniawski K., Rz\u0105\u017cewski P.: On the Complexity of Exact Algorithm for L(2,1)-labeling of Graphs. KAM-DIMATIA Preprint Series 2010-992","DOI":"10.1007\/978-3-642-19222-7_4"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1137\/040619636","volume":"20","author":"D. Kr\u00e1l","year":"2006","unstructured":"Kr\u00e1l, D.: Channel assignment problem with variable weights. SIAM Journal on Discrete Mathematics\u00a020, 690\u2013704 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-74456-6_46","volume-title":"Mathematical Foundations of Computer Science 2007","author":"J. Kratochv\u00edl","year":"2007","unstructured":"Kratochv\u00edl, J., Kratsch, D., Liedloff, M.: Exact algorithms for L(2,1)-labeling of graphs. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 513\u2013524. Springer, Heidelberg (2007)"},{"key":"9_CR21","unstructured":"Roberts, F.S.: Private communication to J. Griggs"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-04128-0_51","volume-title":"Algorithms - ESA 2009","author":"J.M.M. Rooij van","year":"2009","unstructured":"van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 566\u2013577. Springer, Heidelberg (2009)"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian Elimination is not Optimal. Numerische Mathematik\u00a013, 354\u2013356 (1969)","journal-title":"Numerische Mathematik"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.disc.2005.11.029","volume":"306","author":"R. Yeh","year":"2006","unstructured":"Yeh, R.: A survey on labeling graphs with a condition at distance two. Discrete Mathematics\u00a0306, 1217\u20131231 (2006)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20877-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:08:37Z","timestamp":1558573717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}