{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:16:09Z","timestamp":1743221769938,"version":"3.40.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00236-024-00469-5","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:13:59Z","timestamp":1732652039000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connected feedback vertex set on AT-free graphs"],"prefix":"10.1007","volume":"62","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":[[2024,11,26]]},"reference":[{"key":"469_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. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1948\u20131964. SIAM (2021)","DOI":"10.1137\/1.9781611976465.116"},{"issue":"3","key":"469_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"469_CR3","doi-asserted-by":"crossref","unstructured":"Balakrishnan, H., Rajaraman, A., Rangan, C.P.: Connected domination and steiner set on asteroidal triple-free graphs. In: Algorithms and Data Structures: Third Workshop, WADS\u201993 Montr\u00e9al, Canada, August 11\u201313, 1993 Proceedings 3, pp. 131\u2013141. Springer (1993)","DOI":"10.1007\/3-540-57155-8_242"},{"key":"469_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.dam.2016.08.011","volume":"217","author":"R Belmonte","year":"2017","unstructured":"Belmonte, R., Hof, P.V., Kami\u0144ski, M., Paulusma, D.: The price of connectivity for feedback vertex set. Discrete Appl. Math. 217, 132\u2013143 (2017)","journal-title":"Discrete Appl. Math."},{"key":"469_CR5","doi-asserted-by":"crossref","unstructured":"Bergougnoux, B., Dreier, J., Jaffke, L.: A logic-based algorithmic meta-theorem for mim-width. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3282\u20133304. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch125"},{"issue":"2","key":"469_CR6","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."},{"key":"469_CR7","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. Theor. Comput. Sci. 705, 75\u201383 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"469_CR8","doi-asserted-by":"crossref","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Computing a dominating pair in an asteroidal triple-free graph in linear time. In: Workshop on Algorithms and Data Structures, pp. 358\u2013368. Springer (1995)","DOI":"10.1007\/3-540-60220-8_76"},{"issue":"3","key":"469_CR9","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":"10","key":"469_CR10","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(10), 2841\u20132866 (2020)","journal-title":"Algorithmica"},{"key":"469_CR11","doi-asserted-by":"crossref","unstructured":"Grigoriev, A., Sitters, R.: Connected feedback vertex set in planar graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 143\u2013153. Springer (2009)","DOI":"10.1007\/978-3-642-11409-0_13"},{"key":"469_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/9780429425134","volume-title":"Graph Theory and Its Applications","author":"JL Gross","year":"2018","unstructured":"Gross, J.L., Yellen, J., Anderson, M.: Graph Theory and Its Applications. Chapman and Hall\/CRC, Boca Raton (2018)"},{"issue":"1","key":"469_CR13","first-page":"90","volume":"24","author":"J Hartmanis","year":"1982","unstructured":"Hartmanis, J.: SIAM Rev. Computers and intractability: a guide to the theory of NP-completeness (Michael R. Garey and David S. Johnson) 24(1), 90 (1982)","journal-title":"Computers and intractability: a guide to the theory of NP-completeness (Michael R. Garey and David S. Johnson)"},{"issue":"1\u20133","key":"469_CR14","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. Discrete Appl. Math. 99(1\u20133), 111\u2013123 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"469_CR15","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."},{"issue":"3","key":"469_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(94)00133-2","volume":"52","author":"YD Liang","year":"1994","unstructured":"Liang, Y.D.: On the feedback vertex set problem in permutation graphs. Inf. Process. Lett. 52(3), 123\u2013129 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"469_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s002360050088","volume":"34","author":"YD Liang","year":"1997","unstructured":"Liang, Y.D., Chang, M.-S.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Inform. 34(5), 337 (1997)","journal-title":"Acta Inform."},{"issue":"2","key":"469_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(96)00193-7","volume":"61","author":"CL Lu","year":"1997","unstructured":"Lu, C.L., Tang, C.Y.: A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Inf. Process. Lett. 61(2), 107\u2013111 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"469_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10878-011-9394-2","volume":"24","author":"N Misra","year":"2012","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S., Sikdar, S.: FPT algorithms for connected feedback vertex set. J. Comb. Optim. 24(2), 131\u2013146 (2012)","journal-title":"J. Comb. Optim."},{"issue":"6","key":"469_CR20","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. Discrete Math. 340(6), 1210\u20131226 (2017)","journal-title":"Discrete Math."},{"key":"469_CR21","unstructured":"Ramanujan, M. S.: An approximate kernel for connected feedback vertex set. In: 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"469_CR22","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall Upper Saddle River, Hoboken (2001)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00469-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-024-00469-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00469-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T22:24:40Z","timestamp":1743200680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-024-00469-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["469"],"URL":"https:\/\/doi.org\/10.1007\/s00236-024-00469-5","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"27 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}