{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:07Z","timestamp":1759638907666,"version":"3.40.5"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T00:00:00Z","timestamp":1533600000000},"content-version":"vor","delay-in-days":1467,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"JSPS","doi-asserted-by":"publisher","award":["25106504","25330003","24106004","25104521","26540005","23500001"],"award-info":[{"award-number":["25106504","25330003","24106004","25104521","26540005","23500001"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1016\/j.tcs.2014.04.011","type":"journal-article","created":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T09:14:11Z","timestamp":1397812451000},"page":"84-97","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["Reconfiguration of list<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>L<\/mml:mi><mml:mo stretchy=\"false\">(<\/mml:mo><mml:mn>2<\/mml:mn><mml:mo>,<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo stretchy=\"false\">)<\/mml:mo><\/mml:math>-labelings in a graph"],"prefix":"10.1016","volume":"544","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Kazuto","family":"Kawamura","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2014.04.011_br0010","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/s10878-012-9490-y","article-title":"Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs","volume":"27","author":"Bonamy","year":"2014","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2014.04.011_br0020","doi-asserted-by":"crossref","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","article-title":"Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances","volume":"410","author":"Bonsma","year":"2009","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.04.011_br0030","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1093\/comjnl\/bxr037","article-title":"The L(h,k)-labelling problem: an updated survey and annotated bibliography","volume":"54","author":"Calamoneri","year":"2011","journal-title":"Comput. J."},{"key":"10.1016\/j.tcs.2014.04.011_br0040","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.20514","article-title":"Finding paths between 3-colourings","volume":"67","author":"Cereceda","year":"2011","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2014.04.011_br0050","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1137\/07070440X","article-title":"The connectivity of Boolean satisfiability: computational and structural dichotomies","volume":"38","author":"Gopalan","year":"2009","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2014.04.011_br0060","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1007\/s00453-012-9657-z","article-title":"A linear time algorithm for L(2,1)-labeling of trees","volume":"66","author":"Hasunuma","year":"2013","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2014.04.011_br0070","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","article-title":"PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation","volume":"343","author":"Hearn","year":"2005","journal-title":"Theoret. Comput. Sci."},{"year":"2009","series-title":"Games, Puzzles, and Computation","author":"Hearn","key":"10.1016\/j.tcs.2014.04.011_br0080"},{"key":"10.1016\/j.tcs.2014.04.011_br0090","doi-asserted-by":"crossref","DOI":"10.1007\/s10878-012-9562-z","article-title":"Approximability of the subset sum reconfiguration problem","author":"Ito","year":"2014","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2014.04.011_br0100","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","article-title":"On the complexity of reconfiguration problems","volume":"412","author":"Ito","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.04.011_br0110","doi-asserted-by":"crossref","first-page":"2199","DOI":"10.1016\/j.dam.2012.05.014","article-title":"Reconfiguration of list edge-colorings in a graph","volume":"160","author":"Ito","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2014.04.011_br0120","series-title":"Proc. of ISAAC 2012","first-page":"34","article-title":"Reconfiguration of list L(2,1)-labelings in a graph","volume":"vol. 7676","author":"Ito","year":"2012"},{"key":"10.1016\/j.tcs.2014.04.011_br0130","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1587\/transinf.E95.D.737","article-title":"An improved sufficient condition for reconfiguration of list edge-colorings in a tree","volume":"95-D","author":"Ito","year":"2012","journal-title":"IEICE Trans. Inf. Syst. E"},{"key":"10.1016\/j.tcs.2014.04.011_br0140","doi-asserted-by":"crossref","first-page":"5205","DOI":"10.1016\/j.tcs.2011.05.021","article-title":"Shortest paths between shortest paths","volume":"412","author":"Kami\u0144ski","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.04.011_br0150","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","article-title":"Complexity of independent set reconfigurability problems","volume":"439","author":"Kami\u0144ski","year":"2012","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.04.011_br0160","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.tcs.2005.09.032","article-title":"List version of L(d,s)-labelings","volume":"349","author":"Kohl","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.04.011_br0170","doi-asserted-by":"crossref","first-page":"4613","DOI":"10.1016\/j.tcs.2011.04.041","article-title":"An exact algorithm for the Boolean connectivity problem for k-CNF","volume":"412","author":"Makino","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.04.011_br0180","series-title":"Proc. of INFOCOM 1999","first-page":"601","article-title":"A centralized approach to dynamic channel assignment in wireless ATM LANs","volume":"vol. 2","author":"Marias","year":"1999"},{"key":"10.1016\/j.tcs.2014.04.011_br0190","series-title":"IEEE the 13th International Conference on Communication Systems","article-title":"Channel segregation based dynamic channel assignment for WLAN","author":"Matsumura","year":"2012"},{"key":"10.1016\/j.tcs.2014.04.011_br0200","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1137\/S0097539796299266","article-title":"Bipartite edge coloring in O(\u0394m) time","volume":"28","author":"Schrijver","year":"1998","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514002904?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514002904?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T17:24:25Z","timestamp":1538673865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514002904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":20,"alternative-id":["S0304397514002904"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.04.011","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2014,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reconfiguration of list -labelings in a graph","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.04.011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}