{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:26:55Z","timestamp":1774333615945,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":25,"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_12","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:07Z","timestamp":1770977227000},"page":"172-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding a\u00a0Maximum Common (Induced) Subgraph: Structural Parameters Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6943-856X","authenticated-orcid":false,"given":"Tesshu","family":"Hanaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1156-0383","authenticated-orcid":false,"given":"Yuto","family":"Okada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-853X","authenticated-orcid":false,"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3113-9205","authenticated-orcid":false,"given":"Lena","family":"Volk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/J.IPL.2013.11.007","volume":"114","author":"FN Abu-Khzam","year":"2014","unstructured":"Abu-Khzam, F.N.: Maximum common induced subgraph parameterized by vertex cover. Inf. Process. Lett. 114(3), 99\u2013103 (2014). https:\/\/doi.org\/10.1016\/J.IPL.2013.11.007","journal-title":"Inf. Process. Lett."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/J.TCS.2017.07.010","volume":"697","author":"FN Abu-Khzam","year":"2017","unstructured":"Abu-Khzam, F.N., Bonnet, \u00c9., Sikora, F.: On the complexity of various parameterizations of common induced subgraph isomorphism. Theor. Comput. Sci. 697, 69\u201378 (2017). https:\/\/doi.org\/10.1016\/J.TCS.2017.07.010","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/S10458-025-09711-X","volume":"39","author":"HL Bodlaender","year":"2025","unstructured":"Bodlaender, H.L., Hanaka, T., Jaffke, L., Ono, H., Otachi, Y., van der Zanden, T.C.: Hedonic seat arrangement problems. Auton. Agents Multi Agent Syst. 39(2), 33 (2025). https:\/\/doi.org\/10.1007\/S10458-025-09711-X","journal-title":"Auton. Agents Multi Agent Syst."},{"issue":"12","key":"12_CR4","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(12), 3566\u20133587 (2020). https:\/\/doi.org\/10.1007\/S00453-020-00737-Z","journal-title":"Algorithmica"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Damaschke, P.: Induced subgraph isomorphism for cographs in NP-complete. In: WG 1990. Lecture Notes in Computer Science, vol.\u00a0484, pp. 72\u201378 (1990). https:\/\/doi.org\/10.1007\/3-540-53832-1_32","DOI":"10.1007\/3-540-53832-1_32"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"4","key":"12_CR8","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). https:\/\/doi.org\/10.1007\/S00224-009-9167-9","journal-title":"Theory Comput. Syst."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294\u2013305. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_28"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: STOC 1983, pp. 448\u2013456 (1983). https:\/\/doi.org\/10.1145\/800061.808776","DOI":"10.1145\/800061.808776"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Ganian, R.: Improving vertex cover as a graph parameter. Discret. Math. Theor. Comput. Sci. 17(2), 77\u2013100 (2015). https:\/\/doi.org\/10.46298\/DMTCS.2136","DOI":"10.46298\/DMTCS.2136"},{"key":"12_CR12","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"12_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. Theor. Comput. Sci. 918, 60\u201376 (2022). https:\/\/doi.org\/10.1016\/J.TCS.2022.03.021","journal-title":"Theor. Comput. Sci."},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Heggernes, P., van\u00a0\u2019t Hof, P., Meister, D., Villanger, Y.: Induced subgraph isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562, 252\u2013269 (2015). https:\/\/doi.org\/10.1016\/J.TCS.2014.10.002","DOI":"10.1016\/J.TCS.2014.10.002"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196\u2013217 (2010). https:\/\/doi.org\/10.1007\/s00224-008-9150-x","journal-title":"Theory Comput. Syst."},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Jansen, B.M.P., Marx, D.: Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and turing kernels. In: SODA 2015, pp. 616\u2013629 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.42","DOI":"10.1137\/1.9781611973730.42"},{"issue":"21","key":"12_CR17","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1016\/J.DISC.2012.07.010","volume":"312","author":"S Kijima","year":"2012","unstructured":"Kijima, S., Otachi, Y., Saitoh, T., Uno, T.: Subgraph isomorphism in graph classes. Discret. Math. 312(21), 3164\u20133173 (2012). https:\/\/doi.org\/10.1016\/J.DISC.2012.07.010","journal-title":"Discret. Math."},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"DJ Kleitman","year":"1991","unstructured":"Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J. Discret. Math. 4(1), 99\u2013106 (1991). https:\/\/doi.org\/10.1137\/0404010","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"12_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). https:\/\/doi.org\/10.1007\/s00453-011-9554-x","journal-title":"Algorithmica"},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/MOOR.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/MOOR.8.4.538","journal-title":"Math. Oper. Res."},{"key":"12_CR21","unstructured":"Lokshtanov, D.: Parameterized integer quadratic programming: variables and coefficients. CoRR abs\/1511.00310 (2015)"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Marx, D., Pilipczuk, M.: Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). In: STACS 2014. LIPIcs, vol.\u00a025, pp. 542\u2013553. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2014). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2014.542","DOI":"10.4230\/LIPICS.STACS.2014.542"},{"key":"12_CR23","unstructured":"Sorge, M., Weller, M.: The graph parameter hierarchy (2019). https:\/\/manyu.pro\/assets\/parameter-hierarchy.pdf"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/J.EJC.2017.07.018","volume":"68","author":"M Zehavi","year":"2018","unstructured":"Zehavi, M.: The $$k$$-leaf spanning tree problem admits a klam value of 39. Eur. J. Comb. 68, 175\u2013203 (2018). https:\/\/doi.org\/10.1016\/J.EJC.2017.07.018","journal-title":"Eur. J. Comb."},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Zemmer, K.: Integer polynomial optimization in fixed dimension. Ph.D. thesis, ETH Zurich (2017). https:\/\/doi.org\/10.3929\/ethz-b-000241796","DOI":"10.3929\/ethz-b-000241796"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:06:53Z","timestamp":1774325213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_12","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":"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"}}]}}