{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:26Z","timestamp":1759638266576,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031185298"},{"type":"electronic","value":"9783031185304"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18530-4_7","type":"book-chapter","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:02:30Z","timestamp":1668985350000},"page":"89-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Few Induced Disjoint Paths for\u00a0H-Free Graphs"],"prefix":"10.1007","author":[{"given":"Barnaby","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siani","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(02)00290-1","volume":"135","author":"VE Alekseev","year":"2004","unstructured":"Alekseev, V.E.: Polynomial algorithm for finding the largest independent sets in graphs without forks. Discrete Appl. Math. 135, 3\u201316 (2004)","journal-title":"Discrete Appl. Math."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Belmonte, R., Golovach, P.A., Heggernes, P., van\u2019t Hof, P., Kaminski, M., Paulusma, D.: Detecting fixed patterns in chordal graphs in polynomial time. Algorithmica 69, 501\u2013521 (2014). https:\/\/doi.org\/10.1007\/s00453-013-9748-5","DOI":"10.1007\/s00453-013-9748-5"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0012-365X(91)90098-M","volume":"90","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D.: On the complexity of testing for odd holes and induced odd paths. Discrete Math. 90, 85\u201392 (1991)","journal-title":"Discrete Math."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Fellows, M.R.: The Robertson-Seymour theorems: a survey of applications. In: Proceedings of AMS-IMS-SIAM Joint Summer Research Conference (1989). Contemp. Math. 89, 1\u201318","DOI":"10.1090\/conm\/089\/1006472"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s00453-010-9468-z","volume":"62","author":"J Fiala","year":"2012","unstructured":"Fiala, J., Kami\u0144ski, M., Lidick\u00fd, B., Paulusma, D.: The $$k$$-in-a-path problem for claw-free graphs. Algorithmica 62, 499\u2013519 (2012). https:\/\/doi.org\/10.1007\/s00453-010-9468-z","journal-title":"Algorithmica"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/140963200","volume":"29","author":"PA Golovach","year":"2015","unstructured":"Golovach, P.A., Paulusma, D., van Leeuwen, E.J.: Induced disjoint paths in claw-free graphs. SIAM J. Discrete Math. 29, 348\u2013375 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2016.06.003","volume":"640","author":"PA Golovach","year":"2016","unstructured":"Golovach, P.A., Paulusma, D., van Leeuwen, E.J.: Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. 640, 70\u201383 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.jcss.2021.10.003","volume":"124","author":"PA Golovach","year":"2022","unstructured":"Golovach, P.A., Paulusma, D., van Leeuwen, E.J.: Induced disjoint paths in AT-free graphs. J. Comput. Syst. Sci. 124, 170\u2013191 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.dam.2019.06.026","volume":"278","author":"L Jaffke","year":"2020","unstructured":"Jaffke, L., Kwon, O., Telle, J.A.: Mim-width I. induced path problems. Discrete Appl. Math. 278, 153\u2013168 (2020)","journal-title":"Discrete Appl. Math."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.jcss.2011.10.004","volume":"78","author":"K Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K., Kobayashi, Y.: A linear time algorithm for the induced disjoint paths problem in planar graphs. J. Comput. Syst. Sci. 78, 670\u2013680 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2021.10.019","volume":"898","author":"W Kern","year":"2022","unstructured":"Kern, W., Martin, B., Paulusma, D., Smith, S., van Leeuwen, E.J.: Disjoint paths and connected subgraphs for $$H$$-free graphs. Theor. Comput. Sci. 898, 59\u201368 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Kawarabayashi, K.: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. In: Proceedings of the SODA 2009, pp. 1146\u20131155 (2009)","DOI":"10.1137\/1.9781611973068.124"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"3540","DOI":"10.1016\/j.dam.2009.02.015","volume":"157","author":"B L\u00e9v\u00eaque","year":"2009","unstructured":"L\u00e9v\u00eaque, B., Lin, D.Y., Maffray, F., Trotignon, N.: Detecting induced subgraphs. Discrete Appl. Math. 157, 3540\u20133551 (2009)","journal-title":"Discrete Appl. Math."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1061425.1061430","volume":"5","author":"J Lynch","year":"1975","unstructured":"Lynch, J.: The equivalence of theorem proving and the interconnection problem. SIGDA Newslett. 5, 31\u201336 (1975)","journal-title":"SIGDA Newslett."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-031-15914-5_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Martin","year":"2022","unstructured":"Martin, B., Paulusma, D., Smith, S., van Leeuwen, E.J.: Induced disjoint paths and connected subgraphs for $${H}$$-free graphs. In: Bekos, M.A., Kaufmann, M. (eds.) WG 2022. LNCS, vol. 13453, pp. 398\u2013411. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_29"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Radovanovi\u0107, M., Trotignon, N., Vus\u0306kovi\u0107, K.: The (theta, wheel)-free graphs Part IV: induced paths and cycles. J. Comb. Theory Ser. B 146, 495\u2013531 (2021)","DOI":"10.1016\/j.jctb.2020.06.002"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63, 65\u2013110 (1995)","DOI":"10.1006\/jctb.1995.1006"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N Shibi","year":"1980","unstructured":"Shibi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Math. 29, 53\u201376 (1980)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18530-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:03:00Z","timestamp":1668985380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18530-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031185298","9783031185304"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18530-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isco2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}