{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:04:46Z","timestamp":1757617486408,"version":"3.44.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826696"},{"type":"electronic","value":"9783031826702"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82670-2_2","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:39:43Z","timestamp":1738816783000},"page":"8-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Open Problems and\u00a0Recent Developments on\u00a0a\u00a0Complexity Framework for\u00a0Forbidden Subgraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5240-7257","authenticated-orcid":false,"given":"Erik Jan","family":"van Leeuwen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.tcs.2007.09.013","volume":"389","author":"VE Alekseev","year":"2007","unstructured":"Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. 389, 219\u2013236 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR2","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":"2_CR3","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. Algor. 12, 308\u2013340 (1991)","journal-title":"J. Algor."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial $$k$$-trees. Disc. Appl. Math. 23, 11\u201324 (1989)","journal-title":"Disc. Appl. Math."},{"key":"2_CR5","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":"2_CR6","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":"2_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D., Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a forest. J. Comb. Theory Ser. B 52, 274\u2013283 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209, 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR9","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. Theor. Comput. Sci. 867, 30\u201339 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR10","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.: Subgraph Isomorphism on graph classes that exclude a substructure. Algorithmica 82, 3566\u20133587 (2020)","journal-title":"Algorithmica"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., et al.: Complexity framework for forbidden subgraphs IV: the steiner forest problem. In: Proceedings of IWOCA 2024. LNCS, vol. 14764, pp. 206\u2013217. Springer, Heidelberg (2024). DOI: https:\/\/doi.org\/10.1007\/978-3-031-63021-7_16","DOI":"10.1007\/978-3-031-63021-7_16"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2013.01.009","volume":"511","author":"B Bui-Xuan","year":"2013","unstructured":"Bui-Xuan, B., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511, 66\u201376 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Bulteau, L., Dabrowski, K.K., K\u00f6hler, N., Ordyniak, S., Paulusma, D.: An algorithmic framework for locally constrained homomorphisms. In: Proceedings of WG 2022. LNCS, vol. 13453, pp. 114\u2013128. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_9","DOI":"10.1007\/978-3-031-15914-5_9"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85, 12\u201375 (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"2_CR15","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, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"2_CR16","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, Heidelberg (2015)"},{"key":"2_CR17","unstructured":"de Ridder, H.N., et al.: Information System on Graph Classes and their Inclusions (ISGCI) (2001\u20132024). https:\/\/www.graphclasses.org\/"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51, 292\u2013302 (2008)","journal-title":"Comput. J."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Drange, P.G., Dregi, M.S., van\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":"2_CR20","first-page":"607","volume":"2017","author":"P Dvor\u00e1k","year":"2017","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. Proc. IJCAI 2017, 607\u2013613 (2017)","journal-title":"Proc. IJCAI"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Eagling-Vose, T., Martin, B., Paulusma, D., Smith, S.: Graph homomorphism, monotone classes and bounded pathwidth. In: Proceedings of CiE 2024. LNCS, vol. 14773, pp. 233\u2013251 (2024). https:\/\/doi.org\/10.1007\/978-3-031-64309-5_19","DOI":"10.1007\/978-3-031-64309-5_19"},{"key":"2_CR22","unstructured":"Feldmann, A.E., Lampis, M.: Parameterized algorithms for steiner forest in bounded width graphs. In: Proceedings of ICALP 2024. LIPIcs, vol. 272, pp. 61:1\u201361:20 (2024)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Demaine, E.D., Hajiaghayi, M.T., Thilikos, D.M.: Bidimensionality. In: Encyclopedia of Algorithms, pp. 203\u2013207 (2016)","DOI":"10.1007\/978-1-4939-2864-4_47"},{"key":"2_CR24","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. Disc. Appl. Math. 247, 398\u2013406 (2018)","journal-title":"Disc. Appl. Math."},{"key":"2_CR25","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. Disc. Appl. Math. 215, 106\u2013111 (2016)","journal-title":"Disc. Appl. Math."},{"key":"2_CR26","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The Planar Hamiltonian Circuit problem is NP-complete. SIAM J. Comput. 5, 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.jda.2009.05.002","volume":"8","author":"E Gassner","year":"2010","unstructured":"Gassner, E.: The Steiner Forest problem revisited. J. Disc. Algor. 8, 154\u2013163 (2010)","journal-title":"J. Disc. Algor."},{"key":"2_CR29","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. Theor. Comput. Sci. 918, 60\u201376 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR30","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. Disc. Appl. Math. 166, 123\u2013130 (2014)","journal-title":"Disc. Appl. Math."},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.dam.2014.08.008","volume":"180","author":"PA Golovach","year":"2015","unstructured":"Golovach, P.A., Paulusma, D., Ries, B.: Coloring graphs characterized by a forbidden subgraph. Disc. Appl. Math. 180, 101\u2013110 (2015)","journal-title":"Disc. Appl. Math."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Hickingbotham, R.: Induced subgraphs and path decompositions. Electron. J. Comb. 30 (2023)","DOI":"10.37236\/11364"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Johnson, M., et al.: Complexity framework for forbidden subgraphs I: the framework. Algorithmica (2025)","DOI":"10.1007\/s00453-024-01289-2"},{"key":"2_CR34","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":"2_CR35","unstructured":"Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S., van Leeuwen, E.J.: Edge multiway cut and node multiway cut are NP-hard on subcubic graphs. In: Proceedings of SWAT 2024. LIPIcs, vol. 294, pp. 29:1\u201329:17 (2024)"},{"key":"2_CR36","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. Theor. Comput. Sci. 438, 89\u201395 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"3545","DOI":"10.1016\/j.tcs.2011.03.001","volume":"412","author":"N Korpelainen","year":"2011","unstructured":"Korpelainen, N., Lozin, V.V., Malyshev, D.S., Tiskin, A.: Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412, 3545\u20133554 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Lozin, V.: The Hamiltonian cycle problem and monotone classes. In: Proceedings of IWOCA 2024. LNCS, vol. 14764, pp. 460\u2013471. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-63021-7_35","DOI":"10.1007\/978-3-031-63021-7_35"},{"key":"2_CR39","unstructured":"Lozin, V., et al.: Complexity framework for forbidden subgraphs II: edge subdivision and the \u201cH\u201d-graphs. In: Proceedings of ISAAC 2024. LNCS (2024)"},{"key":"2_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103517","volume":"103","author":"V Lozin","year":"2022","unstructured":"Lozin, V., Razgon, I.: Tree-width dichotomy. Eur. J. Comb. 103, 103517 (2022)","journal-title":"Eur. J. Comb."},{"key":"2_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106213","volume":"174","author":"B Martin","year":"2022","unstructured":"Martin, B., Paulusma, D., Smith, S.: Hard problems that quickly become very easy. Inf. Process. Lett. 174, 106213 (2022)","journal-title":"Inf. Process. Lett."},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., de\u00a0Mendez, P.O.: Sparsity - Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol.\u00a028. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory Ser. B 35, 39\u201361 (1983)","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory Ser. B 41, 92\u2013114 (1986)","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"2_CR45","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Disc. Math. 72, 355\u2013360 (1988)","journal-title":"Disc. Math."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:39:40Z","timestamp":1757133580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}