{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:20Z","timestamp":1758586220316,"version":"3.44.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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-04700-7_9","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:46Z","timestamp":1758498346000},"page":"109-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding d-Cuts in\u00a0Probe H-Free Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9515-6945","authenticated-orcid":false,"given":"Konrad K.","family":"Dabrowski","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-0002-7295-2663","authenticated-orcid":false,"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2383-1339","authenticated-orcid":false,"given":"Giacomo","family":"Paesani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"9_CR1","unstructured":"Ahn, J., Eagling-Vose, T., Lucke, F., Paulusma, D., Smith, S.: Finding $$d$$-cuts in claw-free graphs. In: Proceedings of ISAAC 2025. LIPIcs (to appear)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1016\/j.dam.2011.07.021","volume":"160","author":"J Ara\u00fajo","year":"2012","unstructured":"Ara\u00fajo, J., Cohen, N., Giroire, F., Havet, F.: Good edge-labelling of graphs. Discret. Appl. Math. 160, 2502\u20132513 (2012)","journal-title":"Discret. Appl. Math."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/050637091","volume":"21","author":"A Berry","year":"2007","unstructured":"Berry, A., Golumbic, M.C., Lipshteyn, M.: Recognizing chordal probe graphs and cycle-bicolorable graphs. SIAM J. Discret. Math. 21, 573\u2013591 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/jgt.20390","volume":"62","author":"PS Bonsma","year":"2009","unstructured":"Bonsma, P.S.: The complexity of the Matching-Cut problem for planar graphs and other graph classes. J. Graph Theory 62, 109\u2013126 (2009)","journal-title":"J. Graph Theory"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Brettell, N., Oostveen, J.J., Pandey, S., Paulusma, D., Rauch, J., van Leeuwen, E.J.: Computing subset vertex covers in $$H$$-free graphs. Theor. Comput. Sci. 1032, 115088 (2025)","DOI":"10.1016\/j.tcs.2025.115088"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1016\/j.dam.2008.08.017","volume":"157","author":"DB Chandler","year":"2009","unstructured":"Chandler, D.B., Chang, M., Kloks, T., Liu, J., Peng, S.: On probe permutation graphs. Discret. Appl. Math. 157, 2611\u20132619 (2009)","journal-title":"Discret. Appl. Math."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/11533719_82","volume-title":"Computing and Combinatorics","author":"M-S Chang","year":"2005","unstructured":"Chang, M.-S., Kloks, T., Kratsch, D., Liu, J., Peng, S.-L.: On the recognition of probe graphs of some self-complementary classes of perfect graphs. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 808\u2013817. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11533719_82"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Recognizing decomposable graphs. J. Graph Theory 8, 51\u201353 (1984)","journal-title":"J. Graph Theory"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230120404","volume":"12","author":"AM Farley","year":"1982","unstructured":"Farley, A.M., Proskurowski, A.: Networks immune to isolated line failures. Networks 12, 393\u2013403 (1982)","journal-title":"Networks"},{"key":"9_CR10","unstructured":"Feghali, C., Lucke, F., Paulusma, D., Ries, B.: Matching cuts in graphs of high girth and $$H$$-free graphs. In: Proceedings of the\u00a0ISAAC 2023. LIPIcs, vol. 283, pp. 28:1\u201328:16 (2023)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2012.06.039","volume":"457","author":"PA Golovach","year":"2012","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: Computing vertex-surjective homomorphisms to partially reflexive trees. Theoret. Comput. Sci. 457, 86\u2013100 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.dam.2003.12.009","volume":"143","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C., Lipshteyn, M.: Chordal probe graphs. Discret. Appl. Math. 143, 221\u2013237 (2004)","journal-title":"Discret. Appl. Math."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10479-009-0584-6","volume":"188","author":"MC Golumbic","year":"2011","unstructured":"Golumbic, M.C., Maffray, F., Morel, G.: A characterization of chain probe graphs. Ann. Oper. Res. 188, 175\u2013183 (2011)","journal-title":"Ann. Oper. Res."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1007\/s00453-021-00798-8","volume":"83","author":"G Gomes","year":"2021","unstructured":"Gomes, G., Sau, I.: Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. Algorithmica 83, 1677\u20131706 (2021)","journal-title":"Algorithmica"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1111\/j.1749-6632.1970.tb56468.x","volume":"175","author":"RL Graham","year":"1970","unstructured":"Graham, R.L.: On primitive graphs and optimal vertex assignments. Ann. N. Y. Acad. Sci. 175, 170\u2013186 (1970)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"9_CR16","first-page":"128","volume":"5","author":"P Heggernes","year":"1998","unstructured":"Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput. 5, 128\u2013142 (1998)","journal-title":"Nordic J. Comput."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Le, H., Le, V.B.: Complexity results for matching cut problems in graphs without long induced paths. In: Proceedings of the\u00a0WG 2023. LNCS, vol. 14093, pp. 417\u2013431 (2023)","DOI":"10.1007\/978-3-031-43380-1_30"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2022.07.035","volume":"931","author":"VB Le","year":"2022","unstructured":"Le, V.B., Telle, J.A.: The Perfect Matching Cut problem revisited. Theoret. Comput. Sci. 931, 117\u2013130 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Lucke, F., Marchand, J., Olbrich, J.: Finding minimum matching cuts in $$H$$-free graphs and graphs of bounded radius and diameter. CoRR abs\/2502.18942 (2025)","DOI":"10.1016\/j.tcs.2025.115429"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Lucke, F., Momeni, A., Paulusma, D., Smith, S.: Finding $$d$$-cuts in graphs of bounded diameter, graphs of bounded radius and $${H}$$-free graphs. In: Proceedings of the WG 2024. LNCS, vol. 14760, pp. 415\u2013429 (2025)","DOI":"10.1007\/978-3-031-75409-8_29"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2022.09.014","volume":"936","author":"F Lucke","year":"2022","unstructured":"Lucke, F., Paulusma, D., Ries, B.: On the complexity of Matching Cut for graphs of bounded radius and $${H}$$-free graphs. Theoret. Comput. Sci. 936, 33\u201342 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1007\/s00453-023-01137-9","volume":"85","author":"F Lucke","year":"2023","unstructured":"Lucke, F., Paulusma, D., Ries, B.: Finding matching cuts in $${H}$$-free graphs. Algorithmica 85, 3290\u20133322 (2023)","journal-title":"Algorithmica"},{"key":"9_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114795","volume":"1017","author":"F Lucke","year":"2024","unstructured":"Lucke, F., Paulusma, D., Ries, B.: Dichotomies for Maximum Matching Cut: $${H}$$-freeness, bounded diameter, bounded radius. Theoret. Comput. Sci. 1017, 114795 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1002\/jgt.3190130502","volume":"13","author":"AM Moshi","year":"1989","unstructured":"Moshi, A.M.: Matching cutsets in graphs. J. Graph Theory 13, 527\u2013536 (1989)","journal-title":"J. Graph Theory"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-45477-2_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Patrignani","year":"2001","unstructured":"Patrignani, M., Pizzonia, M.: The complexity of the Matching-Cut problem. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 284\u2013295. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45477-2_26"},{"key":"9_CR26","unstructured":"Paulusma, D., Rauch, J., van Leeuwen, E.J.: Colouring probe H-free graphs. CoRR abs\/2505.20784 (2025)"},{"key":"9_CR27","first-page":"309","volume":"10","author":"P Zhang","year":"1994","unstructured":"Zhang, P., et al.: An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA. Comput. Appl. Biosci. 10, 309\u2013317 (1994)","journal-title":"Comput. Appl. Biosci."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:48Z","timestamp":1758498348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}