{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:23:44Z","timestamp":1725600224862},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_19","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"219-230","source":"Crossref","is-referenced-by-count":0,"title":["Multicut in Trees Viewed through the Eyes of Vertex Cover"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jia-Hao","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Iyad A.","family":"Kanj","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Fenghui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Abu-Khzam, F.A., Collins, R., Fellows, M., Langston, M., Suters, W., Symons, C.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of ALENEX, pp. 62\u201369 (2004)","key":"19_CR1"},{"doi-asserted-by":"crossref","unstructured":"Bousquet, N., Daligault, J., Thomass\u00e9, S.: Multicut is fpt. In: CoRR, abs\/1010.5197, 2010 (to appear in STOC 2011)","key":"19_CR2","DOI":"10.1145\/1993636.1993698"},{"unstructured":"Bousquet, N., Daligault, J., Thomass\u00e9, S., Yeo, A.: A polynomial kernel for multicut in trees. In: Proceedings of STACS, pp. 183\u2013194 (2009)","key":"19_CR3"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0222038","volume":"22","author":"J. Buss","year":"1993","unstructured":"Buss, J., Goldsmith, J.: Nondeterminism within P. SIAM Journal on Computing\u00a022, 560\u2013572 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2003.10.037","volume":"162","author":"M. Costa","year":"2005","unstructured":"Costa, M., Letocart, L., Roupin, F.: Minimal multicut and maximal integer multiflow: A survey. European Journal of Operational Research\u00a0162(1), 55\u201369 (2005)","journal-title":"European Journal of Operational Research"},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica\u00a018(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/net.20081","volume":"46","author":"J. Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R.: Fixed-parameter tractability and data reduction for multicut in trees. Networks\u00a046(3), 124\u2013135 (2005)","journal-title":"Networks"},{"issue":"3","key":"19_CR9","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. Theoretical Computer Science\u00a0351(3), 394\u2013406 (2006)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: CoRR, abs\/1010.3633, 2010 (to appear in STOC 2011)","key":"19_CR10","DOI":"10.1145\/1993636.1993699"},{"key":"19_CR11","volume-title":"Introduction to graph theory","author":"D.B. West","year":"1996","unstructured":"West, D.B.: Introduction to graph theory. Prentice Hall Inc., Upper Saddle River (1996)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T07:21:11Z","timestamp":1554016871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}