{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:39Z","timestamp":1770921399977,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","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-3-032-17801-5_33","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:07Z","timestamp":1770918787000},"page":"447-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantified Colouring and\u00a0H-Free Algorithmics"],"prefix":"10.1007","author":[{"given":"Kristina","family":"Asimi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0346-7032","authenticated-orcid":false,"given":"Tala","family":"Eagling-Vose","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0312-9654","authenticated-orcid":false,"given":"Santiago","family":"Guzm\u00e1n-Pro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4642-8614","authenticated-orcid":false,"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Yiming","family":"Qiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"G Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3, G., Tuza, Z.S.: Dominating Cliques in $${P}_5$$-free Graphs. Period. Math. Hung. 21, 303\u2013308 (1990)","journal-title":"Period. Math. Hung."},{"issue":"9","key":"33_CR2","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1016\/j.ic.2009.05.003","volume":"207","author":"F B\u00f6rner","year":"2009","unstructured":"B\u00f6rner, F., Bulatov, A.A., Chen, H., Jeavons, P., Krokhin, A.A.: The complexity of constraint satisfaction games and QCSP. Inf. Comput. 207(9), 923\u2013944 (2009)","journal-title":"Inf. Comput."},{"issue":"1","key":"33_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2011.10.005","volume":"414","author":"H Broersma","year":"2012","unstructured":"Broersma, H., Golovach, P.A., Paulusma, D., Song, J.: Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoret. Comput. Sci. 414(1), 9\u201319 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37(2), 194\u2013197 (1941)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"33_CR5","unstructured":"Chen, H.: Quantified constraint satisfaction and bounded treewidth. In: de\u00a0M\u00e1ntaras, R.L., Saitta, L. (eds.) Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI 2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, 22\u201327 August 2004, pp. 161\u2013165. IOS Press (2004)"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Eagling-Vose, T., Martin, B., Paulusma, D., Smith, S.: Graph homomorphism, monotone classes and bounded pathwidth. In: 20th Conference on Computability in Europe, CiE 2016, Amsterdam, Netherlands, 8\u201312 July 2024, Proceedings (2024)","DOI":"10.1007\/978-3-031-64309-5_19"},{"issue":"3","key":"33_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"33_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/jgt.22028","volume":"84","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of coloring graphs with forbidden subgraphs. J. Graph Theory 84(4), 331\u2013363 (2017)","journal-title":"J. Graph Theory"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.ejc.2015.06.005","volume":"51","author":"S Huang","year":"2016","unstructured":"Huang, S.: Improved complexity results on k-coloring $$P_t$$-free graphs. Eur. J. Comb. 51, 336\u2013346 (2016)","journal-title":"Eur. J. Comb."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, M., et al.: Complexity framework for forbidden subgraphs I: the framework. Algorithmica 87(3), 429\u2013464 (2025)","DOI":"10.1007\/s00453-024-01289-2"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Randerath, B., Schiermeyer, I.: On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389(1-2), 330\u2013335 (2007)","DOI":"10.1016\/j.tcs.2007.09.009"},{"key":"33_CR12","unstructured":"Martin, B., Madelaine, F.R.: Towards a trichotomy for quantified H-coloring. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, volume 3988 of Lecture Notes in Computer Science, pp. 342\u2013352. Springer (2006)"},{"issue":"2","key":"33_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/49097.49099","volume":"19","author":"BME Moret","year":"1988","unstructured":"Moret, B.M.E.: Planar NAE3SAT is in P. SIGACT News 19(2), 51\u201354 (1988)","journal-title":"SIGACT News"},{"key":"33_CR14","unstructured":"Christos, H.: Papadimitriou. Computational Complexity. Addison-Wesley (1994)"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M., Pilipczuk, M., Rz\u0105\u017cewski, P.: Quasi-polynomial-time algorithm for independent set in P$$_{t}$$-free graphs via shrinking the space of induced paths. In: Le, H.V., King, V. (eds.) 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, 11\u201312 January 2021, pp. 204\u2013209. SIAM (2021)","DOI":"10.1137\/1.9781611976472.23"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. excluding a planar graph. J. Comb. Theory B 41(1), 92\u2013114 (1986)","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Spirkl, S., Chudnovsky, M., Zhong, M.: Four-coloring $$P_6$$-free graphs. In: Chan, T.M. (ed.) Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, 6\u20139 January 2019, pp. 1239\u20131256. SIAM (2019)","DOI":"10.1137\/1.9781611975482.76"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Zhuk, D., Martin, B.: QCSP monsters and the demise of the Chen conjecture. J. ACM 69(5), 35:1\u201335:44 (2022)","DOI":"10.1145\/3563820"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:11Z","timestamp":1770918791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_33","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":"13 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":"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":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}