{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:26Z","timestamp":1725512126762},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797227"},{"type":"electronic","value":"9783540797234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79723-4_13","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T10:22:17Z","timestamp":1210069337000},"page":"129-140","source":"Crossref","is-referenced-by-count":4,"title":["FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Guillemot","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-540-73951-7_43","volume-title":"Algorithms and Data Structures","author":"J. Chen","year":"2007","unstructured":"Chen, J., Liu, Y., Lu, S.: An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 495\u2013506. Springer, Heidelberg (2007)"},{"issue":"26","key":"13_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00493-006-0030-1","volume":"5","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Geelen, J., Gerards, B., Goddyn, L.A., Lohman, M., Seymour, P.D.: Packing Non-Zero A-Paths In Group-Labelled Graphs. Combinatorica\u00a05(26), 521\u2013532 (2006)","journal-title":"Combinatorica"},{"key":"13_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"13_CR4","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/3-540-58201-0_92","volume-title":"Automata, Languages, and Programming","author":"N. Garg","year":"1994","unstructured":"Garg, N., Vazirani, V., Yannakakis, M.: Multiway Cuts in Directed and Node Weighted Graphs. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 487\u2013498. Springer, Heidelberg (1994)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, A., Talwar, K.: Approximating unique games. In: Proc. SODA 2006, pp. 99\u2013106 (2006)","DOI":"10.1145\/1109557.1109569"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. STOC 2002, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Marx, D.: Parameterized graph separation problems. Theoretical Computer Science\u00a0(351), 394\u2013406 (2006)","DOI":"10.1016\/j.tcs.2005.10.007"},{"issue":"4","key":"13_CR9","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. Operations Research Letters\u00a032(4), 299\u2013301 (2004)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79723-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:29:59Z","timestamp":1619522999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79723-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797227","9783540797234"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79723-4_13","relation":{},"subject":[]}}