{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:40Z","timestamp":1725677620658},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_21","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"224-234","source":"Crossref","is-referenced-by-count":0,"title":["Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations"],"prefix":"10.1007","author":[{"given":"Chihao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hongyang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-9130-6","volume":"55","author":"J. Chen","year":"2009","unstructured":"Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica\u00a055(1), 1\u201313 (2009)","journal-title":"Algorithmica"},{"issue":"5","key":"21_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1411509.1411511","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. Journal of the ACM (JACM)\u00a055(5), 21 (2008)","journal-title":"Journal of the ACM (JACM)"},{"key":"21_CR3","unstructured":"Demaine, E., Gutin, G., Marx, D., Stege, U.: Open problems from dagstuhl seminar 07281, available electronically, Technical report, \n                  \n                    http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2007\/1254\/pdf\/07281"},{"key":"21_CR4","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, New York (1999)"},{"key":"21_CR5","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer-Verlag New York Inc. (2006)"},{"issue":"8","key":"21_CR6","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., Huffner, 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"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Guo, J., Moser, H., Niedermeier, R.: Iterative compression for exactly solving np-hard minimization problems. Algorithmics of Large and Complex Networks, 65\u201380 (2009)","DOI":"10.1007\/978-3-642-02094-0_4"},{"issue":"2","key":"21_CR8","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. Theoretical Computer Science\u00a0289(2), 997\u20131008 (2002)","journal-title":"Theoretical Computer Science"},{"key":"21_CR9","unstructured":"Mahajan, M., Raman, V.: Parametrizing above guaranteed values: Maxsat and maxcut. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a04 (1997)"},{"issue":"3","key":"21_CR10","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"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Marx, D.: Important separators and parameterized algorithms (February 2011), \n                  \n                    http:\/\/www.cs.bme.hu\/~dmarx\/papers\/marx-mds-separators-slides.pdf","DOI":"10.1007\/978-3-642-25870-1_2"},{"key":"21_CR12","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, vol.\u00a031. Oxford University Press, USA (2006)"},{"issue":"8","key":"21_CR13","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.jcss.2009.04.002","volume":"75","author":"I. Razgon","year":"2009","unstructured":"Razgon, I., O\u2019Sullivan, B.: Almost 2-sat is fixed-parameter tractable. Journal of Computer and System Sciences\u00a075(8), 435\u2013450 (2009)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"21_CR14","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"},{"key":"21_CR15","unstructured":"Wernicke, S.: On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems. PhD thesis (2003)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:14:03Z","timestamp":1620126843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}