{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T05:55:28Z","timestamp":1697608528079},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Agence nationale de la recherche","award":["ANR-16-CE40-0028"],"award-info":[{"award-number":["ANR-16-CE40-0028"]}]},{"name":"Agence nationale de la recherche","award":["ANR-17-CE23-0010"],"award-info":[{"award-number":["ANR-17-CE23-0010"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00224-020-10012-x","type":"journal-article","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T10:03:12Z","timestamp":1610964192000},"page":"815-838","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Reload Cost Graph Factors"],"prefix":"10.1007","volume":"65","author":[{"given":"Julien","family":"Baste","sequence":"first","affiliation":[]},{"given":"Didem","family":"G\u00f6z\u00fcpek","sequence":"additional","affiliation":[]},{"given":"Mordechai","family":"Shalom","sequence":"additional","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,18]]},"reference":[{"issue":"3","key":"10012_CR1","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1002\/net.20423","volume":"57","author":"E Amaldi","year":"2011","unstructured":"Amaldi, E., Galbiati, G., Maffioli, F.: On minimum reload cost paths, tours, and flows. Networks 57(3), 254\u2013260 (2011)","journal-title":"Networks"},{"issue":"8","key":"10012_CR2","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1016\/j.comnet.2013.03.004","volume":"57","author":"S Arkoulis","year":"2013","unstructured":"Arkoulis, S., Anifantis, E., Karyotis, V., Papavassiliou, S., Mitrou, N.: On the optimal, fair and channel-aware cognitive radio network reconfiguration. Comput. Netw. 57(8), 1739\u20131757 (2013)","journal-title":"Comput. Netw."},{"issue":"2","key":"10012_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A ckn 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10012_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TCCN.2016.2608337","volume":"2","author":"A Celik","year":"2016","unstructured":"Celik, A., Kamal, A.E.: Green cooperative spectrum sensing and scheduling in heterogeneous cognitive radio networks. IEEE Trans. Cogn. Commun. Netw. 2(3), 238\u2013248 (2016)","journal-title":"IEEE Trans. Cogn. Commun. Netw."},{"key":"10012_CR5","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":"10012_CR6","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp 150\u2013159. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.23"},{"key":"10012_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag TELOS, Santa Clara (2008)","edition":"3rd edn."},{"key":"10012_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of parameterized complexity. Texts in Computer Science. Springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"18","key":"10012_CR9","doi-asserted-by":"publisher","first-page":"3494","DOI":"10.1016\/j.dam.2008.02.013","volume":"156","author":"G Galbiati","year":"2008","unstructured":"Galbiati, G.: The complexity of a minimum reload cost diameter problem. Discret. Appl. Math. 156(18), 3494\u20133497 (2008)","journal-title":"Discret. Appl. Math."},{"key":"10012_CR10","doi-asserted-by":"crossref","unstructured":"Galbiati, G., Gualandi, S., Maffioli, F.: On minimum changeover cost arborescences. In: Proceedings of the 10th International Symposium on Experimental Algorithms (SEA), volume 6630 of LNCS, pp 112\u2013123 (2011)","DOI":"10.1007\/978-3-642-20662-7_10"},{"key":"10012_CR11","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.dam.2011.12.006","volume":"164","author":"G Galbiati","year":"2014","unstructured":"Galbiati, G., Gualandi, S., Maffioli, F.: On minimum reload cost cycle cover. Discret. Appl. Math. 164, 112\u2013120 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"10012_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/net.20443","volume":"59","author":"I Gamvros","year":"2012","unstructured":"Gamvros, I., Gouveia, L., Raghavan, S.: Reload cost trees and network design. Networks 59(4), 365\u2013379 (2012)","journal-title":"Networks"},{"issue":"13","key":"10012_CR13","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.dam.2010.03.009","volume":"158","author":"L Gourv\u00e8s","year":"2010","unstructured":"Gourv\u00e8s, L., Lyra, A., Martinhon, C., Monnot, J.: The minimum reload s-t path, trail and walk problems. Discret. Appl. Math. 158(13), 1404\u20131417 (2010)","journal-title":"Discret. Appl. Math."},{"key":"10012_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2017.06.013","volume":"690","author":"D G\u00f6z\u00fcpek","year":"2017","unstructured":"G\u00f6z\u00fcpek, D., \u00d6zkan, S., Paul, C., Sau, I., Shalom, M.: Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690, 91\u2013103 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"10012_CR15","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1109\/TMC.2012.101","volume":"12","author":"D G\u00f6z\u00fcpek","year":"2013","unstructured":"G\u00f6z\u00fcpek, D., Buhari, S., Alag\u00f6z, F.: A spectrum switching delay-aware scheduling algorithm for centralized cognitive radio networks. IEEE Trans. Mob. Comput. 12(7), 1270\u20131280 (2013)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10012_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2016.01.022","volume":"621","author":"D G\u00f6z\u00fcpek","year":"2016","unstructured":"G\u00f6z\u00fcpek, D., Shachnai, H., Shalom, M., Zaks, S.: Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621, 22\u201336 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10012_CR17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1002\/net.21867","volume":"73","author":"D G\u00f6z\u00fcpek","year":"2019","unstructured":"G\u00f6z\u00fcpek, D., Shalom, M.: The complexity of edge coloring with minimum reload\/changeover costs. Networks 73(3), 344\u2013357 (2019)","journal-title":"Networks"},{"key":"10012_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2014.03.023","volume":"540","author":"D G\u00f6z\u00fcpek","year":"2014","unstructured":"G\u00f6z\u00fcpek, D., Shalom, M., Voloshin, A., Zaks, S.: On the complexity of constructing minimum changeover cost arborescences. Theor. Comput. Sci. 540, 40\u201352 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10012_CR19","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/S0097539793258143","volume":"25","author":"H Kaplan","year":"1996","unstructured":"Kaplan, H., Shamir, R.: Pathwidth, bandwidth, and completion problems to proper interval graphsQ with small cliques. SIAM J. Comput. 25(3), 540\u2013561 (1996)","journal-title":"SIAM J. Comput."},{"key":"10012_CR20","doi-asserted-by":"crossref","unstructured":"Kloks, T.: Treewidth. Computations and Approximations. Springer-Verlag LNCS (1994)","DOI":"10.1007\/BFb0045375"},{"issue":"12","key":"10012_CR21","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ipl.2009.02.013","volume":"109","author":"H Meijer","year":"2009","unstructured":"Meijer, H., N\u00fa\u00f1ez-Rodr\u00edguez, Y., Rappaport, D.: An algorithm for computing simple k-factors. Inf. Process. Lett. 109(12), 620\u2013625 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10012_CR22","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10012_CR23","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0012-365X(84)90164-X","volume":"49","author":"A Proskurowski","year":"1984","unstructured":"Proskurowski, A.: Separating subgraphs in k-trees: Cables and caterpillars. Discret. Math. 49(3), 275\u2013285 (1984)","journal-title":"Discret. Math."},{"key":"10012_CR24","doi-asserted-by":"crossref","unstructured":"Pulleyblank, R.: Faces of Matching Polyhedra, PhD thesis, University of Waterloo (1973)","DOI":"10.1007\/BFb0066196"},{"key":"10012_CR25","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing STOC \u201978, pp 216\u2013226. ACM, New York (1978)","DOI":"10.1145\/800133.804350"},{"key":"10012_CR26","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency, vol. 24","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer Science & Business Media, Berlin (2003)"},{"issue":"2","key":"10012_CR27","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(94)00160-K","volume":"137","author":"A Takahashi","year":"1995","unstructured":"Takahashi, A., Ueno, S., Kajitani, Y.: Mixed searching and proper-path-width. Theor. Comput. Sci. 137(2), 253\u2013268 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10012_CR28","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.dam.2004.01.012","volume":"145","author":"JA Telle","year":"2005","unstructured":"Telle, J.A.: Tree-decompositions of small pathwidth. Discret. Appl. Math. 145(2), 210\u2013218 (2005)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"10012_CR29","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0166-218X(00)00392-9","volume":"113","author":"H-C Wirth","year":"2001","unstructured":"Wirth, H.-C., Steffan, J.: Reload cost problems: minimum diameter spanning tree. Discret. Appl. Math. 113(1), 73\u201385 (2001)","journal-title":"Discret. Appl. Math."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-10012-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-020-10012-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-10012-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T22:44:40Z","timestamp":1697582680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-020-10012-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,18]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["10012"],"URL":"https:\/\/doi.org\/10.1007\/s00224-020-10012-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,18]]},"assertion":[{"value":"9 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}