{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T05:50:13Z","timestamp":1745387413683},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_35","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"448-459","source":"Crossref","is-referenced-by-count":14,"title":["The Time Complexity of the Token Swapping Problem and Its Parallel Variants"],"prefix":"10.1007","author":[{"given":"Jun","family":"Kawahara","sequence":"first","affiliation":[]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[]},{"given":"Ryo","family":"Yoshinaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"3","key":"35_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/2514.2516","volume":"16","author":"D Bitton","year":"1984","unstructured":"Bitton, D., DeWitt, D.J., Hsiao, D.K., Menon, J.: A taxonomy of parallel sorting. ACM Comput. Surv. 16(3), 287\u2013318 (1984)","journal-title":"ACM Comput. Surv."},{"key":"35_CR2","unstructured":"Bonnet, \u00c9., Miltzow, T., Rz\u0105\u017cewski, P.: Complexity of Token Swapping and Its Variants. CoRR, abs\/1607.07676 (2016)"},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"issue":"3","key":"35_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0196-6774(81)90029-8","volume":"2","author":"S Even","year":"1981","unstructured":"Even, S., Goldreich, O.: The minimum-length generator sequence problem is NP-hard. J. Algorithms 2(3), 311\u2013313 (1981)","journal-title":"J. Algorithms"},{"key":"35_CR5","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, San Francisco (1979)"},{"issue":"5","key":"35_CR6","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1089\/106652703322539097","volume":"10","author":"LS Heath","year":"2003","unstructured":"Heath, L.S., Vergara, J.P.C.: Sorting by short swaps. J. Comput. Biol. 10(5), 775\u2013789 (2003)","journal-title":"J. Comput. Biol."},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"M Jerrum","year":"1985","unstructured":"Jerrum, M.: The complexity of finding minimum-length generator sequences. Theor. Comput. Sci. 36, 265\u2013289 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR8","series-title":"The IBM Research Symposia Series","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"The Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) The Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Heidelberg (1972)"},{"key":"35_CR9","unstructured":"Kawahara, J., Saitoh, T., Yoshinaka, R.: A note on the complexity of the token swapping problem. IPSJ SIG Technical report, 2015-AL-156(3), 1\u20137 January 2016 (in Japanese)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Kawahara, J., Saitoh, T., Yoshinaka, R.: The time complexity of the token swapping problem and its parallel variants. CoRR, abs\/1612.02948 (2016)","DOI":"10.1007\/978-3-319-53925-6_35"},{"key":"35_CR11","unstructured":"Miltzow, T., Narrins, L., Okamoto, Y., Rote, G., Thomas, A., Uno, T.: Approximation, hardness of token swapping. In: ESA, pp. 66:1\u201366:15 (2016)"},{"key":"35_CR12","unstructured":"Petersen, T.K., Tenner, B.E.; How to write a permutation as a product of involutions (and why you might care). Integers 13 (2013). Paper No. A63"},{"key":"35_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189\u2013201 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-319-07890-8_31","volume-title":"Fun with Algorithms","author":"K Yamanaka","year":"2014","unstructured":"Yamanaka, K., Demaine, E.D., Ito, T., Kawahara, J., Kiyomi, M., Okamoto, Y., Saitoh, T., Suzuki, A., Uchizawa, K., Uno, T.: Swapping labeled tokens on graphs. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) Fun with Algorithms. LNCS, vol. 8496, pp. 364\u2013375. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-07890-8_31"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-319-21840-3_51","volume-title":"Algorithms and Data Structures","author":"K Yamanaka","year":"2015","unstructured":"Yamanaka, K., Horiyama, T., Kirkpatrick, D., Otachi, Y., Saitoh, T., Uehara, R., Uno, Y.: Swapping colored tokens on graphs. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 619\u2013628. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-21840-3_51"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T21:30:47Z","timestamp":1568842247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}