{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:13:12Z","timestamp":1766578392367},"reference-count":12,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1002\/1097-0037(200007)35:4<253::aid-net3>3.0.co;2-k","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T19:43:55Z","timestamp":1030304635000},"page":"253-259","source":"Crossref","is-referenced-by-count":29,"title":["Improvement on vertex cover for low-degree graphs"],"prefix":"10.1002","volume":"35","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[]},{"given":"Lihua","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Weijia","family":"Jia","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(97)00213-5","volume":"65","author":"Balasubramanian","year":"1998","journal-title":"Info Process Lett"},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0222038","volume":"22","author":"Buss","year":"1993","journal-title":"SIAM J Comput"},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB3","series-title":"Lecture Notes","first-page":"313","volume-title":"Vertex cover: Further observation and further improvements","volume":"1665","author":"Chen","year":"1999","unstructured":"and Vertex cover: Further observation and further improvements, Lecture Notes in Computer Science 1665 (WG'99), Springer, Berlin, 1999, pp. 313-324."},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB4","series-title":"Feasible math","first-page":"219","volume":"II","author":"Downey","year":"1995","unstructured":"and ?Parameterized computational feasibility,? Feasible mathematics II, and (Editors), Birkhauser, Boston, 1995, pp. 219-244."},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"Downey","year":"1999","unstructured":"and Parameterized complexity, Springer-Verlag, New York, 1999."},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB6","series-title":"AMS-DIMACS Pr","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1090\/dimacs\/049\/04","volume-title":"Contemporary trends in discrete mathematics: From DIMACS and DIMATIA to the future","volume":"49","author":"Downey","year":"1999","unstructured":"and ?Parameterized complexity: A framework for systematically confronting computational intractability,? Contemporary trends in discrete mathematics: From DIMACS and DIMATIA to the future, and (Editors), AMS-DIMACS Proceedings Series 49, AMS, 1999, pp. 49-99."},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB7","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979","unstructured":"and Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979."},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB8","volume-title":"The art of computer programming","volume":"1","author":"Knuth","year":"1968","unstructured":"The art of computer programming, Addison-Wesley, Reading, MA, 1968, Vol. 1."},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB9","series-title":"Lecture Notes","first-page":"561","volume":"1563","author":"Niedermeier","year":"1999","unstructured":"and ?Upper bounds for vertex cover further improved,? Lecture Notes in Computer Science 1563 (STACS'99), Springer, Berlin, 1999, pp. 561-570."},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB10","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math Program"},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"Robson","year":"1986","journal-title":"J Alg"},{"key":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K-BIB12","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"Tarjan","year":"1977","journal-title":"SIAM J Comput"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1097-0037(200007)35:4%3C253::AID-NET3%3E3.0.CO;2-K","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1097-0037(200007)35:4%3C253::AID-NET3%3E3.0.CO;2-K","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:45:38Z","timestamp":1625136338000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,7]]}},"URL":"https:\/\/doi.org\/10.1002\/1097-0037(200007)35:4<253::aid-net3>3.0.co;2-k","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}