{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:05:07Z","timestamp":1750161907818,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_76","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"935-946","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Linear Time Parameterized Algorithms for Subset Feedback Vertex Set"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"6","key":"76_CR1","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"76_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: An $$O(c^k n)$$\n                  $$5$$-approximation algorithm for treewidth. In: FOCS, pp. 499\u2013508 (2013)","DOI":"10.1109\/FOCS.2013.60"},{"key":"76_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-13731-0_10","volume-title":"Algorithm Theory - SWAT 2010","author":"Y Cao","year":"2010","unstructured":"Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 93\u2013104. Springer, Heidelberg (2010)"},{"issue":"7","key":"76_CR4","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.jcss.2008.05.002","volume":"74","author":"J Chen","year":"2008","unstructured":"Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7), 1188\u20131198 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"76_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-9130-6","volume":"55","author":"J Chen","year":"2009","unstructured":"Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55(1), 1\u201313 (2009)","journal-title":"Algorithmica"},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Chen, J., Liu, Y., Lu, S., O\u2019Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5) (2008)","DOI":"10.1145\/1411509.1411511"},{"key":"76_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-31594-7_20","volume-title":"Automata, Languages, and Programming","author":"R Chitnis","year":"2012","unstructured":"Chitnis, R., Cygan, M., Hajiaghayi, M., Marx, D.: Directed subset feedback vertex set is fixed-parameter tractable. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 230\u2013241. Springer, Heidelberg (2012)"},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: FOCS, pp. 150\u2013159 (2011)","DOI":"10.1109\/FOCS.2011.23"},{"key":"76_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-22006-7_38","volume-title":"Automata, Languages and Programming","author":"M Cygan","year":"2011","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Subset feedback vertex set is fixed-parameter tractable. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 449\u2013461. Springer, Heidelberg (2011)"},{"issue":"1","key":"76_CR10","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1137\/110843071","volume":"27","author":"M Cygan","year":"2013","unstructured":"Cygan, M., Wojtaszczyk, J.O.: Subset feedback vertex set is fixed-parameter tractable. SIAM J. Discrete Math. 27(1), 290\u2013309 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"76_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"key":"76_CR12","unstructured":"Dorn, F.: Planar subgraph isomorphism revisited. In: STACS, pp. 263\u2013274 (2010)"},{"key":"76_CR13","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K.-I., Reed, B.A.: A simple algorithm for the graph minor decomposition - logic meets structural graph theory. In: SODA, pp. 414\u2013431 (2013)","DOI":"10.1137\/1.9781611973105.30"},{"issue":"3","key":"76_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"76_CR15","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-I.: Planarity allowing few error vertices in linear time. In: FOCS, pp. 639\u2013648 (2009)","DOI":"10.1109\/FOCS.2009.45"},{"issue":"4","key":"76_CR16","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1016\/j.jctb.2011.12.001","volume":"102","author":"K-I Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K.-I., Kobayashi, Y.: Fixed-parameter tractability for the subset feedback set problem and the s-cycle packing problem. J. Comb. Theory, Ser. B 102(4), 1020\u20131034 (2012)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"76_CR17","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"K-I Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K.-I., Kobayashi, Y., Reed, B.A.: The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B 102(2), 424\u2013435 (2012)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"76_CR18","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-I., Mohar, B.: Graph and map isomorphism and all polyhedral embeddings in linear time. In: STOC, pp. 471\u2013480 (2008)","DOI":"10.1145\/1374376.1374443"},{"key":"76_CR19","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-I., Mohar, B., Reed, B.A.: A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width. In: FOCS, pp. 771\u2013780 (2008)","DOI":"10.1109\/FOCS.2008.53"},{"key":"76_CR20","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-I., Reed, B.A.: A nearly linear time algorithm for the half integral parity disjoint paths packing problem. In: SODA, pp. 1183\u20131192 (2009)","DOI":"10.1137\/1.9781611973068.128"},{"key":"76_CR21","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.-I., Reed, B.A.: An (almost) linear time algorithm for odd cycles transversal. In: SODA, pp. 365\u2013378 (2010)","DOI":"10.1137\/1.9781611973075.31"},{"issue":"4","key":"76_CR22","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"76_CR23","doi-asserted-by":"crossref","unstructured":"Iwata, Y., Oka, K., Yoshida, Y.: Linear-time FPT algorithms via network flow. In: SODA, pp. 1749\u20131761 (2014)","DOI":"10.1137\/1.9781611973402.127"},{"key":"76_CR24","doi-asserted-by":"crossref","unstructured":"Iwata, Y., Wahlstr\u00f6m, M., Yoshida, Y.: Half-integrality, LP-branching and FPT algorithms (2013). CoRR, abs\/1310.2841","DOI":"10.1137\/1.9781611973402.128"},{"key":"76_CR25","doi-asserted-by":"crossref","unstructured":"Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: A near-optimal planarization algorithm. In: SODA, pp. 1802\u20131811 (2014)","DOI":"10.1137\/1.9781611973402.130"},{"key":"76_CR26","doi-asserted-by":"crossref","unstructured":"Kakimura, N., Kawarabayashi, K.-I., Kobayashi, Y.: Erd\u00f6s-P\u00f3sa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. In: SODA, pp. 1726\u20131736 (2012)","DOI":"10.1137\/1.9781611973099.137"},{"issue":"10","key":"76_CR27","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.ipl.2014.05.001","volume":"114","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Pilipczuk, M.: Faster deterministic feedback vertex set. Inf. Process. Lett. 114(10), 556\u2013560 (2014)","journal-title":"Inf. Process. Lett."},{"key":"76_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1007\/978-3-642-31594-7_63","volume-title":"Automata, Languages, and Programming","author":"D Lokshtanov","year":"2012","unstructured":"Lokshtanov, D., Ramanujan, M.S.: Parameterized tractability of multiway cut with parity constraints. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 750\u2013761. Springer, Heidelberg (2012)"},{"issue":"3","key":"76_CR29","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","volume":"351","author":"D Marx","year":"2006","unstructured":"Marx, D.: Parameterized graph separation problems. Theoret. Comput. Sci. 351(3), 394\u2013406 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"76_CR30","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/110855247","volume":"43","author":"D Marx","year":"2014","unstructured":"Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. SIAM J. Comput. 43(2), 355\u2013388 (2014)","journal-title":"SIAM J. Comput."},{"key":"76_CR31","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)"},{"issue":"3","key":"76_CR32","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1159892.1159898","volume":"2","author":"V Raman","year":"2006","unstructured":"Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Transactions on Algorithms 2(3), 403\u2013415 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"76_CR33","doi-asserted-by":"crossref","unstructured":"Ramanujan, M.S., Saurabh, S.: Linear time parameterized algorithms via skew-symmetric multicuts. In: SODA pp. 1739\u20131748 (2014)","DOI":"10.1137\/1.9781611973402.126"},{"issue":"8","key":"76_CR34","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.jcss.2009.04.002","volume":"75","author":"I Razgon","year":"2009","unstructured":"Razgon, I., O\u2019Sullivan, B.: Almost 2-sat is fixed-parameter tractable. J. Comput. Syst. Sci. 75(8), 435\u2013450 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"76_CR35","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. xiii. the disjoint paths problem. J. Comb. Theory, Ser. B 63(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"76_CR36","doi-asserted-by":"crossref","unstructured":"Wahlstr\u00f6m, M.: Half-integrality, LP-branching and FPT algorithms. In: SODA, pp. 1762\u20131781 (2014)","DOI":"10.1137\/1.9781611973402.128"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:16:08Z","timestamp":1676945768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}