{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:40:52Z","timestamp":1762908052958,"version":"3.45.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031929342"},{"type":"electronic","value":"9783031929359"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92935-9_14","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:07:18Z","timestamp":1747454838000},"page":"216-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonpartisan Feedback Vertex Set"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8322-0639","authenticated-orcid":false,"given":"Nidhi","family":"Purohit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Souvik","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anannya","family":"Upasana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"issue":"3","key":"14_CR1","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. Disc. Math. 12(3), 289\u2013297 (1999). https:\/\/doi.org\/10.1137\/S0895480196305124","journal-title":"SIAM J. Disc. Math."},{"issue":"12","key":"14_CR2","doi-asserted-by":"publisher","first-page":"3816","DOI":"10.1007\/s00453-023-01164-6","volume":"85","author":"S Bandyapadhyay","year":"2023","unstructured":"Bandyapadhyay, S., Banik, A., Bhore, S.: On colorful vertex and edge cover problems. Algorithmica 85(12), 3816\u20133827 (2023)","journal-title":"Algorithmica"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bentert, M., Kellerhals, L., Niedermeier, R.: Fair short paths in vertex-colored graphs. In: Williams, B., Chen, Y., Neville, J. (eds.) Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, 7\u201314 February 2023, pp. 12346\u201312354. AAAI Press (2023)","DOI":"10.1609\/aaai.v37i10.26455"},{"key":"14_CR4","unstructured":"Bera, S.K., Gupta, S., Kumar, A., Roy, S.: Approximation algorithms for edge partitioned vertex cover problems. CoRR arxiv:1112.1945 (2011)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.endm.2017.10.038","volume":"62","author":"J Cohen","year":"2017","unstructured":"Cohen, J., Manoussakis, Y., Pham, H.P., Tuza, Z.: Tropical matchings in vertex-colored graphs. Electron. Notes Disc. Math. 62, 219\u2013224 (2017)","journal-title":"Electron. Notes Disc. Math."},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","volume":"41","author":"R Dechter","year":"1990","unstructured":"Dechter, R.: Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell. 41(3), 273\u2013312 (1990)","journal-title":"Artif. Intell."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-11409-0_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Grigoriev","year":"2010","unstructured":"Grigoriev, A., Sitters, R.: Connected feedback vertex set in planar graphs. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 143\u2013153. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_13"},{"issue":"8","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J Guo","year":"2006","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386\u20131396 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR9","unstructured":"Iwata, Y., Kobayashi, Y.: Improved analysis of highest-degree branching for feedback vertex set. CoRR arxiv:1905.12233 (2019)"},{"key":"14_CR10","unstructured":"Jana, S., Lokshtanov, D., Mandal, S., Rai, A., Saurabh, S.: Parameterized approximation scheme for feedback vertex set. In: Leroux, J., Lombardy, S., Peleg, D. (eds.) 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. LIPIcs, vol.\u00a0272, pp. 56:1\u201356:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Jia, X., Sheth, K., Svensson, O.: Fair colorful k-center clustering. CoRR arxiv:2007.04059 (2020)","DOI":"10.1007\/978-3-030-45771-6_17"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.03.008","volume":"867","author":"L Kanesh","year":"2021","unstructured":"Kanesh, L., Maity, S., Muluk, K., Saurabh, S.: Parameterized complexity of fair feedback vertex set problem. Theor. Comput. Sci. 867, 1\u201312 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR13","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a symposium on the Complexity of Computer Computations, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA, 20\u201322 March 1972, pp. 85\u2013103. The IBM Research Symposia Series. Plenum Press, New York (1972)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-22685-4_9","volume-title":"Computing and Combinatorics","author":"N Misra","year":"2011","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S.: On parameterized independent feedback vertex set. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 98\u2013109. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22685-4_9"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-11440-3_25","volume-title":"WALCOM: Algorithms and Computation","author":"N Misra","year":"2010","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S., Sikdar, S.: FPT algorithms for connected feedback vertex set. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 269\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11440-3_25"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-642-02927-1_59","volume-title":"Automata, Languages and Programming","author":"J Nederlof","year":"2009","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using m\u00f6bius inversion: improving on steiner tree and related problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 713\u2013725. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_59"},{"key":"14_CR17","volume-title":"Operating System Concepts","author":"A Silberschatz","year":"2018","unstructured":"Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts, 10th edn. Wiley, Hoboken (2018)","edition":"10"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S.: A 4k$$ ^{\\text{2}}$$ kernel for feedback vertex set. ACM Trans. Algor. 6(2), 32:1\u201332:8 (2010)","DOI":"10.1145\/1721837.1721848"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92935-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:37:25Z","timestamp":1762907845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92935-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929342","9783031929359"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92935-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}