{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:49:24Z","timestamp":1758268164032},"reference-count":20,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1137\/0402033","type":"journal-article","created":{"date-parts":[[2005,2,23]],"date-time":"2005-02-23T10:58:14Z","timestamp":1109156294000},"page":"371-392","source":"Crossref","is-referenced-by-count":28,"title":["Perfect Graphs and Orthogonally Convex Covers"],"prefix":"10.1137","volume":"2","author":[{"given":"Rajeev","family":"Motwani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Raghunathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huzur","family":"Saran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","reference":[{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0602026"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0605018"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/0602042"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804396"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80012-1"},{"key":"R11","unstructured":"Michael R. Garey, David S. Johnson, Computers and intractability, W. H. Freeman and Co., San Francisco, Calif., 1979, 53\u201356, A Guide to the Theory of NP-completeness80g:680560411.68039"},{"key":"R12","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic Martin Charles","year":"1980"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90039-X"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90050-4"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788689"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-87806-9.50012-8"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/0214056"},{"key":"R20","first-page":"55","volume-title":"Selected topics in graph theory, 2","author":"Lov\u00e1sz L.","year":"1983"},{"key":"R22","volume-title":"Art gallery theorems and algorithms","author":"O'Rourke Joseph","year":"1987"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1137\/0603034"},{"key":"R27","unstructured":"Alexander Schrijver, Theory of linear and integer programming, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons Ltd., Chichester, 1986, 170\u201317188m:900900665.90063"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1137\/0603027"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056648"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0402033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T12:02:29Z","timestamp":1485691349000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0402033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["10.1137\/0402033"],"URL":"https:\/\/doi.org\/10.1137\/0402033","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}