{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:13:56Z","timestamp":1766578436563},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_30","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"313-324","source":"Crossref","is-referenced-by-count":45,"title":["Vertex Cover: Further Observations and Further Improvements"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[]},{"given":"Iyad A.","family":"Kanj","sequence":"additional","affiliation":[]},{"given":"Weijia","family":"Jia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","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. R., and Raman, V.: An Improved Fixed Parameter Algorithm for Vertex Cover. Information Processing Letters 65 (1998) 163\u2013168 313, 314, 315","journal-title":"Information Processing Letters"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0222038","volume":"22","author":"J. F. Buss","year":"1993","unstructured":"Buss, J. F. and Goldsmith, J.: Nondeterminism within P. SIAM Journal on Computing 22 (1993) 560\u2013572 313, 314","journal-title":"SIAM Journal on Computing"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Chen, J., Kanj, I. A., and Jia, W.: Vertex Cover: Further Observation and Further Improvements. Tech. Rep., Dept. of Computer Science, Texas A&M University (1999) 317, 318, 320","DOI":"10.1007\/3-540-46784-X_30"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R. G. Downey","year":"1995","unstructured":"Downey, R. G. and Fellows, M. R.: Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM Journal on Computing 24 (1995) 873\u2013921 313, 323","journal-title":"SIAM Journal on Computing"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R. G. and Fellows, M. R.: Parameterized Computational Feasibility, In: Clote P. and Remmel J. (eds.): Feasible Mathematics II. Boston, Birkhauser (1995) 219\u2013244 313, 323","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Downey, R. G., Fellows, M. R., and Stege, U.: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. In: Roberts, F., Kratochvil, J., and Nesetril, J. (eds.): Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. AMS-DIMACS Proceedings Series 49 (1999) 49\u201399 313, 314, 314, 315","DOI":"10.1090\/dimacs\/049\/04"},{"key":"30_CR7","unstructured":"Hallett, M., Gonnet, G., and Stege, U.: Vertex Cover Revisited: A Hybrid Algorithm of Theory and Heuristic. Manuscript. (1998) 313"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1109\/TC.1986.1676847","volume":"35","author":"T. Jian","year":"1986","unstructured":"Jian, T.: An O(20.304n ) Algorithm for Solving Maximum Independent Set Problem. IEEE Trans. Comput. 35 (1986) 847\u2013851 314, 323","journal-title":"IEEE Trans. Comput."},{"key":"30_CR9","volume-title":"The Art of Computer Programming","author":"D. E. Knuth","year":"1968","unstructured":"Knuth, D. E.: The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, Mass. (1968) 321, 321"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Niedermeier, R. and Rossmanith, P.: Upper Bounds for Vertex Cover Further Improved. Proc. of the 16th Symposium on Theoretical Aspects of Computer Science (STACS\u201999). Lecture Notes in Computer Science 1563 (1999) 561\u2013570 313, 314, 314, 315, 321","DOI":"10.1007\/3-540-49116-3_53"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G. L. Nemhauser","year":"1975","unstructured":"Nemhauser, G. L. and Trotter, L. E.: Vertex Packing: Structural Properties and Algorithms. Mathematical Programming 8 (1975) 232\u2013248 314, 314","journal-title":"Mathematical Programming"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J. M. Robson","year":"1986","unstructured":"Robson, J. M.: Algorithms for Maximum Independent Sets. Journal of Algorithms 7 (1986) 425\u2013440 314, 314, 314, 321, 323, 324","journal-title":"Journal of Algorithms"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/scj.4690210301","volume":"21","author":"M. Shindo","year":"1990","unstructured":"Shindo, M. and Tomita, E.: A Simple Algorithm for Finding A Maximum Clique and Its Worst-Case Time Complexity. Sys. and Comp. in Japan 21 (1990) 1\u201313 314, 323","journal-title":"Sys. and Comp. in Japan"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"R. E. Tarjan","year":"1977","unstructured":"Tarjan, R. E. and Trojanowski, A. E.: Finding A Maximum Independent Set. SIAM Journal on Computing 6 (1977) 537\u2013546 313, 323","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:38:10Z","timestamp":1556321890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}