{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T19:34:17Z","timestamp":1770492857552,"version":"3.49.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031159138","type":"print"},{"value":"9783031159145","type":"electronic"}],"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-15914-5_30","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"412-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Classifying Subset Feedback Vertex Set for\u00a0H-Free Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2383-1339","authenticated-orcid":false,"given":"Giacomo","family":"Paesani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"30_CR1","first-page":"1948","volume":"2021","author":"T Abrishami","year":"2021","unstructured":"Abrishami, T., Chudnovsky, M., Pilipczuk, M., Rz\u0105\u017cewski, P., Seymour, P.: Induced subgraphs of bounded treewidth and the container method. Proc. SODA 2021, 1948\u20131964 (2021)","journal-title":"Proc. SODA"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2013.01.011","volume":"511","author":"R Belmonte","year":"2013","unstructured":"Belmonte, R., Vatshelle, M.: Graph classes with structured neighborhoods and algorithmic applications. Theoret. Comput. Sci. 511, 54\u201365 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Bergougnoux, B., Papadopoulos, C., Telle, J.A.: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width. Proc. WG 2020, LNCS 12301, 388\u2013400 (2020)","DOI":"10.1007\/978-3-030-60440-0_31"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.tcs.2021.10.019","volume":"898","author":"N Brettell","year":"2022","unstructured":"Brettell, N., Johnson, M., Paesani, G., Paulusma, D.: Computing subset transversals in $${H}$$-free graphs. Theoret. Comput. Sci. 898, 59\u201368 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-83508-8_17","volume":"128","author":"N Brettell","year":"2022","unstructured":"Brettell, N., Johnson, M., Paulusma, D.: Computing weighted subset transversals in $${H}$$-free graphs. J. Comput. Syst. Sci. 128, 71\u201385 (2022). https:\/\/doi.org\/10.1007\/978-3-030-83508-8_17","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"2841","DOI":"10.1007\/s00453-020-00706-6","volume":"82","author":"KK Dabrowski","year":"2020","unstructured":"Dabrowski, K.K., Feghali, C., Johnson, M., Paesani, G., Paulusma, D., Rz\u0105\u017cewski, P.: On cycle transversals and their connected variants in the absence of a small linear forest. Algorithmica 82, 2841\u20132866 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00706-6","journal-title":"Algorithmica"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s00453-012-9731-6","volume":"69","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Heggernes, P., Kratsch, D., Papadopoulos, C., Villanger, Y.: Enumerating minimal subset feedback vertex sets. Algorithmica 69, 216\u2013231 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9731-6","journal-title":"Algorithmica"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Gartland, P., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Rz\u0105\u017cewski, P.: Finding large induced sparse subgraphs in $$C_{\\>t}$$-free graphs in quasipolynomial time. Proc. STOC, 2021, 330\u2013341 (2021)","DOI":"10.1145\/3406325.3451034"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1137\/15M1041213","volume":"31","author":"D Lokshtanov","year":"2017","unstructured":"Lokshtanov, D., Misra, P., Ramanujan, M.S., Saurabh, S.: Hitting selected (odd) cycles. SIAM J. Discret. Math. 31, 1581\u20131615 (2017)","journal-title":"SIAM J. Discret. Math."},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1016\/j.disc.2017.01.006","volume":"340","author":"A Munaro","year":"2017","unstructured":"Munaro, A.: On line graphs of subcubic triangle-free graphs. Discret. Math. 340, 1210\u20131226 (2017)","journal-title":"Discret. Math."},{"key":"30_CR11","unstructured":"Paesani, G., Paulusma, D., Rz\u0105\u017cewski, P.: Feedback vertex set and even cycle transversal for $$H$$-free graphs: finding large block graphs. SIAM Journal on Discrete Mathematics, to appear"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.dam.2018.11.017","volume":"258","author":"C Papadopoulos","year":"2019","unstructured":"Papadopoulos, C., Tzimas, S.: Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs. Discret. Appl. Math. 258, 204\u2013221 (2019)","journal-title":"Discret. Appl. Math."},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.tcs.2020.01.029","volume":"814","author":"C Papadopoulos","year":"2020","unstructured":"Papadopoulos, C., Tzimas, S.: Subset feedback vertex set on graphs of bounded independent set size. Theoret. Comput. Sci. 814, 177\u2013188 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR14","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Comment. Math. Univ. Carol. 15, 307\u2013309 (1974)","journal-title":"Comment. Math. Univ. Carol."},{"key":"30_CR15","unstructured":"Vatshelle, M.: New Width Parameters of Graphs. PhD thesis, University of Bergen (2012)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:19:27Z","timestamp":1664536767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"32","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":"33% - 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":"3","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":"12","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)"}}]}}