{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:22Z","timestamp":1725603682009},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_34","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"394-407","source":"Crossref","is-referenced-by-count":4,"title":["Hitting and Harvesting Pumpkins"],"prefix":"10.1007","author":[{"given":"Gwena\u00ebl","family":"Joret","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"34_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics\u00a012(3), 289\u2013297 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(97)00213-5","volume":"65","author":"R. Balasubramanian","year":"1998","unstructured":"Balasubramanian, R., Fellows, M., Raman, V.: An improved fixed parameter algorithm for Vertex Cover. Information Processing Letters\u00a065, 163\u2013168 (1998)","journal-title":"Information Processing Letters"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(95)00004-6","volume":"83","author":"A. Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: Optimization of pearl\u2019s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artificial Intelligence\u00a083, 167\u2013188 (1996)","journal-title":"Artificial Intelligence"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: Proc. of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 629\u2013638 (2009)","DOI":"10.1109\/FOCS.2009.46"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-642-04128-0_57","volume-title":"Algorithms - ESA 2009","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 635\u2013646. Springer, Heidelberg (2009)"},{"issue":"1","key":"34_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1006\/inco.1997.2669","volume":"139","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., van Leeuwen, J., Tan, R.B., Thilikos, D.M.: On interval routing schemes and treewidth. Information and Computation\u00a0139(1), 92\u2013109 (1997)","journal-title":"Information and Computation"},{"issue":"2","key":"34_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J. Chen","year":"2005","unstructured":"Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D.W., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Information and Computation\u00a0201(2), 216\u2013231 (2005)","journal-title":"Information and Computation"},{"issue":"40-42","key":"34_CR8","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J. Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoretical Computer Science\u00a0411(40-42), 3736\u20133756 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s00224-007-1345-z","volume":"41","author":"F.K.H.A. Dehne","year":"2007","unstructured":"Dehne, F.K.H.A., Fellows, M.R., Langston, M.A., Rosamond, F.A., Stevens, K.: An O(2\n                    O(k)\n                  n\n                  3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory of Computing Systems\u00a041(3), 479\u2013492 (2007)","journal-title":"Theory of Computing Systems"},{"key":"34_CR10","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, vol.\u00a0173. Springer, Heidelberg (2005)"},{"key":"34_CR11","doi-asserted-by":"publisher","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":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-13036-6_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"S. Fiorini","year":"2010","unstructured":"Fiorini, S., Joret, G., Pietropaoli, U.: Hitting Diamonds and Growing Cacti. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 191\u2013204. Springer, Heidelberg (2010)"},{"key":"34_CR13","unstructured":"Fiorini, S., Joret, G., Theis, D.O., Wood, D.R.: Small Minors in Dense Graphs (2010) (manuscript), \n                    \n                      http:\/\/arxiv.org\/abs\/1005.0895"},{"key":"34_CR14","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Philip, G., Saurabh, S.: Hitting forbidden minors: Approximation and Kernelization. In: Proc. of the 28th Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol.\u00a09, pp. 189\u2013200 (2011)"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00453-009-9349-5","volume":"60","author":"Z. Friggstad","year":"2011","unstructured":"Friggstad, Z., Salavatipour, M.: Approximability of packing disjoint cycles. Algorithmica\u00a060, 395\u2013400 (2011)","journal-title":"Algorithmica"},{"issue":"8","key":"34_CR16","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J. Guo","year":"2006","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences\u00a072(8), 1386\u20131396 (2006)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"34_CR17","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? Journal of Computer and System Sciences\u00a063(4), 512\u2013530 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR18","unstructured":"Joret, G., Paul, C., Sau, I., Saurabh, S., Thomass\u00e9, S.: Hitting and Harvesting Pumpkins (2011) (manuscript), \n                    \n                      http:\/\/arxiv.org\/abs\/1105.2704"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Krivelevich, M., Nutov, Z., Salavatipour, M.R., Yuster, J., Yuster, R.: Approximation algorithms and hardness results for cycle packing problems. ACM Transactions on Algorithms\u00a03(4) (2007)","DOI":"10.1145\/1290672.1290685"},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-642-15775-2_47","volume-title":"Algorithms \u2013 ESA 2010","author":"M. Lampis","year":"2010","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 549\u2013560. Springer, Heidelberg (2010)"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal. In: Proc. of the 22nd annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp. 777\u2013789 (2011)","DOI":"10.1137\/1.9781611973082.61"},{"issue":"1","key":"34_CR22","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.: Graph Minors. XIII. The Disjoint Paths Problem. Journal of Combinatorial Theory, Series B\u00a063(1), 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T11:14:32Z","timestamp":1554117272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}