乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:48Z","timestamp":1725536808614},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_28","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"319-330","source":"Crossref","is-referenced-by-count":1,"title":["A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Hannes","family":"Moser","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J. Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett.\u00a058(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"28_CR3","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.\u00a0Comput. System Sci.\u00a074(7), 1188\u20131198 (2008)","journal-title":"J.\u00a0Comput. System Sci."},{"issue":"5","key":"28_CR4","first-page":"19","volume":"55","author":"J. Chen","year":"2008","unstructured":"Chen, J., Liu, Y., Lu, S., O\u2019Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J.\u00a0ACM\u00a055(5), Article 21, 19 (2008)","journal-title":"J.\u00a0ACM"},{"issue":"3","key":"28_CR5","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 O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. Theory Comput. Syst.\u00a041(3), 479\u2013492 (2007)","journal-title":"Theory Comput. Syst."},{"key":"28_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"28_CR7","unstructured":"Greenwell, D.L., Hemminger, R.L., Klerlein, J.B.: Forbidden subgraphs. In: Proc. 4th CGTC, pp. 389\u2013394 (1973)"},{"issue":"8","key":"28_CR8","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. J.\u00a0Comput. System Sci.\u00a072(8), 1386\u20131396 (2006)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Guo, J., Moser, H., Niedermeier, R.: Iterative compression for exactly solving NP-hard minimization problems. In: Algorithmics of Large and Complex Networks. LNCS, vol.\u00a05515, pp. 65\u201380. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02094-0_4"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. (2009); available electronically","DOI":"10.1007\/s00224-008-9150-x"},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/S0304-3975(01)00414-5","volume":"289","author":"S. Khot","year":"2002","unstructured":"Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci.\u00a0289(2), 997\u20131008 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J.M. Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J.\u00a0Comput. System Sci.\u00a020(2), 219\u2013230 (1980)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica (2009); available electronically","DOI":"10.1007\/s00453-008-9233-8"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-74839-7_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Marx","year":"2007","unstructured":"Marx, D., Schlotter, I.: Obtaining a planar graph by vertex deletion. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 292\u2013303. Springer, Heidelberg (2007)"},{"key":"28_CR15","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 University Press, Oxford (2006)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Razgon, I., O\u2019Sullivan, B.: Almost 2-SAT is fixed-parameter tractable. J.\u00a0Comput. System Sci. (2009); available electronically","DOI":"10.1007\/978-3-540-70575-8_45"},{"issue":"4","key":"28_CR17","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. Oper. Res. Lett.\u00a032(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:33:46Z","timestamp":1558478026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}