{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:30:41Z","timestamp":1752460241935},"reference-count":14,"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":[[1996,1]]},"DOI":"10.1080\/00207169608804486","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:21:09Z","timestamp":1182817269000},"page":"205-214","source":"Crossref","is-referenced-by-count":21,"title":["A sequential algorithm for finding a maximum weight<i>K<\/i>-independent set on interval graphs"],"prefix":"10.1080","volume":"60","author":[{"given":"Madhumangal","family":"Pal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. P.","family":"Bhattacharjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77615"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"CIT0003","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"Fulkerson D. R.","year":"1965","journal-title":"Pacific J. Math."},{"key":"CIT0004","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1964-055-5"},{"key":"CIT0006","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90124-Z"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90216-I"},{"key":"CIT0009","unstructured":"Hsu, W. L. and Tsai, K. H. 1989.Proceedings of 27th Allerton Conf. on Communication, Control and Computing. A linear time algorithm for the two-track assignment problem. 1989. pp.291\u2013300."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90012-4"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/0405022"},{"key":"CIT0012","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970401","volume-title":"Graph Theory and its Application to Problems of Society","author":"Roberts F. S.","year":"1978"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1109\/43.31548"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90107-4"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169608804486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T19:51:30Z","timestamp":1556567490000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169608804486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":14,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1080\/00207169608804486"],"URL":"https:\/\/doi.org\/10.1080\/00207169608804486","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}