{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T16:12:04Z","timestamp":1780330324106,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031754081","type":"print"},{"value":"9783031754098","type":"electronic"}],"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-75409-8_20","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:35Z","timestamp":1737497435000},"page":"282-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Roman Cycle Hitting Set"],"prefix":"10.1007","author":[{"given":"Satyabrata","family":"Jana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sounak","family":"Modak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kushal","family":"Singanporia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Gupta, S., Saurabh, S., Sharma, R.: Improved algorithms and combinatorial bounds for independent feedback vertex set. In: Guo, J., Hermelin, D. (eds.) 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, 24\u201326 August 2016, Aarhus, Denmark. LIPIcs, vol. 63, pp. 2:1\u20132:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2016.2","DOI":"10.4230\/LIPIcs.IPEC.2016.2"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Jain, P., Kanesh, L., Lokshtanov, D., Saurabh, S.: Conflict free feedback vertex set: a parameterized dichotomy. In: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, 27\u201331 August 2018, Liverpool, UK. LIPIcs, vol. 117, pp. 53:1\u201353:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.53","DOI":"10.4230\/LIPIcs.MFCS.2018.53"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Lokshtanov, D., Mouawad, A.E., Saurabh, S.: Simultaneous feedback vertex set: a parameterized perspective. ACM Trans. Comput. Theory 10(4):18:1\u201318:25 (2018). https:\/\/doi.org\/10.1145\/3265027","DOI":"10.1145\/3265027"},{"issue":"5","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2973749","volume":"63","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. J. ACM (JACM) 63(5), 1\u201369 (2016)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/15M1032077","volume":"45","author":"R Chitnis","year":"2016","unstructured":"Chitnis, R., Cygan, M., Hajiaghayi, M.T., Pilipczuk, M., Pilipczuk, M.: Designing FPT algorithms for cut problems using randomized contractions. SIAM J. Comput. 45(4), 1171\u20131229 (2016). https:\/\/doi.org\/10.1137\/15M1032077","journal-title":"SIAM J. Comput."},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. ACM Trans. Algorithms 18(2):17:1\u201317:31 (2022). https:\/\/doi.org\/10.1145\/3506707","DOI":"10.1145\/3506707"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/s00453-014-9966-5","volume":"74","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M.: On group feedback vertex set parameterized by the size of the cutset. Algorithmica 74(2), 630\u2013642 (2016). https:\/\/doi.org\/10.1007\/s00453-014-9966-5","journal-title":"Algorithmica"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory, vol. 173. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"key":"20_CR9","unstructured":"Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. In: Ambos-Spies, K., Homer, S., Sch\u00f6ning, U. (eds.) Complexity Theory: Current Research, Dagstuhl Workshop, 2\u20138 February 1992, pp. 191\u2013225. Cambridge University Press (1992)"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/00207160701374376","volume":"85","author":"H Fernau","year":"2008","unstructured":"Fernau, H.: ROMAN DOMINATION: a parameterized perspective. Int. J. Comput. Math. 85(1), 25\u201338 (2008). https:\/\/doi.org\/10.1080\/00207160701374376","journal-title":"Int. J. Comput. Math."},{"key":"20_CR11","unstructured":"Fernau, H., Mann, K.: Hitting the romans. CoRR, abs\/2302.11417 (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.11417, http:\/\/arxiv.org\/abs\/2302.11417"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6\u20138 June 2011, pp. 479\u2013488. ACM (2011). https:\/\/doi.org\/10.1145\/1993636.1993700","DOI":"10.1145\/1993636.1993700"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Topics in Domination in Graphs, vol.\u00a064. Springer (2020)","DOI":"10.1007\/978-3-030-51117-3"},{"issue":"8","key":"20_CR14","doi-asserted-by":"publisher","first-page":"2503","DOI":"10.1007\/s00453-021-00815-w","volume":"83","author":"Y Iwata","year":"2021","unstructured":"Iwata, Y., Kobayashi, Y.: Improved analysis of highest-degree branching for feedback vertex set. Algorithmica 83(8), 2503\u20132520 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00815-w","journal-title":"Algorithmica"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Kawarabayashi, K., Thorup, M.: The minimum k-way cut of bounded size is fixed-parameter tractable. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, 22\u201325 October 2011, pp. 160\u2013169. IEEE Computer Society (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.53","DOI":"10.1109\/FOCS.2011.53"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Li, J., Nederlof, J.: Detecting feedback vertex sets of size k in O$$ ^{\\star }$$ (2.7k) time. ACM Trans. Algorithms 18(4), 34:1\u201334:26 (2022). https:\/\/doi.org\/10.1145\/3504027","DOI":"10.1145\/3504027"},{"issue":"8","key":"20_CR17","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1007\/s00224-020-09973-w","volume":"64","author":"S Li","year":"2020","unstructured":"Li, S., Pilipczuk, M.: An improved FPT algorithm for independent feedback vertex set. Theory Comput. Syst. 64(8), 1317\u20131330 (2020). https:\/\/doi.org\/10.1007\/s00224-020-09973-w","journal-title":"Theory Comput. Syst."},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster parameterized algorithms using linear programming. ACM Trans. Algorithms 11(2), 15:1\u201315:31 (2014). https:\/\/doi.org\/10.1145\/2566616","DOI":"10.1145\/2566616"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Ramanujan, M.S., Saurabh, S.: Linear time parameterized algorithms for subset feedback vertex set. ACM Trans. Algorithms 14(1), 7:1\u20137:37 (2018). https:\/\/doi.org\/10.1145\/3155299","DOI":"10.1145\/3155299"},{"key":"20_CR20","unstructured":"Lokshtanov, D., Ramanujan, M.S., Saurabh, S., Zehavi, M.: Reducing CMSO model checking to highly connected graphs. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Dagstuhl, Germany. Leibniz International Proceedings in Informatics (LIPIcs), vol. 107, pp. 135:1\u2013135:14 (2018). https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ICALP.2018.135"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2012.02.012","volume":"461","author":"N Misra","year":"2012","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S.: On parameterized independent feedback vertex set. Theor. Comput. Sci. 461, 65\u201375 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.02.012","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10878-011-9394-2","volume":"24","author":"N Misra","year":"2012","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S., Sikdar, S.: FPT algorithms for connected feedback vertex set. J. Comb. Optim. 24(2), 131\u2013146 (2012). https:\/\/doi.org\/10.1007\/s10878-011-9394-2","journal-title":"J. Comb. Optim."},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B Reed","year":"2004","unstructured":"Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Thomass\u00e9, S.: A quadratic kernel for feedback vertex set. In: Mathieu, C. (ed.) Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4\u20136 January 2009, pp. 115\u2013119. SIAM (2009). https:\/\/doi.org\/10.1137\/1.9781611973068.13","DOI":"10.1137\/1.9781611973068.13"},{"key":"20_CR25","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:37Z","timestamp":1737497437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}