{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:34:35Z","timestamp":1757309675057,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_16","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"206-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complexity Framework for\u00a0Forbidden Subgraphs IV: The Steiner Forest Problem"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4419-3143","authenticated-orcid":false,"given":"Jelle J.","family":"Oostveen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5728-1120","authenticated-orcid":false,"given":"Sukanya","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siani","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5240-7257","authenticated-orcid":false,"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"16_CR1","first-page":"34","volume":"4","author":"VE Alekseev","year":"1992","unstructured":"Alekseev, V.E., Korobitsyn, D.V.: Complexity of some problems on hereditary graph classes. Diskret. Mat. 4, 34\u201340 (1992)","journal-title":"Diskret. Mat."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"16_CR3","first-page":"13","volume":"1","author":"CA Barefoot","year":"1987","unstructured":"Barefoot, C.A., Entringer, R., Swart, H.: Vulnerability in graphs - a comparative survey. J. Comb. Math. Comb. Comput. 1, 13\u201322 (1987)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bateni, M., Hajiaghayi, M.T., Marx, D.: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. J. ACM 58, 21:1\u201321:37 (2011)","DOI":"10.1145\/2027216.2027219"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2021.03.012","volume":"867","author":"HL Bodlaender","year":"2021","unstructured":"Bodlaender, H.L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D., van Leeuwen, E.J.: Steiner trees for hereditary graph classes: a treewidth perspective. Theoret. Comput. Sci. 867, 30\u201339 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"3566","DOI":"10.1007\/s00453-020-00737-z","volume":"82","author":"HL Bodlaender","year":"2020","unstructured":"Bodlaender, H.L., et al.: Subgraph Isomorphism on graph classes that exclude a substructure. Algorithmica 82, 3566\u20133587 (2020)","journal-title":"Algorithmica"},{"key":"16_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-031-15914-5_9","volume-title":"WG 2022","author":"L Bulteau","year":"2022","unstructured":"Bulteau, L., Dabrowski, K.K., K\u00f6hler, N., Ordyniak, S., Paulusma, D.: An algorithmic framework for locally constrained homomorphisms. In: Bekos, M.A., Kaufmann, M. (eds.) WG 2022. LNCS, vol. 13453, pp. 114\u2013128. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_9"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Drange, P.G., Dregi, M.S., van\u00a0\u2019t Hof, P.: On the computational complexity of vertex integrity and component order connectivity. Algorithmica 76, 1181\u20131202 (2016)","DOI":"10.1007\/s00453-016-0127-x"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Dvor\u00e1k, P., Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: Solving integer linear programs with a small number of global variables and constraints. In: Proceedings of IJCAI 2017, pp. 607\u2013613 (2017)","DOI":"10.24963\/ijcai.2017\/85"},{"key":"16_CR10","unstructured":"Feldmann, A.E., Lampis, M.: Parameterized algorithms for steiner forest in bounded width graphs. In: Proceedings of ICALP 2024. LIPIcs (2024, to appear)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.dam.2018.03.074","volume":"247","author":"S Fujita","year":"2018","unstructured":"Fujita, S., Furuya, M.: Safe number and integrity of graphs. Discret. Appl. Math. 247, 398\u2013406 (2018)","journal-title":"Discret. Appl. Math."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2016.07.020","volume":"215","author":"S Fujita","year":"2016","unstructured":"Fujita, S., MacGillivray, G., Sakuma, T.: Safe set problem on graphs. Discret. Appl. Math. 215, 106\u2013111 (2016)","journal-title":"Discret. Appl. Math."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2022.03.021","volume":"918","author":"T Gima","year":"2022","unstructured":"Gima, T., Hanaka, T., Kiyomi, M., Kobayashi, Y., Otachi, Y.: Exploring the gap between treedepth and vertex cover through vertex integrity. Theoret. Comput. Sci. 918, 60\u201376 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.dam.2013.10.010","volume":"166","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Paulusma, D.: List coloring in the absence of two subgraphs. Discret. Appl. Math. 166, 123\u2013130 (2014)","journal-title":"Discret. Appl. Math."},{"key":"16_CR15","unstructured":"Johnson, M., Martin, B., Oostveen, J.J., Pandey, S., Paulusma, D., Smith, S., van Leeuwen, E.J.: Complexity framework for forbidden subgraphs I: the framework. CoRR abs\/2211.12887 (2022)"},{"key":"16_CR16","unstructured":"Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S., van Leeuwen, E.J.: Edge multiway cut and node multiway cut are hard for planar subcubic graphs. In: Proceedings of SWAT 2024. LIPIcs, vol. 294, pp. 29:1\u201329:17 (2024)"},{"key":"16_CR17","unstructured":"Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S., van Leeuwen, E.J.: Complexity framework for forbidden subgraphs III: when problems are polynomial on subcubic graphs. In: Proceedings of MFCS 2023, LIPIcs, vol. 272, pp. 57:1\u201357:15 (2023)"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2012.02.036","volume":"438","author":"M Kami\u0144ski","year":"2012","unstructured":"Kami\u0144ski, M.: Max-cut and containment relations in graphs. Theoret. Comput. Sci. 438, 89\u201395 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR19","unstructured":"Martin, B., Pandey, S., Paulusma, D., Siggers, M., Smith, S., van Leeuwen, E.J.: Complexity framework for forbidden subgraphs II: when hardness is not preserved under edge subdivision. CoRR abs\/2211.14214 (2022)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:12:40Z","timestamp":1718975560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}