{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:23Z","timestamp":1725512123799},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_1","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T06:22:17Z","timestamp":1210054937000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM\u00a042, 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"#cr-split#-1_CR2.1","doi-asserted-by":"crossref","unstructured":"Chen, J., Fomin, F., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 422\u2013433. Springer, Heidelberg (2007);","DOI":"10.1007\/978-3-540-73951-7_37"},{"key":"#cr-split#-1_CR2.2","unstructured":"Journal version is to appear in Journal of Computer and System Sciences"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00453-004-1096-z","volume":"40","author":"J. Chen","year":"2004","unstructured":"Chen, J., Friesen, D., Kanj, I., Jia, W.: Using nondeterminism to design efficient deterministic algorithms. Algorithmica\u00a040, 83\u201397 (2004)","journal-title":"Algorithmica"},{"key":"#cr-split#-1_CR4.1","doi-asserted-by":"crossref","unstructured":"Chen, J., Liu, Y., Lu, S.: An improved paraeterized 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);","DOI":"10.1007\/978-3-540-73951-7_43"},{"key":"#cr-split#-1_CR4.2","unstructured":"Journal version is to appear in Algorithmica"},{"key":"#cr-split#-1_CR5.1","doi-asserted-by":"crossref","unstructured":"Chen, J., Lu, S.: Improved algorithms for weighted and unweighted set splitting problems. In: Lin, G. (ed.) COCOON. LNCS, vol.\u00a04598, pp. 537\u2013547. Springer, Heidelberg (2007);","DOI":"10.1007\/978-3-540-73545-8_52"},{"key":"#cr-split#-1_CR5.2","unstructured":"Journal version is to appear in Algorithmica"},{"key":"1_CR6","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 298\u2013307 (2007)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","first-page":"127","volume-title":"Parameterized and Exact Computation","author":"F. Dehne","year":"2004","unstructured":"Dehne, F., Fellows, M., Rosamond, F., Shaw, P.: Greedy localization, iterative compression, modeled crown reductions: New FPT techniques, and improved algorithm for set splitting, and a novel 2k kernelization of vertex cover. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 127\u2013137. Springer, Heidelberg (2004)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-73420-8_4","volume-title":"Automata, Languages and Programming","author":"F. Dorn","year":"2007","unstructured":"Dorn, F., Fomin, F., Thilikos, D.: Subexponential parameterized algorithms. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 15\u201327. Springer, Heidelberg (2007)"},{"key":"1_CR9","doi-asserted-by":"crossref","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)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Fellows","year":"2003","unstructured":"Fellows, M.: Blow-ups, win\/win\u2019s, and crown rules: Some new directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 1\u201312. Springer, Heidelberg (2003)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11917496_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2006","unstructured":"Kneis, J., Molle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 58\u201367. Springer, Heidelberg (2006)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proc. 36th IEEE Symp. on Foundations of Computer Science (FOCS 1995), pp. 182\u2013190 (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"key":"1_CR13","doi-asserted-by":"crossref","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":"1_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. Oper. Res. Lett.\u00a032, 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."}],"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_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:29:57Z","timestamp":1619508597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79723-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797227","9783540797234"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79723-4_1","relation":{},"subject":[]}}