{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:09:33Z","timestamp":1648854573764},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1993,9]]},"abstract":"<jats:p> A maximum weighted independent set of a permutation graph is a maximum subset of noncrossing chords in a matching diagram (i.e., a set \u03a6 of chords with end-points on two horizontal lines). The problem of finding, among all noncrossing subsets of \u03a6 with density at most k, one with maximum size is considered, where the density of a subset is the maximum number of chords crossing a vertical line and k is a given parameter. A \u0398(n log n) time and \u0398(n) space algorithm, for solving the problem with n chords, is proposed. As an application, we solve the problem of finding, among all proper subsets with density at most k of an interval graph, one with maximum number of intervals. <\/jats:p>","DOI":"10.1142\/s021819599300018x","type":"journal-article","created":{"date-parts":[[2004,11,22]],"date-time":"2004-11-22T22:29:30Z","timestamp":1101162570000},"page":"291-304","source":"Crossref","is-referenced-by-count":1,"title":["MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS"],"prefix":"10.1142","volume":"03","author":[{"given":"D.T.","family":"LEE","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60208, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MAJID","family":"SARRAFZADEH","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60208, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021819599300018X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:31:04Z","timestamp":1565123464000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021819599300018X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1993,9]]}},"alternative-id":["10.1142\/S021819599300018X"],"URL":"https:\/\/doi.org\/10.1142\/s021819599300018x","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}