{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:59:56Z","timestamp":1743148796252,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_15","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"187-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Subset Transversals in H-Free Graphs"],"prefix":"10.1007","author":[{"given":"Nick","family":"Brettell","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Giacomo","family":"Paesani","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Abrishami, T., Chudnovsky, M., Pilipczuk, M., Rz\u0105\u017cewski, P., Seymour, P.: Induced subgraphs of bounded treewidth and the container method. CoRR, abs\/2003.05185 (2020)","DOI":"10.1137\/1.9781611976465.116"},{"key":"15_CR2","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. In: Adler, I., M\u00fcller, H. (eds.) WG 2020. LNCS, vol. 12301, pp. 388\u2013400. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-60440-0_31"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1007\/s00453-018-0474-x","volume":"81","author":"M Bonamy","year":"2019","unstructured":"Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M., Paulusma, D.: Independent feedback vertex set for $$P_5$$-free graphs. Algorithmica 81, 1342\u20131369 (2019)","journal-title":"Algorithmica"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0028791","volume-title":"Fundamentals of Computation Theory","author":"A Brandst\u00e4dt","year":"1985","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the restriction of some NP-complete graph problems to permutation graphs. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 53\u201362. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/BFb0028791"},{"key":"15_CR5","unstructured":"Brettell, N., Horsfield, J., Munaro, A., Paesani, G., Paulusma, D.: Bounding the mim-width of hereditary graph classes. CoRR, abs\/2004.05018 (2020)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2017.09.033","volume":"705","author":"N Chiarelli","year":"2018","unstructured":"Chiarelli, N., Hartinger, T.R., Johnson, M., Milani\u010d, M., Paulusma, D.: Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Theoret. Comput. Sci. 705, 75\u201383 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.jcss.2017.04.003","volume":"88","author":"R Chitnis","year":"2017","unstructured":"Chitnis, R., Fomin, F.V., Lokshtanov, D., Misra, P., Ramanujan, M.S., Saurabh, S.: Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. 88, 195\u2013207 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1137\/110843071","volume":"27","author":"M Cygan","year":"2013","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Subset feedback vertex set is fixed-parameter tractable. SIAM J. Discrete Math. 27, 290\u2013309 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR9","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. To appear"},{"key":"15_CR10","unstructured":"Dabrowski, K.K., Johnson, M., Paesani, G., Paulusma, D., Zamaraev, V.: On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. In: Proceedings of the MFCS 2018. LIPIcs, vol. 117, pp. 63:1\u201363:15 (2018)"},{"key":"15_CR11","first-page":"311","volume":"19","author":"S F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. Congressus Numerantium 19, 311\u2013315 (1977)","journal-title":"Congressus Numerantium"},{"key":"15_CR12","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)","journal-title":"Algorithmica"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.jda.2013.09.005","volume":"26","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Saei, R.: Subset feedback vertex sets in chordal graphs. J. Discrete Algorithms 26, 7\u201315 (2014)","journal-title":"J. Discrete Algorithms"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Grzesik, A., Klimo\u0161ov\u00e1, T., Pilipczuk, M., Pilipczuk, M.: Polynomial-time algorithm for maximum weight independent set on $$P_6$$-free graphs. In: Proceedings of the SODA 2019, pp. 1257\u20131271 (2019)","DOI":"10.1137\/1.9781611975482.77"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00224-017-9805-6","volume":"62","author":"EC Hols","year":"2018","unstructured":"Hols, E.C., Kratsch, S.: A randomized polynomial kernel for subset feedback vertex set. Theory Comput. Syst. 62(1), 63\u201392 (2018)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1137\/140962838","volume":"45","author":"Y Iwata","year":"2016","unstructured":"Iwata, Y., Wahlstr\u00f6m, M., Yoshida, Y.: Half-integrality, LP-branching, and FPT algorithms. SIAM J. Comput. 45(4), 1377\u20131411 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s00453-019-00607-3","volume":"82","author":"L Jaffke","year":"2020","unstructured":"Jaffke, L., Kwon, O., Telle, J.A.: Mim-width II. The feedback vertex set problem. Algorithmica 82(1), 118\u2013145 (2020)","journal-title":"Algorithmica"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00453-019-00601-9","volume":"82","author":"M Johnson","year":"2020","unstructured":"Johnson, M., Paesani, G., Paulusma, D.: Connected vertex cover for $$(s{P}_1+{P}_5)$$-free graphs. Algorithmica 82, 20\u201340 (2020)","journal-title":"Algorithmica"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Kakimura, N., Kawarabayashi, K., Kobayashi, Y.: Erd\u0151s-P\u00f3sa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. In: Proceedings of the SODA 2012, pp. 1726\u20131736 (2012)","DOI":"10.1137\/1.9781611973099.137"},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1016\/j.jctb.2011.12.001","volume":"102","author":"K Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K., Kobayashi, Y.: Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory Ser. B 102(4), 1020\u20131034 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Representative sets and irrelevant vertices: new tools for kernelization. In: Proceedings of the FOCS 2012, pp. 450\u2013459 (2012)","DOI":"10.1109\/FOCS.2012.46"},{"issue":"3","key":"15_CR22","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. Discrete Math. 31(3), 1581\u20131615 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Vatshelle, M., Villanger, Y.: Independent set in $${P}_5$$-free graphs in polynomial time. In: Proceedings of the SODA 2014, pp. 570\u2013581 (2014)","DOI":"10.1137\/1.9781611973402.43"},{"issue":"3","key":"15_CR24","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"GJ Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B 28(3), 284\u2013304 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-34611-8_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Misra","year":"2012","unstructured":"Misra, P., Raman, V., Ramanujan, M.S., Saurabh, S.: Parameterized algorithms for Even Cycle Transversal. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 172\u2013183. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34611-8_19"},{"key":"15_CR26","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. Discrete Appl. Math. 258, 204\u2013221 (2019)","journal-title":"Discrete Appl. Math."},{"key":"15_CR27","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":"15_CR28","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Commentationes Math. Univ. Carol. 15, 307\u2013309 (1974)","journal-title":"Commentationes Math. Univ. Carol."},{"issue":"1","key":"15_CR29","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Math. 29(1), 53\u201376 (1980)","journal-title":"Discrete Math."},{"key":"15_CR30","unstructured":"Speckenmeyer, E.: Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen. Ph.D. thesis, Universit\u00e4t Paderborn (1983)"}],"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-030-60440-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:01:28Z","timestamp":1710266488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","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":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"34% - 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.7","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":"2.1","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}