{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:51:00Z","timestamp":1660265460158},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00265-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"119-122","source":"Crossref","is-referenced-by-count":5,"title":["On \u03b1-redundant vertices in P5-free graphs"],"prefix":"10.1016","volume":"82","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Ho\u00e0ng-Oanh","family":"Le","sequence":"additional","affiliation":[]},{"given":"Van Bang","family":"Le","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00265-4_BIB001","series-title":"Combinatorial-Algebraic Methods in Discrete Optimization","first-page":"5","article-title":"On the number of maximal stable sets in graphs from hereditary classes","author":"Alekseev","year":"1991"},{"key":"10.1016\/S0020-0190(01)00265-4_BIB002","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230190206","article-title":"On graphs with polynomially solvable maximum-weight clique problem","volume":"19","author":"Balas","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(01)00265-4_BIB003","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0166-218X(00)00239-0","article-title":"A note on \u03b1-redundant vertices in graphs","volume":"108","author":"Brandst\u00e4dt","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00265-4_BIB004","series-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(01)00265-4_BIB005","series-title":"On the stable set problem in special P5-free graphs, Technical Report RRR 24-2000","author":"Gerber","year":"2000"},{"key":"10.1016\/S0020-0190(01)00265-4_BIB006","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","article-title":"Weighted parameters in (P5,P5)-free graphs","volume":"80","author":"Giakoumakis","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00265-4_BIB007","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0020-0190(96)00197-4","article-title":"Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs","volume":"61","author":"Mosca","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00265-4_BIB008","series-title":"Some results on maximum stable sets in certain P5-free graphs, Manuscript","author":"Mosca","year":"2001"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002654?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002654?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T01:52:38Z","timestamp":1556761958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002654"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00265-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}