{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:28:35Z","timestamp":1770902915116,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032171559","type":"print"},{"value":"9783032171566","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-17156-6_25","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:09Z","timestamp":1770899769000},"page":"336-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subset Feedback Vertex Set and\u00a0Subset Vertex Cover on\u00a0AT-Free Graphs"],"prefix":"10.1007","author":[{"given":"Joydeep","family":"Mukherjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamojit","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114139","volume":"975","author":"T Bai","year":"2023","unstructured":"Bai, T., Xiao, M.: A parameterized algorithm for subset feedback vertex set in tournaments. Theoret. Comput. Sci. 975, 114139 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114326","volume":"984","author":"T Bai","year":"2024","unstructured":"Bai, T., Xiao, M.: Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. Theoret. Comput. Sci. 984, 114326 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Balakrishnan, H., Rajaraman, A., Rangan, C.P.: Connected domination and steiner set on asteroidal triple-free graphs. In: Dehne, F., Sack, J.-R., Santoro, N., Whitesides, S. (eds.) WADS 1993. LNCS, vol. 709, pp. 131\u2013141. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57155-8_242","DOI":"10.1007\/3-540-57155-8_242"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1137\/S0097539796305109","volume":"27","author":"R Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and bayesian inference. SIAM J. Comput. 27(4), 942\u2013959 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(95)00004-6","volume":"83","author":"A Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: Optimization of pearl\u2019s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83(1), 167\u2013188 (1996)","journal-title":"Artif. Intell."},{"issue":"5","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1007\/s00453-022-00936-w","volume":"84","author":"B Bergougnoux","year":"2022","unstructured":"Bergougnoux, B., Papadopoulos, C., Telle, J.A.: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width. Algorithmica 84(5), 1385\u20131417 (2022)","journal-title":"Algorithmica"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2021.12.010","volume":"902","author":"N Brettell","year":"2022","unstructured":"Brettell, N., Johnson, M., Paesani, G., Paulusma, D.: Computing subset transversals in h-free graphs. Theoretical Comput. Sci. 902, 76\u201392 (2022)","journal-title":"Theoretical Comput. Sci."},{"key":"25_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2025.115088","volume":"1032","author":"N Brettell","year":"2025","unstructured":"Brettell, N., Oostveen, J.J., Pandey, S., Paulusma, D., Rauch, J., van Leeuwen, E.J.: Computing subset vertex covers in h-free graphs. Theoretical Comput. Sci. 1032, 115088 (2025)","journal-title":"Theoretical Comput. Sci."},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/S0895480197326346","volume":"12","author":"H Broersma","year":"1999","unstructured":"Broersma, H., Kloks, T., Kratsch, D., M\u00fcller, H.: Independent sets in asteroidal triple-free graphs. SIAM J. Discrete Math. 12(2), 276\u2013287 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"25_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0166-218X(03)00390-1","volume":"132","author":"JM Chang","year":"2003","unstructured":"Chang, J.M.: Induced matchings in asteroidal triple-free graphs. Discrete Appl. Math. 132(1\u20133), 67\u201378 (2003)","journal-title":"Discrete Appl. Math."},{"key":"25_CR11","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."},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"DG Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10(3), 399\u2013430 (1997)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"25_CR13","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(1), 290\u2013309 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/S0097539798340047","volume":"30","author":"G Even","year":"2000","unstructured":"Even, G., Naor, J., Zosin, L.: An 8-approximation algorithm for the subset feedback vertex set problem. SIAM J. Comput. 30(4), 1231\u20131252 (2000)","journal-title":"SIAM J. Comput."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.: Feedback set problems. In: Encyclopedia of Optimization, pp. 1005\u20131016. Springer (2008)","DOI":"10.1007\/978-0-387-74759-0_178"},{"issue":"2","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3284176","volume":"66","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. J. ACM (JACM) 66(2), 1\u201323 (2019)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"25_CR17","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)","journal-title":"Algorithmica"},{"key":"25_CR18","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol.\u00a029. wh freeman New York (2002)"},{"key":"25_CR19","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":"25_CR20","doi-asserted-by":"publisher","unstructured":"Golovach, P.A., Paulusma, D., van Leeuwen, E.J.: Induced disjoint paths in AT-free graphs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 153\u2013164. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_14","DOI":"10.1007\/978-3-642-31155-0_14"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, vol.\u00a057. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0304-3975(96)00206-X","volume":"175","author":"T Kloks","year":"1997","unstructured":"Kloks, T., Kratsch, D., Spinrad, J.: On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoret. Comput. Sci. 175(2), 309\u2013335 (1997)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"25_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00128-6","volume":"99","author":"D Kratsch","year":"2000","unstructured":"Kratsch, D.: Domination and total domination on asteroidal triple-free graphs. Discret. Appl. Math. 99(1\u20133), 111\u2013123 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"10","key":"25_CR24","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1016\/j.dam.2007.10.006","volume":"156","author":"D Kratsch","year":"2008","unstructured":"Kratsch, D., M\u00fcller, H., Todinca, I.: Feedback vertex set on AT-free graphs. Discrete Appl. Math. 156(10), 1936\u20131947 (2008)","journal-title":"Discrete Appl. Math."},{"key":"25_CR25","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":"25_CR26","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."},{"issue":"3","key":"25_CR27","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s00453-023-01149-5","volume":"86","author":"C Papadopoulos","year":"2024","unstructured":"Papadopoulos, C., Tzimas, S.: Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage. Algorithmica 86(3), 874\u2013906 (2024)","journal-title":"Algorithmica"},{"issue":"9","key":"25_CR28","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)","journal-title":"Algorithmica"},{"issue":"3","key":"25_CR29","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/bioinformatics\/10.3.309","volume":"10","author":"P Zhang","year":"1994","unstructured":"Zhang, P., et al.: An algorithm based on graph theory for the assembly of contigs in physical mapping of dna. Bioinformatics 10(3), 309\u2013317 (1994)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17156-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:12Z","timestamp":1770899772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17156-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032171559","9783032171566"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17156-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dharwad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2026.iitdh.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}