{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:48:06Z","timestamp":1760597286186},"reference-count":20,"publisher":"Informa UK Limited","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1080\/00207169108803967","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:17:22Z","timestamp":1182817042000},"page":"163-175","source":"Crossref","is-referenced-by-count":26,"title":["An algorithm for finding a maximum weighted independent set in an arbitrary graph"],"prefix":"10.1080","volume":"38","author":[{"given":"Panos M.","family":"Pardalos","sequence":"first","affiliation":[]},{"given":"Nisha","family":"Desai","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.522"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/0215075"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"CIT0004","author":"Carraghan R.","year":"1990","journal-title":"Operations Research Letters"},{"key":"CIT0005","author":"Friden C.","year":"1989","journal-title":"Dep. de Math."},{"key":"CIT0006","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030305"},{"key":"CIT0008","first-page":"79","volume-title":"Lecture Notes in Economics and Mathematical Systems 304","author":"Gendreau M.","year":"1988"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/BF02248731"},{"key":"CIT0010","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel M.","year":"1988"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589347"},{"key":"CIT0012","first-page":"167","author":"Kopf R.","year":"1987","journal-title":"Foundations of Control Engineering"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1080\/00207168208803311"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1080\/00207169008803851"},{"key":"CIT0015","volume-title":"A branch and bound algorithm for the maximum clique problem. Technical Report","author":"Pardalos P. M."},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1007\/BF02247879"},{"key":"CIT0017","first-page":"131","volume-title":"Impact of Recent Computer Advances on Operations Research","author":"Pardalos P. M.","year":"1989"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023057"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1137\/0206038"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169108803967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T19:20:07Z","timestamp":1497727207000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169108803967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["10.1080\/00207169108803967"],"URL":"https:\/\/doi.org\/10.1080\/00207169108803967","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}