{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T16:57:05Z","timestamp":1770483425073,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1016\/j.disopt.2010.05.003","type":"journal-article","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T05:24:00Z","timestamp":1277357040000},"page":"61-71","source":"Crossref","is-referenced-by-count":43,"title":["FPT algorithms for path-transversal and cycle-transversal problems"],"prefix":"10.1016","volume":"8","author":[{"given":"Sylvain","family":"Guillemot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2010.05.003_br000005","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.disopt.2010.05.003_br000010","series-title":"Parameterized Complexity Theory","author":"Flum","year":"2006"},{"key":"10.1016\/j.disopt.2010.05.003_br000015","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"key":"10.1016\/j.disopt.2010.05.003_br000020","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","article-title":"Parameterized graph separation problems","volume":"351","author":"M\u00e0rx","year":"2006","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.disopt.2010.05.003_br000025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-007-9130-6","article-title":"An improved parameterized algorithm for the minimum node multiway cut problem","volume":"55","author":"Chen","year":"2009","journal-title":"Algorithmica"},{"key":"10.1016\/j.disopt.2010.05.003_br000030","series-title":"Proc. CSR 2008","first-page":"314","article-title":"Algorithms for multiterminal cuts","volume":"vol. 5010","author":"Xiao","year":"2008"},{"issue":"7","key":"10.1016\/j.disopt.2010.05.003_br000035","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1016\/j.jcss.2008.05.002","article-title":"Improved algorithms for feedback vertex set problems","volume":"74","author":"Chen","year":"2008","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/j.disopt.2010.05.003_br000040","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","article-title":"Finding odd cycle transversals","volume":"32","author":"Reed","year":"2004","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"10.1016\/j.disopt.2010.05.003_br000045","doi-asserted-by":"crossref","DOI":"10.1145\/1411509.1411511","article-title":"A fixed-parameter algorithm for the directed feedback vertex set problem","volume":"55","author":"Chen","year":"2008","journal-title":"J. ACM"},{"issue":"26","key":"10.1016\/j.disopt.2010.05.003_br000050","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00493-006-0030-1","article-title":"Packing non-zero A-paths in group-labelled graphs","volume":"5","author":"Chudnovsky","year":"2006","journal-title":"Combinatorica"},{"key":"10.1016\/j.disopt.2010.05.003_br000055","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.jctb.2005.08.001","article-title":"Non-zero disjoint cycles in highly connected group labeled graphs","volume":"96","author":"Kawarabayashi","year":"2006","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disopt.2010.05.003_br000060","series-title":"Proc. ICALP\u201994","first-page":"487","article-title":"Multiway cuts in directed and node weighted graphs","volume":"vol. 820","author":"Garg","year":"1994"},{"key":"10.1016\/j.disopt.2010.05.003_br000065","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Path, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.disopt.2010.05.003_br000070","series-title":"Algorithmics of Large and Complex Networks","first-page":"65","article-title":"Iterative compression for exactly solving NP-hard minimization problems","volume":"vol. 5515","author":"Guo","year":"2009"},{"key":"10.1016\/j.disopt.2010.05.003_br000075","doi-asserted-by":"crossref","unstructured":"S. Khot, On the power of unique 2-prover 1-round games, in: Proc. STOC\u201902, 2002, pp. 767\u2013775.","DOI":"10.1109\/CCC.2002.1004334"},{"key":"10.1016\/j.disopt.2010.05.003_br000080","doi-asserted-by":"crossref","unstructured":"A. Gupta, K. Talwar, Approximating unique games, in: Proc. SODA\u201906, 2006, pp. 99\u2013106.","DOI":"10.1145\/1109557.1109569"}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1572528610000381?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1572528610000381?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,10]],"date-time":"2018-12-10T00:50:12Z","timestamp":1544403012000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528610000381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["S1572528610000381"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.disopt.2010.05.003","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}