{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:32:04Z","timestamp":1772717524849,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:00:00Z","timestamp":1585008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:00:00Z","timestamp":1585008000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JSPS and MAEDI","award":["GRAPA 38593YJ"],"award-info":[{"award-number":["GRAPA 38593YJ"]}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP24106004"],"award-info":[{"award-number":["JP24106004"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP17H01698"],"award-info":[{"award-number":["JP17H01698"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18K11157"],"award-info":[{"award-number":["JP18K11157"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18K11168"],"award-info":[{"award-number":["JP18K11168"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18K11169"],"award-info":[{"award-number":["JP18K11169"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18H04091"],"award-info":[{"award-number":["JP18H04091"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18H06469"],"award-info":[{"award-number":["JP18H06469"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00453-020-00700-y","type":"journal-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T13:02:45Z","timestamp":1585054965000},"page":"2586-2605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Independent Set Reconfiguration Parameterized by Modular-Width"],"prefix":"10.1007","volume":"82","author":[{"given":"R\u00e9my","family":"Belmonte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,24]]},"reference":[{"key":"700_CR1","unstructured":"Belmonte, R., Kim, E.J., Lampis, M., Mitsou, V., Otachi, Y., Sikora, F.: Token sliding on split graphs. In: STACS, Volume 126 of LIPIcs, pp. 13:1\u201313:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2019)"},{"key":"700_CR2","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Bousquet, N.: Token sliding on chordal graphs. In: WG 2017, Volume 10520 of LNCS, pp. 127\u2013139 (2017)","DOI":"10.1007\/978-3-319-68705-6_10"},{"issue":"2","key":"700_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/jgt.21992","volume":"83","author":"PS Bonsma","year":"2016","unstructured":"Bonsma, P.S.: Independent set reconfiguration in cographs and their generalizations. J. Graph Theory 83(2), 164\u2013195 (2016)","journal-title":"J. Graph Theory"},{"key":"700_CR4","doi-asserted-by":"crossref","unstructured":"Bonsma, P.S., Kaminski, M., Wrochna, M.: Reconfiguring independent sets in claw-free graphs. In: SWAT, Volume 8503 of LNCS, pp. 86\u201397. Springer (2014)","DOI":"10.1007\/978-3-319-08404-6_8"},{"key":"700_CR5","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Mary, A., Parreau, A.: Token jumping in minor-closed classes. In: FCT, Volume 10472 of LNCS, pp. 136\u2013149. Springer (2017)","DOI":"10.1007\/978-3-662-55751-8_12"},{"key":"700_CR6","doi-asserted-by":"crossref","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: CAAP, Volume 787 of LNCS, pp. 68\u201384. Springer (1994)","DOI":"10.1007\/BFb0017474"},{"key":"700_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"key":"700_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2015.07.037","volume":"600","author":"ED Demaine","year":"2015","unstructured":"Demaine, E.D., Demaine, M.L., Fox-Epstein, E., Hoang, D.A., Ito, T., Ono, H., Otachi, Y., Uehara, R., Yamada, T.: Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600, 132\u2013142 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"700_CR9","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1007\/s00453-017-0297-1","volume":"80","author":"FV Fomin","year":"2018","unstructured":"Fomin, F.V., Liedloff, M., Montealegre, P., Todinca, I.: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Algorithmica 80(4), 1146\u20131169 (2018)","journal-title":"Algorithmica"},{"key":"700_CR10","doi-asserted-by":"crossref","unstructured":"Fox-Epstein, E., Hoang, D.A., Otachi, Y., Uehara, R.: Sliding token on bipartite permutation graphs. In: ISAAC, Volume 9472 of LNCS, pp. 237\u2013247. Springer (2015)","DOI":"10.1007\/978-3-662-48971-0_21"},{"key":"700_CR11","doi-asserted-by":"crossref","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: IPEC, Volume 8246 of LNCS, pp. 163\u2013176. Springer (2013)","DOI":"10.1007\/978-3-319-03898-8_15"},{"issue":"1","key":"700_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"issue":"1\u20132","key":"700_CR13","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RA Hearn","year":"2005","unstructured":"Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1\u20132), 72\u201396 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"700_CR14","unstructured":"Hoang, D.A., Uehara, R.: Sliding tokens on a cactus. In: ISAAC, Volume 64 of LIPIcs, pp. 37:1\u201337:26. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"12\u201314","key":"700_CR15","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., Demaine, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"700_CR16","doi-asserted-by":"crossref","unstructured":"Ito, T., Kaminski, M., Ono, H., Suzuki, A., Uehara, R., Yamanaka, K.: On the parameterized complexity for token jumping on graphs. In: TAMC, Volume 8402 of LNCS, pp. 341\u2013351. Springer (2014)","DOI":"10.1007\/978-3-319-06089-7_24"},{"key":"700_CR17","doi-asserted-by":"crossref","unstructured":"Ito, T., Kaminski, M.J., Ono, H.: Fixed-parameter tractability of token jumping on planar graphs. In: ISAAC, Volume 8889 of LNCS, pp. 208\u2013219. Springer (2014)","DOI":"10.1007\/978-3-319-13075-0_17"},{"key":"700_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","volume":"439","author":"M Kami\u0144ski","year":"2012","unstructured":"Kami\u0144ski, M., Medvedev, P., Milani\u010d, M.: Complexity of independent set reconfigurability problems. Theor. Comput. Sci. 439, 9\u201315 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"700_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"key":"700_CR20","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Mouawad, A.E.: The complexity of independent set reconfiguration on bipartite graphs. In: SODA 2018, pp. 185\u2013195 (2018)","DOI":"10.1137\/1.9781611975031.13"},{"issue":"1","key":"700_CR21","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00453-016-0159-2","volume":"78","author":"AE Mouawad","year":"2017","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. Algorithmica 78(1), 274\u2013297 (2017)","journal-title":"Algorithmica"},{"issue":"4","key":"700_CR22","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018)","journal-title":"Algorithms"},{"key":"700_CR23","doi-asserted-by":"crossref","unstructured":"Tedder, M., Corneil, D.G., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: ICALP (1), Volume 5125 of LNCS, pp. 634\u2013645. Springer (2008)","DOI":"10.1007\/978-3-540-70575-8_52"},{"key":"700_CR24","doi-asserted-by":"crossref","unstructured":"van den Heuvel, J.: The complexity of change. In: Blackburn, S.R., Gerke, S., Wildon, M. (eds.) Surveys in Combinatorics 2013, Volume 409 of London Mathematical Society Lecture Note Series, pp. 127\u2013160. Cambridge University Press (2013)","DOI":"10.1017\/CBO9781139506748.005"},{"key":"700_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2017.11.003","volume":"93","author":"M Wrochna","year":"2018","unstructured":"Wrochna, M.: Reconfiguration in bounded bandwidth and tree-depth. J. Comput. Syst. Sci. 93, 1\u201310 (2018)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00700-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-020-00700-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00700-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T00:31:21Z","timestamp":1616545881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-020-00700-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,24]]},"references-count":25,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["700"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00700-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,24]]},"assertion":[{"value":"28 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}