{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:00Z","timestamp":1759638180864,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"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-06678-8_34","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"466-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing a\u00a0Minimum Subset Feedback Vertex Set on\u00a0Chordal Graphs Parameterized by\u00a0Leafage"],"prefix":"10.1007","author":[{"given":"Charis","family":"Papadopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spyridon","family":"Tzimas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","unstructured":"Benjamin, 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.) Graph-Theoretic Concepts in Computer Science, WG 2020. LNCS, vol. 12301, pp. 388\u2013400. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60440-0_31","DOI":"10.1007\/978-3-030-60440-0_31"},{"issue":"4","key":"34_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(86)90135-3","volume":"23","author":"AA Bertossi","year":"1986","unstructured":"Bertossi, A.A., Bonuccelli, M.A.: Hamiltonian circuits in interval graph generalizations. Inf. Process. Lett. 23(4), 195\u2013200 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"34_CR3","first-page":"14","volume":"7","author":"HL Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. Nord. J. Comput. 7(1), 14\u201331 (2000)","journal-title":"Nord. J. Comput."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Cham (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11, 191\u2013199 (1982)","journal-title":"SIAM J. Comput."},{"key":"34_CR6","doi-asserted-by":"publisher","unstructured":"Brettell, N., Johnson, M., Paesani, G., Paulusma, D.: Computing subset transversals in H-free graphs. In: Adler, I., M\u00fcller, H. (eds.) Graph-Theoretic Concepts in Computer Science, WG 2020. LNCS, vol. 12301, pp. 187\u2013199. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60440-0_15","DOI":"10.1007\/978-3-030-60440-0_15"},{"key":"34_CR7","doi-asserted-by":"publisher","unstructured":"Brettell, N., Johnson, M., Paulusma, D.: Computing weighted subset transversals in H-free graphs. In: Lubiw, A., Salavatipour, M. (eds.) Algorithms and Data Structures, WADS 2021. LNCS, vol. 12808, pp. 229\u2013242. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-83508-8_17","DOI":"10.1007\/978-3-030-83508-8_17"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P Buneman","year":"1974","unstructured":"Buneman, P.: A characterization of rigid circuit graphs. Discret. Math. 9, 205\u2013212 (1974)","journal-title":"Discret. Math."},{"key":"34_CR9","doi-asserted-by":"publisher","unstructured":"Chaplick, S.: Intersection graphs of non-crossing paths. In: Sau, I., Thilikos, D.M. (eds.) Graph-Theoretic Concepts in Computer Science, WG 2019. LNCS, vol. 11789, pp. 311\u2013324. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30786-8_24","DOI":"10.1007\/978-3-030-30786-8_24"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.dam.2012.12.006","volume":"168","author":"S Chaplick","year":"2014","unstructured":"Chaplick, S., Stacho, J.: The vertex leafage of chordal graphs. Discret. Appl. Math. 168, 14\u201325 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"34_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","volume":"22","author":"DG Corneil","year":"1988","unstructured":"Corneil, D.G., Fonlupt, J.: The complexity of generalized clique covering. Discret Appl. Math. 22(2), 109\u2013118 (1988)","journal-title":"Discret Appl. Math."},{"issue":"1","key":"34_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discret. Appl. Math. 9(1), 27\u201339 (1984)","journal-title":"Discret. Appl. Math."},{"key":"34_CR13","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"1","key":"34_CR14","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. Discret. Math. 27(1), 290\u2013309 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"34_CR15","unstructured":"Dietz, P.: Intersection graph algorithms. Ph.D. Thesis, Cornell University (1984)"},{"issue":"1","key":"34_CR16","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(1), 216\u2013231 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9731-6","journal-title":"Algorithmica"},{"issue":"9","key":"34_CR17","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.1007\/s00453-020-00692-9","volume":"82","author":"FV Fomin","year":"2020","unstructured":"Fomin, F.V., Golovach, P.A., Raymond, J.: On the tractability of optimization problems on h-graphs. Algorithmica 82(9), 2432\u20132473 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00692-9","journal-title":"Algorithmica"},{"key":"34_CR18","volume-title":"Computers and Intractability","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co, New York (1978)"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees of trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16, 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"34_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","volume":"13","author":"F Gavril","year":"1975","unstructured":"Gavril, F.: A recognition algorithm for the intersection graphs of directed paths in directed trees. Discret. Math. 13(3), 237\u2013249 (1975)","journal-title":"Discret. Math."},{"key":"34_CR21","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. Discret. Algorithms 26, 7\u201315 (2014)","journal-title":"J. Discret. Algorithms"},{"key":"34_CR22","doi-asserted-by":"publisher","unstructured":"Habib, M., Stacho, J.: Polynomial-time algorithm for the leafage of chordal graphs. In: Fiat, A., Sanders, P. (eds.) Algorithms - ESA 2009. LNCS, vol. 5757, pp. 290\u2013300. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_27","DOI":"10.1007\/978-3-642-04128-0_27"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Heggernes, P., van\u2019t Hof, P., van Leeuwen, E.J., Saei, R.: Finding disjoint paths in split graphs. Theory Comput. Syst. 57(1), 140\u2013159 (2015)","DOI":"10.1007\/s00224-014-9580-6"},{"key":"34_CR24","doi-asserted-by":"publisher","first-page":"54","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, 54\u201365 (2018). https:\/\/doi.org\/10.1007\/s00224-017-9805-6","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"34_CR25","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s00453-010-9411-3","volume":"61","author":"K Ioannidou","year":"2011","unstructured":"Ioannidou, K., Mertzios, G.B., Nikolopoulos, S.D.: The longest path problem has a polynomial solution on interval graphs. Algorithmica 61(2), 320\u2013341 (2011). https:\/\/doi.org\/10.1007\/s00453-010-9411-3","journal-title":"Algorithmica"},{"key":"34_CR26","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.tcs.2019.09.012","volume":"796","author":"L Jaffke","year":"2019","unstructured":"Jaffke, L., Kwon, O., Str\u00f8mme, T.J.F., Telle, J.A.: Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796, 216\u2013236 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"34_CR27","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":"34_CR28","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"34_CR29","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"},{"issue":"1","key":"34_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.7151\/dmgt.1061","volume":"18","author":"I Lin","year":"1998","unstructured":"Lin, I., McKee, T.A., West, D.B.: The leafage of a chordal graph. Discuss. Math. Graph Theory 18(1), 23\u201348 (1998)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"34_CR31","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","volume":"41","author":"CL Monma","year":"1986","unstructured":"Monma, C.L., Wei, V.K.: Intersection graphs of paths in a tree. J. Comb. Theory Ser. B 41(2), 141\u2013181 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"34_CR32","first-page":"256","volume":"3","author":"S Natarajan","year":"1996","unstructured":"Natarajan, S., Sprague, A.P.: Disjoint paths in circular arc graphs. Nord. J. Comput. 3(3), 256\u2013270 (1996)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"34_CR33","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1006\/jctb.2000.2001","volume":"81","author":"BS Panda","year":"2001","unstructured":"Panda, B.S.: The separator theorem for rooted directed vertex graphs. J. Comb. Theory Ser. B 81(1), 156\u2013162 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"34_CR34","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":"34_CR35","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. Theor. Comput. Sci. 814, 177\u2013188 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR36","unstructured":"Papadopoulos, C., Tzimas, S.: Computing subset feedback vertex set via leafage. CoRR abs\/2103.03035 arXiv:2103.03035 (2021)"},{"issue":"9","key":"34_CR37","doi-asserted-by":"publisher","first-page":"3586","DOI":"10.1007\/s00453-019-00590-9","volume":"81","author":"G Philip","year":"2019","unstructured":"Philip, G., Rajan, V., Saurabh, S., Tale, P.: Subset feedback vertex set in chordal and split graphs. Algorithmica 81(9), 3586\u20133629 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00590-9","journal-title":"Algorithmica"},{"key":"34_CR38","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society, Fields Institute Monograph Series 19 (2003)","DOI":"10.1090\/fim\/019"},{"issue":"2","key":"34_CR39","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM J. Comput. 10(2), 310\u2013327 (1981)","journal-title":"SIAM J. Comput."}],"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-06678-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:08:09Z","timestamp":1653779289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_34","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":"29 May 2022","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":"Trier","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":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"41% - 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":"10","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)"}}]}}