{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:03:40Z","timestamp":1779894220073,"version":"3.53.1"},"reference-count":33,"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.103816","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T16:06:31Z","timestamp":1779811591000},"page":"103816","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Parameterized complexity of feedback vertex set with connectivity constraints"],"prefix":"10.1016","volume":"161","author":[{"given":"Ankit","family":"Abhinav","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7046-0091","authenticated-orcid":false,"given":"Satyabrata","family":"Jana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nidhi","family":"Purohit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abhishek","family":"Sahu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2026.103816_br0010","series-title":"SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science","first-page":"23","article-title":"Parameterized complexity of feedback vertex set with connectivity constraints","volume":"vol. 15538","author":"Abhinav","year":"2025"},{"key":"10.1016\/j.jcss.2026.103816_br0020","series-title":"IPEC 2016","first-page":"2:1","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.103816_br0030","series-title":"MFCS 2018","first-page":"53:1","article-title":"Conflict free feedback vertex set: a parameterized dichotomy","volume":"vol. 117","author":"Agrawal","year":"2018"},{"issue":"4","key":"10.1016\/j.jcss.2026.103816_br0040","doi-asserted-by":"crossref","first-page":"18:1","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"},{"issue":"2","key":"10.1016\/j.jcss.2026.103816_br0050","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/100789403","article-title":"Counting subgraphs via homomorphisms","volume":"26","author":"Amini","year":"2012","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10.1016\/j.jcss.2026.103816_br0060","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/0209055","article-title":"Constant time generation of rooted trees","volume":"9","author":"Beyer","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"8","key":"10.1016\/j.jcss.2026.103816_br0070","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","article-title":"On problems without polynomial kernels","volume":"75","author":"Bodlaender","year":"2009","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"10.1016\/j.jcss.2026.103816_br0080","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.jcss.2010.01.001","article-title":"Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem","volume":"76","author":"Cohen","year":"2010","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103816_br0090","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"2","key":"10.1016\/j.jcss.2026.103816_br0100","doi-asserted-by":"crossref","first-page":"17:1","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.103816_br0110","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"},{"key":"10.1016\/j.jcss.2026.103816_br0120","series-title":"Complexity Theory: Current Research","first-page":"191","article-title":"Fixed parameter tractability and completeness","author":"Downey","year":"1992"},{"key":"10.1016\/j.jcss.2026.103816_br0130","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","article-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.jcss.2026.103816_br0140","article-title":"Parameterized Complexity Theory","author":"Flum","year":"2006"},{"key":"10.1016\/j.jcss.2026.103816_br0150","series-title":"Kernelization: Theory of Parameterized Preprocessing","author":"Fomin","year":"2019"},{"issue":"8","key":"10.1016\/j.jcss.2026.103816_br0160","doi-asserted-by":"crossref","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","article-title":"Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization","volume":"72","author":"Guo","year":"2006","journal-title":"J. Comput. Syst. Sci."},{"issue":"8","key":"10.1016\/j.jcss.2026.103816_br0170","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"},{"key":"10.1016\/j.jcss.2026.103816_br0180","series-title":"48th International Symposium on Mathematical Foundations of Computer Science","first-page":"56:1","article-title":"Parameterized approximation scheme for feedback vertex set","volume":"vol. 272","author":"Jana","year":"2023"},{"key":"10.1016\/j.jcss.2026.103816_br0190","series-title":"Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas J. Watson Research Center","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.jcss.2026.103816_br0200","series-title":"Graph-Theoretic Concepts in Computer Science","first-page":"58","article-title":"Divide-and-color","volume":"vol. 4271","author":"Kneis","year":"2006"},{"issue":"4","key":"10.1016\/j.jcss.2026.103816_br0210","doi-asserted-by":"crossref","first-page":"34:1","DOI":"10.1145\/3504027","article-title":"Detecting feedback vertex sets of size k in O\u204e (2.7k) time","volume":"18","author":"Li","year":"2022","journal-title":"ACM Trans. Algorithms"},{"issue":"8","key":"10.1016\/j.jcss.2026.103816_br0220","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":"1","key":"10.1016\/j.jcss.2026.103816_br0230","doi-asserted-by":"crossref","first-page":"7:1","DOI":"10.1145\/3155299","article-title":"Linear time parameterized algorithms for subset feedback vertex set","volume":"14","author":"Lokshtanov","year":"2018","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.jcss.2026.103816_br0240","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":"2","key":"10.1016\/j.jcss.2026.103816_br0250","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."},{"issue":"1","key":"10.1016\/j.jcss.2026.103816_br0260","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.disopt.2010.10.001","article-title":"Lower bounds on kernelization","volume":"8","author":"Misra","year":"2011","journal-title":"Discrete Optim."},{"key":"10.1016\/j.jcss.2026.103816_br0270","series-title":"36th Annual Symposium on Foundations of Computer Science","first-page":"182","article-title":"Splitters and near-optimal derandomization","author":"Naor","year":"1995"},{"key":"10.1016\/j.jcss.2026.103816_br0280","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"key":"10.1016\/j.jcss.2026.103816_br0290","doi-asserted-by":"crossref","first-page":"583","DOI":"10.2307\/1969046","article-title":"The number of trees","author":"Otter","year":"1948","journal-title":"Ann. Math."},{"issue":"3","key":"10.1016\/j.jcss.2026.103816_br0300","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/1159892.1159898","article-title":"Faster fixed parameter tractable algorithms for finding feedback vertex sets","volume":"2","author":"Raman","year":"2006","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.jcss.2026.103816_br0310","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors. xiii. The disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"10.1016\/j.jcss.2026.103816_br0320","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","article-title":"Graph minors. XX. Wagner's conjecture","volume":"92","author":"Robertson","year":"2004","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"10.1016\/j.jcss.2026.103816_br0330","doi-asserted-by":"crossref","first-page":"32:1","DOI":"10.1145\/1721837.1721848","article-title":"A 4k2 kernel for feedback vertex set","volume":"6","author":"Thomass\u00e9","year":"2010","journal-title":"ACM Trans. Algorithms"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000620?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000620?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:16:09Z","timestamp":1779891369000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":33,"alternative-id":["S0022000026000620"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103816","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":"Parameterized complexity of feedback vertex set with connectivity constraints","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.103816","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":"103816"}}