{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:25:08Z","timestamp":1768447508823,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031630200","type":"print"},{"value":"9783031630217","type":"electronic"}],"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_12","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"151-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Detecting $$K_{2,3}$$ as\u00a0an\u00a0Induced Minor"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9522-3770","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Dallard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ma\u00ebl","family":"Dumas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0826-0001","authenticated-orcid":false,"given":"Claire","family":"Hilaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8222-8097","authenticated-orcid":false,"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Perez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1978-0687","authenticated-orcid":false,"given":"Nicolas","family":"Trotignon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"12_CR1","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"JRS Blair","year":"1993","unstructured":"Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation. The IMA Volumes in Mathematics and its Applications, vol. 56, pp. 1\u201329. Springer, New York (1993). https:\/\/doi.org\/10.1007\/978-1-4613-8369-7_1"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","volume":"25","author":"M Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Cornu\u00e9jols, G., Liu, X., Seymour, P., Vu\u0161kovi\u0107, K.: Recognizing Berge graphs. Combinatorica 25(2), 143\u2013186 (2005). https:\/\/doi.org\/10.1007\/s00493-005-0012-8","journal-title":"Combinatorica"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/JGT.20631","volume":"71","author":"M Chudnovsky","year":"2012","unstructured":"Chudnovsky, M., Penev, I., Scott, A., Trotignon, N.: Excluding induced subdivisions of the bull and related graphs. J. Graph Theory 71(1), 49\u201368 (2012). https:\/\/doi.org\/10.1002\/JGT.20631","journal-title":"J. Graph Theory"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00493-010-2334-4","volume":"30","author":"M Chudnovsky","year":"2010","unstructured":"Chudnovsky, M., Seymour, P.: The three-in-a-tree problem. Combinatorica 30(4), 387\u2013417 (2010). https:\/\/doi.org\/10.1007\/s00493-010-2334-4","journal-title":"Combinatorica"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Dallard, C., Milani\u010d, M., \u0160torgel, K.: Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. J. Comb. Theory Ser. B 167, 338\u2013391 (2024). https:\/\/doi.org\/10.1016\/j.jctb.2024.03.005","DOI":"10.1016\/j.jctb.2024.03.005"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jctb.2017.12.004","volume":"143","author":"E Diot","year":"2020","unstructured":"Diot, E., Radovanovi\u0107, M., Trotignon, N., Vu\u0161kovi\u0107, K.: The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs. J. Combin. Theory Ser. B 143, 123\u2013147 (2020). https:\/\/doi.org\/10.1016\/j.jctb.2017.12.004","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.2298\/AADM131128023D","volume":"8","author":"E Diot","year":"2014","unstructured":"Diot, E., Tavenas, S., Trotignon, N.: Detecting wheels. Appl. Anal. Discrete Math. 8(1), 111\u2013122 (2014). https:\/\/doi.org\/10.2298\/AADM131128023D","journal-title":"Appl. Anal. Discrete Math."},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BF01190507","volume":"13","author":"MR Fellows","year":"1995","unstructured":"Fellows, M.R., Kratochv\u00edl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13(3), 266\u2013282 (1995). https:\/\/doi.org\/10.1007\/BF01190507","journal-title":"Algorithmica"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"MR Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discret. Methods 1(2), 216\u2013227 (1980). https:\/\/doi.org\/10.1137\/0601025","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"12_CR10","unstructured":"Hartinger, T.R.: New Characterizations in Structural Graph Theory: $$1$$-Perfectly Orientable Graphs, Graph Products, and the Price of Connectivity. Ph.D. thesis, University of Primorska (2017). https:\/\/www.famnit.upr.si\/sl\/studij\/zakljucna_dela\/download\/532"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1002\/jgt.22067","volume":"85","author":"TR Hartinger","year":"2017","unstructured":"Hartinger, T.R., Milani\u010d, M.: Partial characterizations of 1-perfectly orientable graphs. J. Graph Theory 85(2), 378\u2013394 (2017). https:\/\/doi.org\/10.1002\/jgt.22067","journal-title":"J. Graph Theory"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/s00453-012-9671-1","volume":"68","author":"F Kammer","year":"2014","unstructured":"Kammer, F., Tholey, T.: Approximation algorithms for intersection graphs. Algorithmica 68(2), 312\u2013336 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9671-1","journal-title":"Algorithmica"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Korhonen, T., Lokshtanov, D.: Induced-minor-free graphs: Separator theorem, subexponential algorithms, and improved hardness of recognition. In: Woodruff, D.P. (ed.) Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, 7\u201310 January 2024, pp. 5249\u20135275. SIAM (2024). https:\/\/doi.org\/10.1137\/1.9781611977912.188","DOI":"10.1137\/1.9781611977912.188"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Lai, K.Y., Lu, H.I., Thorup, M.: Three-in-a-tree in near linear time. In: STOC 2020\u2014Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1279\u20131292. ACM, New York (2020). https:\/\/doi.org\/10.1145\/3357713.3384235","DOI":"10.1145\/3357713.3384235"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Lov\u00e1sz, L.: A characterization of perfect graphs. J. Comb. Theory Ser. B 13, 95\u201398 (1972). https:\/\/doi.org\/10.1016\/0095-8956(72)90045-7","DOI":"10.1016\/0095-8956(72)90045-7"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2, 253\u2013267 (1972). https:\/\/doi.org\/10.1016\/0012-365X(72)90006-4","journal-title":"Discrete Math."},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0895480104442522","volume":"19","author":"F Maffray","year":"2005","unstructured":"Maffray, F., Trotignon, N.: Algorithms for perfectly contractile graphs. SIAM J. Discrete Math. 19(3), 553\u2013574 (2005). https:\/\/doi.org\/10.1137\/S0895480104442522","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Milani\u010d, M., Penev, I., Piva\u010d, N., Vu\u0161kovi\u0107, K.: Bisimplicial separators. J. Graph Theory (2024, to appear). https:\/\/doi.org\/10.1002\/jgt.23098","DOI":"10.1002\/jgt.23098"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.jctb.2019.07.004","volume":"143","author":"M Radovanovi\u0107","year":"2020","unstructured":"Radovanovi\u0107, M., Trotignon, N., Vu\u0161kovi\u0107, K.: The (theta, wheel)-free graphs Part II: structure theorem. J. Combin. Theory Ser. B 143, 148\u2013184 (2020). https:\/\/doi.org\/10.1016\/j.jctb.2019.07.004","journal-title":"J. Combin. Theory Ser. B"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:11:08Z","timestamp":1718975468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}