{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:37:12Z","timestamp":1774334232727,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_16","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:02Z","timestamp":1770977222000},"page":"232-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Computational Complexity of Covering Multi-Interface Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5460-6222","authenticated-orcid":false,"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9668-1300","authenticated-orcid":false,"given":"Morgan","family":"Chopin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7451-9401","authenticated-orcid":false,"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3636-6571","authenticated-orcid":false,"given":"Camille","family":"Richer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Aloisio, A.: Algorithmic aspects of distributing energy consumption in multi-interface networks. In: International Conference on Advanced Information Networking and Applications, pp. 114\u2013123. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-57942-4_13"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Aloisio, A., Navarra, A.: Balancing energy consumption for the establishment of multi-interface networks. In: International Conference on Current Trends in Theory and Practice of Informatics, pp. 102\u2013114. Springer, Cham (2015)","DOI":"10.1007\/978-3-662-46078-8_9"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Aloisio, A., Navarra, A.: Constrained connectivity in bounded x-width multi-interface networks. Algorithms 13(2) (2020)","DOI":"10.3390\/a13020031"},{"key":"16_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2024.101353","volume":"28","author":"A Aloisio","year":"2024","unstructured":"Aloisio, A., Navarra, A.: Parameterized complexity of coverage in multi-interface IoT networks: pathwidth. Internet Things 28, 101353 (2024)","journal-title":"Internet Things"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Aloisio, A., Navarra, A., Mostarda, L.: Distributing energy consumption in multi-interface series-parallel networks. In: Workshops of the International Conference on Advanced Information Networking and Applications, pp. 734\u2013744. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-15035-8_71"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","volume":"58","author":"A Boral","year":"2016","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion. Theory Comput. Syst. 58(2), 357\u2013376 (2016)","journal-title":"Theory Comput. Syst."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a03. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Caporuscio, M., Charlet, D., Issarny, V., Navarra, A.: Energetic performance of service-oriented multi-radio networks: issues and perspectives. In: Proceedings of the 6th International Workshop on Software and Performance, pp. 42\u201345 (2007)","DOI":"10.1145\/1216993.1217002"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00453-011-9531-4","volume":"63","author":"G d\u2019Angelo","year":"2012","unstructured":"d\u2019Angelo, G., Di Stefano, G., Navarra, A.: Minimize the maximum duty in multi-interface networks. Algorithmica 63, 274\u2013295 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"MR Fellows","year":"2013","unstructured":"Fellows, M.R., Jansen, B.M.P., Rosamond, F.A.: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34(3), 541\u2013566 (2013)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/s00224-009-9167-9","volume":"45","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F.A., Saurabh, S.: The complexity ecology of parameters: an illustration using bounded max leaf number. Theory Comput. Syst. 45(4), 822\u2013848 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"16_CR15","first-page":"77","volume":"17","author":"R Ganian","year":"2015","unstructured":"Ganian, R.: Improving vertex cover as a graph parameter. Discret. Math. Theor. Comput. Sci. 17(2), 77\u2013100 (2015)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1002\/net.20266","volume":"53","author":"R Klasing","year":"2009","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Cost minimization in wireless networks with a bounded and unbounded number of interfaces. Networks 53(3), 266\u2013275 (2009)","journal-title":"Networks"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Korhonen, T., Lokshtanov, D.: An improved parameterized algorithm for treewidth. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC 2023), pp. 528\u2013541. ACM (2023)","DOI":"10.1145\/3564246.3585245"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/JIOT.2021.3103320","volume":"9","author":"DC Nguyen","year":"2021","unstructured":"Nguyen, D.C., et al.: 6G Internet of Things: a comprehensive survey. IEEE Internet Things J. 9(1), 359\u2013383 (2021)","journal-title":"IEEE Internet Things J."},{"issue":"4","key":"16_CR19","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":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00224-020-10005-w","volume":"65","author":"D Tsur","year":"2021","unstructured":"Tsur, D.: Faster parameterized algorithm for cluster vertex deletion. Theory Comput. Syst. 65(2), 323\u2013343 (2021)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:14:39Z","timestamp":1774325679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}