{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T20:32:05Z","timestamp":1787085125479,"version":"build-2736575974"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"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":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.tcs.2026.116191","type":"journal-article","created":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T05:59:36Z","timestamp":1785995976000},"page":"116191","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Nonpartisan feedback vertex set"],"prefix":"10.1016","volume":"1084","author":[{"given":"Nidhi","family":"Purohit","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8322-0639","authenticated-orcid":false,"given":"Souvik","family":"Saha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anannya","family":"Upasana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116191_bib0001","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, New York, USA","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"3","key":"10.1016\/j.tcs.2026.116191_bib0002","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0895480196305124","article-title":"A 2-approximation algorithm for the undirected feedback vertex set problem","volume":"12","author":"Bafna","year":"1999","journal-title":"SIAM J. Discrete Math."},{"issue":"8","key":"10.1016\/j.tcs.2026.116191_bib0003","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.tcs.2026.116191_bib0004","series-title":"48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France","first-page":"56:1","article-title":"Parameterized approximation scheme for feedback vertex set","volume":"volume 272","author":"Jana","year":"2023"},{"issue":"2","key":"10.1016\/j.tcs.2026.116191_bib0005","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"},{"key":"10.1016\/j.tcs.2026.116191_bib0006","series-title":"Operating System Concepts, 10th Edition","author":"Silberschatz","year":"2018"},{"issue":"3","key":"10.1016\/j.tcs.2026.116191_bib0007","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition","volume":"41","author":"Dechter","year":"1990","journal-title":"Artif. Intell."},{"issue":"12","key":"10.1016\/j.tcs.2026.116191_bib0008","doi-asserted-by":"crossref","first-page":"3816","DOI":"10.1007\/s00453-023-01164-6","article-title":"On colorful vertex and edge cover problems","volume":"85","author":"Bandyapadhyay","year":"2023","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116191_bib0009","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2014.04.006","article-title":"Approximation algorithms for the partition vertex cover problem","volume":"555","author":"Bera","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116191_bib0010","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.endm.2017.10.038","article-title":"Tropical matchings in vertex-colored graphs","volume":"62","author":"Cohen","year":"2017","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.116191_bib0011","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10107-021-01674-7","article-title":"Fair colorful k-center clustering","volume":"192","author":"Jia","year":"2022","journal-title":"Math. Program."},{"key":"10.1016\/j.tcs.2026.116191_bib0012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2021.03.008","article-title":"Parameterized complexity of fair feedback vertex set problem","volume":"867","author":"Kanesh","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116191_bib0013","first-page":"12346","article-title":"Fair short paths in vertex-colored graphs","author":"Bentert","year":"2023"},{"key":"10.1016\/j.tcs.2026.116191_bib0014","series-title":"Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24\u201326, 2009. Revised Papers","first-page":"143","article-title":"Connected feedback vertex set in planar graphs","author":"Grigoriev","year":"2009"},{"issue":"2","key":"10.1016\/j.tcs.2026.116191_bib0015","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.tcs.2026.116191_bib0016","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."},{"key":"10.1016\/j.tcs.2026.116191_bib0017","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.tcs.2026.116191_bib0018","series-title":"Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5\u201312, 2009, Proceedings, Part I","first-page":"713","article-title":"Fast polynomial-space algorithms using m\u00f6bius inversion: improving on steiner tree and related problems","author":"Nederlof","year":"2009"},{"issue":"8","key":"10.1016\/j.tcs.2026.116191_bib0019","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526004202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526004202?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T20:12:07Z","timestamp":1787083927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526004202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":19,"alternative-id":["S0304397526004202"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116191","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Nonpartisan feedback vertex set","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116191","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116191"}}