{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:14:02Z","timestamp":1743135242974,"version":"3.40.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:00:00Z","timestamp":1740528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:00:00Z","timestamp":1740528000000},"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-025-00482-2","type":"journal-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T06:59:57Z","timestamp":1740553197000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On minimum t-claw deletion in split graphs"],"prefix":"10.1007","volume":"62","author":[{"given":"Sounaka","family":"Mishra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,26]]},"reference":[{"key":"482_CR1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"2012","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (2012)"},{"key":"482_CR2","doi-asserted-by":"crossref","unstructured":"Bonomo-Braberman, F., Nascimento, J.R., Oliveira, F.S., Souza, U.S., Szwarcfiter, J.L.: Linear-time algorithms for eliminating claws in graphs. In: International Computing and Combinatorics Conference, pp. 14\u201326. Springer (2020)","DOI":"10.1007\/978-3-030-58150-3_2"},{"issue":"2","key":"482_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0890-5401(91)90025-W","volume":"93","author":"P Crescenzi","year":"1991","unstructured":"Crescenzi, P., Panconesi, A.: Completeness in approximation classes. Inf. Comput. 93(2), 241\u2013262 (1991)","journal-title":"Inf. Comput."},{"issue":"1","key":"482_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1006\/jagm.1998.0995","volume":"31","author":"T Fujito","year":"1999","unstructured":"Fujito, T.: Approximating node-deletion problems for matroidal properties. J. Algorithms 31(1), 211\u2013227 (1999)","journal-title":"J. Algorithms"},{"key":"482_CR5","doi-asserted-by":"crossref","unstructured":"Fujito, T.: Approximating bounded degree deletion via matroid matching. In: International Conference on Algorithms and Complexity, pp. 234\u2013246. Springer (2017)","DOI":"10.1007\/978-3-319-57586-5_20"},{"issue":"3","key":"482_CR6","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1137\/16M1070670","volume":"31","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Lee, E.: Inapproximability of h-transversal\/packing. SIAM J. Discrete Math. 31(3), 1552\u20131571 (2017)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"482_CR7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555\u2013556 (1982)","journal-title":"SIAM J. Comput."},{"key":"482_CR8","doi-asserted-by":"crossref","unstructured":"Hsieh, S.-Y., Le, V.B., Peng, S.-L.: On the d-claw vertex deletion problem. In: International Computing and Combinatorics Conference, pp. 591\u2013603. Springer (2021)","DOI":"10.1007\/978-3-030-89543-3_49"},{"issue":"3","key":"482_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- $$\\varepsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"482_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2014.01.019","volume":"526","author":"M Kumar","year":"2014","unstructured":"Kumar, M., Mishra, S., Devi, N.S., Saurabh, S.: Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theoret. Comput. Sci. 526, 90\u201396 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"482_CR11","doi-asserted-by":"crossref","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is $${\\sf N}{\\sf P}$$-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","DOI":"10.1016\/0022-0000(80)90060-4"},{"key":"482_CR12","doi-asserted-by":"crossref","unstructured":"Lund, C., Yannakakis, M.: The approximation of maximum subgraph problems. In: Automata, Languages and Programming, pp. 40\u201351. Springer (1993)","DOI":"10.1007\/3-540-56939-1_60"},{"issue":"3","key":"482_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"482_CR14","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":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00482-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00482-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00482-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:50:10Z","timestamp":1743126610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00482-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,26]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["482"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00482-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2025,2,26]]},"assertion":[{"value":"28 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"16"}}