{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T14:01:26Z","timestamp":1784815286544,"version":"3.55.0"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.jcss.2026.103818","type":"journal-article","created":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T16:03:56Z","timestamp":1779725036000},"page":"103818","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Subset feedback vertex set in tournaments as fast as without the subset"],"prefix":"10.1016","volume":"161","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7046-0091","authenticated-orcid":false,"given":"Satyabrata","family":"Jana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madhumita","family":"Kundu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/j.jcss.2026.103818_br0010","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","article-title":"A kernelization algorithm for d-hitting set","volume":"76","author":"Abu-Khzam","year":"2010","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103818_br0020","series-title":"Jiong Guo and Danny Hermelin, Editors, 11th International Symposium on Parameterized and Exact Computation","article-title":"Improved algorithms and combinatorial bounds for independent feedback vertex set","volume":"vol. 63","author":"Agrawal","year":"2016"},{"key":"10.1016\/j.jcss.2026.103818_br0030","series-title":"43rd International Symposium on Mathematical Foundations of Computer Science","article-title":"Conflict free feedback vertex set: a parameterized dichotomy","volume":"vol. 117","author":"Agrawal","year":"2018"},{"key":"10.1016\/j.jcss.2026.103818_br0040","series-title":"SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings, Part I","first-page":"23","article-title":"Parameterized complexity of feedback vertex set with connectivity constraints","volume":"vol. 15538","author":"Abhinav","year":"2025"},{"issue":"4","key":"10.1016\/j.jcss.2026.103818_br0050","doi-asserted-by":"crossref","DOI":"10.1145\/3265027","article-title":"Simultaneous feedback vertex set: a parameterized perspective","volume":"10","author":"Agrawal","year":"2018","journal-title":"ACM Trans. Comput. Theory"},{"key":"10.1016\/j.jcss.2026.103818_br0060","series-title":"Investigations Concerning Parameterized and Exact Algorithms for the Feedback Set and Related Problems","author":"Bai","year":"2024"},{"key":"10.1016\/j.jcss.2026.103818_br0070","series-title":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"3654","article-title":"Kernelization for graph packing problems via rainbow matching","author":"Bessy","year":"2023"},{"key":"10.1016\/j.jcss.2026.103818_br0080","series-title":"32nd Annual European Symposium on Algorithms","article-title":"Cuts in graphs with matroid constraints","volume":"vol. 308","author":"Banik","year":"2024"},{"key":"10.1016\/j.jcss.2026.103818_br0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114139","article-title":"A parameterized algorithm for subset feedback vertex set in tournaments","volume":"975","author":"Bai","year":"2023","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.jcss.2026.103818_br0100","doi-asserted-by":"crossref","DOI":"10.1145\/2700209","article-title":"Directed subset feedback vertex set is fixed-parameter tractable","volume":"11","author":"Chitnis","year":"2015","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"10.1016\/j.jcss.2026.103818_br0110","doi-asserted-by":"crossref","DOI":"10.1145\/1411509.1411511","article-title":"A fixed-parameter algorithm for the directed feedback vertex set problem","volume":"55","author":"Chen","year":"2008","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.jcss.2026.103818_br0120","doi-asserted-by":"crossref","DOI":"10.1145\/3506707","article-title":"Solving connectivity problems parameterized by treewidth in single exponential time","volume":"18","author":"Cygan","year":"2022","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"10.1016\/j.jcss.2026.103818_br0130","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1007\/s00453-014-9966-5","article-title":"On group feedback vertex set parameterized by the size of the cutset","volume":"74","author":"Cygan","year":"2016","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.jcss.2026.103818_br0140","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1137\/110843071","article-title":"Subset feedback vertex set is fixed-parameter tractable","volume":"27","author":"Cygan","year":"2013","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.jcss.2026.103818_br0150","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.jda.2009.08.001","article-title":"Fixed-parameter tractability results for feedback set problems in tournaments","volume":"8","author":"Dom","year":"2010","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"10.1016\/j.jcss.2026.103818_br0160","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1137\/S0097539798340047","article-title":"An 8-approximation algorithm for the subset feedback vertex set problem","volume":"30","author":"Even","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.jcss.2026.103818_br0170","doi-asserted-by":"crossref","DOI":"10.1145\/3293466","article-title":"Subquadratic kernels for implicit 3-hitting set and 3-set packing problems","volume":"15","author":"Fomin","year":"2019","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.jcss.2026.103818_br0180","series-title":"Kernelization: Theory of Parameterized Preprocessing","author":"Fomin","year":"2019"},{"key":"10.1016\/j.jcss.2026.103818_br0190","series-title":"LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Proceedings, Part I","first-page":"225","article-title":"Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments","volume":"vol. 14578","author":"Gupta","year":"2024"},{"issue":"1","key":"10.1016\/j.jcss.2026.103818_br0200","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1233481.1233493","article-title":"Invitation to data reduction and problem kernelization","volume":"38","author":"Guo","year":"2007","journal-title":"SIGACT News"},{"issue":"1","key":"10.1016\/j.jcss.2026.103818_br0210","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s00224-017-9805-6","article-title":"A randomized polynomial kernel for subset feedback vertex set","volume":"62","author":"Hols","year":"2018","journal-title":"Theory Comput. Syst."},{"issue":"8","key":"10.1016\/j.jcss.2026.103818_br0220","doi-asserted-by":"crossref","first-page":"2503","DOI":"10.1007\/s00453-021-00815-w","article-title":"Improved analysis of highest-degree branching for feedback vertex set","volume":"83","author":"Iwata","year":"2021","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.jcss.2026.103818_br0230","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1137\/140962838","article-title":"Half-integrality, lp-branching, and FPT algorithms","volume":"45","author":"Iwata","year":"2016","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103818_br0240","series-title":"59th IEEE Annual Symposium on Foundations of Computer Science","first-page":"462","article-title":"0\/1\/all csps, half-integral a-path packing, and linear-time FPT algorithms","author":"Iwata","year":"2018"},{"key":"10.1016\/j.jcss.2026.103818_br0250","series-title":"19th International Symposium on Parameterized and Exact Computation","article-title":"Subset feedback vertex set in tournaments as fast as without the subset","volume":"vol. 321","author":"Jana","year":"2024"},{"key":"10.1016\/j.jcss.2026.103818_br0260","series-title":"48th International Symposium on Mathematical Foundations of Computer Science","article-title":"Parameterized approximation scheme for feedback vertex set","volume":"vol. 272","author":"Jana","year":"2023"},{"key":"10.1016\/j.jcss.2026.103818_br0270","series-title":"Graph-Theoretic Concepts in Computer Science - 50th International Workshop, Revised Selected Papers","first-page":"282","article-title":"Roman cycle hitting set","volume":"vol. 14760","author":"Jana","year":"2024"},{"key":"10.1016\/j.jcss.2026.103818_br0280","series-title":"Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.jcss.2026.103818_br0290","series-title":"33rd Symposium on Theoretical Aspects of Computer Science","article-title":"Faster exact and parameterized algorithm for feedback vertex set in tournaments","volume":"vol. 47","author":"Kumar","year":"2016"},{"issue":"4","key":"10.1016\/j.jcss.2026.103818_br0300","doi-asserted-by":"crossref","DOI":"10.1145\/3504027","article-title":"Detecting feedback vertex sets of size k in O\u22c6 (2.7k) time","volume":"18","author":"Li","year":"2022","journal-title":"ACM Trans. Algorithms"},{"issue":"8","key":"10.1016\/j.jcss.2026.103818_br0310","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1007\/s00224-020-09973-w","article-title":"An improved FPT algorithm for independent feedback vertex set","volume":"64","author":"Li","year":"2020","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"10.1016\/j.jcss.2026.103818_br0320","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10878-011-9394-2","article-title":"FPT algorithms for connected feedback vertex set","volume":"24","author":"Misra","year":"2012","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.jcss.2026.103818_br0330","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.tcs.2012.02.012","article-title":"On parameterized independent feedback vertex set","volume":"461","author":"Misra","year":"2012","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jcss.2026.103818_br0340","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","article-title":"An efficient fixed-parameter algorithm for 3-hitting set","volume":"1","author":"Niedermeier","year":"2003","journal-title":"J. Discrete Algorithms"},{"issue":"9","key":"10.1016\/j.jcss.2026.103818_br0350","doi-asserted-by":"crossref","first-page":"3586","DOI":"10.1007\/s00453-019-00590-9","article-title":"Subset feedback vertex set in chordal and split graphs","volume":"81","author":"Philip","year":"2019","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2026.103818_br0360","series-title":"Algorithms, measures and upper bounds for satisfiability and related problems","author":"Magnus","year":"2007"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000644?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000644?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T13:13:42Z","timestamp":1784812422000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":36,"alternative-id":["S0022000026000644"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103818","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Subset feedback vertex set in tournaments as fast as without the subset","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103818","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103818"}}