{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T05:13:50Z","timestamp":1725254030446},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"vor","delay-in-days":1487,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1161626"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DARPA\/AFOSR","award":["FA9550-12-1-0423"]},{"name":"MEXT\/JSPS KAKENHI","award":["24106010","24700130","25106502","25106504","25330003","26730001"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1016\/j.tcs.2015.01.052","type":"journal-article","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T04:02:43Z","timestamp":1425528163000},"page":"81-94","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":37,"special_numbering":"C","title":["Swapping labeled tokens on graphs"],"prefix":"10.1016","volume":"586","author":[{"given":"Katsuhisa","family":"Yamanaka","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Takehiro","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Kawahara","sequence":"additional","affiliation":[]},{"given":"Masashi","family":"Kiyomi","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Suzuki","sequence":"additional","affiliation":[]},{"given":"Kei","family":"Uchizawa","sequence":"additional","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2015.01.052_br0010","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/2514.2516","article-title":"A taxonomy of parallel sorting","volume":"16","author":"Bitton","year":"1984","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.tcs.2015.01.052_br0020","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0895480192237403","article-title":"Tree spanners","volume":"8","author":"Cai","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2015.01.052_br0030","first-page":"527","article-title":"Note on the theory of permutations","volume":"34","author":"Cayley","year":"1849","journal-title":"Philos. Mag."},{"key":"10.1016\/j.tcs.2015.01.052_br0040","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0022-0000(93)90043-V","article-title":"Deterministic sorting in nearly logarithmic time on the hypercube and related computers","volume":"47","author":"Cypher","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2015.01.052_br0050","series-title":"Proc. APPROX\u2013RANDOM 2011","first-page":"171","article-title":"An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs","volume":"vol. 6845","author":"Dragan","year":"2011"},{"key":"10.1016\/j.tcs.2015.01.052_br0060","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1137\/060666202","article-title":"Approximating minimum max-stretch spanning trees on unweighted graphs","volume":"38","author":"Emek","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2015.01.052_br0070","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1089\/106652703322539097","article-title":"Sorting by short swaps","volume":"10","author":"Heath","year":"2003","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.tcs.2015.01.052_br0080","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","article-title":"The complexity of finding minimum-length generator sequence","volume":"36","author":"Jerrum","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2015.01.052_br0090","article-title":"Axioms and Hulls","volume":"vol. 606","author":"Knuth","year":"1992"},{"key":"10.1016\/j.tcs.2015.01.052_br0100","series-title":"The Art of Computer Programming","volume":"vol. 3","author":"Knuth","year":"1998"},{"key":"10.1016\/j.tcs.2015.01.052_br0110","series-title":"Symmetric Functions, Schubert Polynomials and Degeneracy Loci","author":"Manivel","year":"2001"},{"key":"10.1016\/j.tcs.2015.01.052_br0120","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","article-title":"Sorting on a mesh-connected parallel computer","volume":"20","author":"Thompson","year":"1977","journal-title":"Commun. ACM"},{"key":"10.1016\/j.tcs.2015.01.052_br0130","series-title":"Proc. of FUN 2014","first-page":"364","article-title":"Swapping labeled tokens on graphs","volume":"vol. 8496","author":"Yamanaka","year":"2014"},{"key":"10.1016\/j.tcs.2015.01.052_br0140","doi-asserted-by":"crossref","first-page":"1714","DOI":"10.1016\/j.tcs.2010.01.002","article-title":"Efficient enumeration of all ladder lotteries and its application","volume":"411","author":"Yamanaka","year":"2010","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515001656?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515001656?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T06:02:43Z","timestamp":1569391363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397515001656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":14,"alternative-id":["S0304397515001656"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2015.01.052","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2015,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Swapping labeled tokens on graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2015.01.052","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}