{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:26:43Z","timestamp":1725794803198},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_31","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T12:08:51Z","timestamp":1401278931000},"page":"364-375","source":"Crossref","is-referenced-by-count":7,"title":["Swapping Labeled Tokens on Graphs"],"prefix":"10.1007","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":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/2514.2516","volume":"16","author":"D. Bitton","year":"1984","unstructured":"Bitton, D., DeWitt, D.J., Hsaio, D.K., Menon, J.: A taxonomy of parallel sorting. ACM Computing Surveys\u00a016, 287\u2013318 (1984)","journal-title":"ACM Computing Surveys"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L. Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discrete Mathematics\u00a08, 359\u2013387 (1995)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"31_CR3","first-page":"527","volume":"34","author":"A. Cayley","year":"1849","unstructured":"Cayley, A.: Note on the theory of permutations. Philosophical Magazine\u00a034, 527\u2013529 (1849)","journal-title":"Philosophical Magazine"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/0022-0000(93)90043-V","volume":"47","author":"R. Cypher","year":"1993","unstructured":"Cypher, R., Plaxton, C.G.: Deterministic sorting in nearly logarithmic time on the hypercube and related computers. J. Computer and System Sciences\u00a047, 501\u2013548 (1993)","journal-title":"J. Computer and System Sciences"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-22935-0_15","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"F.F. Dragan","year":"2011","unstructured":"Dragan, F.F., K\u00f6hler, E.: An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.)APPROX\/RANDOM 2011. LNCS, vol.\u00a06845, pp. 171\u2013183. Springer, Heidelberg (2011)"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/060666202","volume":"38","author":"Y. Emek","year":"2008","unstructured":"Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs. SIAM J. Computing\u00a038, 1761\u20131781 (2008)","journal-title":"SIAM J. Computing"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1089\/106652703322539097","volume":"10","author":"L.S. Heath","year":"2003","unstructured":"Heath, L.S., Vergara, J.P.C.: Sorting by short swaps. J. Computational Biology\u00a010, 775\u2013789 (2003)","journal-title":"J. Computational Biology"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"M.R. Jerrum","year":"1985","unstructured":"Jerrum, M.R.: The complexity of finding minimum-length generator sequence. Theoretical Computer Science\u00a036, 265\u2013289 (1985)","journal-title":"Theoretical Computer Science"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Axioms and Hulls","year":"1992","unstructured":"Knuth, D.E. (ed.): Axioms and Hulls. LNCS, vol.\u00a0606. Springer, Heidelberg (1992)"},{"key":"31_CR10","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn., vol.\u00a03. Addison-Wesley (1998)"},{"key":"31_CR11","unstructured":"Manivel, L.: Symmetric Functions, Schubert Polynomials and Degeneracy Loci. American Mathematical Society (2001)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/359461.359481","volume":"20","author":"C.D. Thompson","year":"1977","unstructured":"Thompson, C.D., Kung, H.T.: Sorting on a mesh-connected parallel computer. Communications ACM\u00a020, 263\u2013271 (1977)","journal-title":"Communications ACM"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1016\/j.tcs.2010.01.002","volume":"411","author":"K. Yamanaka","year":"2010","unstructured":"Yamanaka, K., Nakano, S., Matsui, Y., Uehara, R., Nakada, K.: Efficient enumeration of all ladder lotteries and its application. Theoretical Computer Science\u00a0411, 1714\u20131722 (2010)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:17:03Z","timestamp":1558898223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}