{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:11:16Z","timestamp":1760440276709},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8567,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1016\/0022-0000(90)90017-f","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"19-48","source":"Crossref","is-referenced-by-count":40,"title":["Covering orthogonal polygons with star polygons: The perfect graph approach"],"prefix":"10.1016","volume":"40","author":[{"given":"Rajeev","family":"Motwani","sequence":"first","affiliation":[]},{"given":"Arvind","family":"Raghunathan","sequence":"additional","affiliation":[]},{"given":"Huzur","family":"Saran","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90017-F_BIB1","article-title":"The Art Gallery Theorem: Its Variations, Applications and Algorithmic Aspects","author":"Aggarwal","year":"1984"},{"key":"10.1016\/0022-0000(90)90017-F_BIB2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/0602026","article-title":"Covering regions with squares","volume":"2","author":"Albertson","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0022-0000(90)90017-F_BIB3","doi-asserted-by":"crossref","DOI":"10.1137\/0605018","article-title":"It's hard to color antirectangles","volume":"5","author":"Boucher","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0022-0000(90)90017-F_BIB4","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1137\/0602042","article-title":"Covering regions by rectangles","volume":"2","author":"Chaiken","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0022-0000(90)90017-F_BIB5","series-title":"Proceedings, 11th Annual ACM Symposium on Theory of Computing","first-page":"38","article-title":"Decomposing a polygon into its convex parts","author":"Chazelle","year":"1979"},{"key":"10.1016\/0022-0000(90)90017-F_BIB6","article-title":"Computational Geometry and Convexity","author":"Chazelle","year":"1980"},{"key":"10.1016\/0022-0000(90)90017-F_BIB7","article-title":"Dent Diagrams: A Unified Approach to Polygon Covering Problems","author":"Culberson","year":"1987"},{"key":"10.1016\/0022-0000(90)90017-F_BIB8","series-title":"29th IEEE Symp. on Foundations of Computer Science","article-title":"Covering polygons is hard","author":"Culberson","year":"1988"},{"key":"10.1016\/0022-0000(90)90017-F_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","article-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0022-0000(90)90017-F_BIB10","series-title":"Proceedings, Sixteenth Annual ACM Symposium on Theory of Computing","first-page":"167","article-title":"An algorithm for constructing regions with rectangles Independence and minimum generating sets for collection of intervals","author":"Franzblau","year":"1984"},{"key":"10.1016\/0022-0000(90)90017-F_BIB11","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90017-F_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0022-0000(90)90017-F_BIB13","unstructured":"E. Gy\u00f3ri, A minimax theorem of new type, to appear."},{"key":"10.1016\/0022-0000(90)90017-F_BIB14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"39","author":"Hayward","year":"1985","journal-title":"J. Conibin. Theory Ser. B"},{"key":"10.1016\/0022-0000(90)90017-F_BIB15","series-title":"Computational Geometry","article-title":"Minimum decompositions of polygonal objects","author":"Keil","year":"1985"},{"key":"10.1016\/0022-0000(90)90017-F_BIB16","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1137\/0214056","article-title":"Decomposing a polygon into simpler components","volume":"14","author":"Keil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90017-F_BIB17","series-title":"Proceedings, 2nd Annual ACM Symp. on Computational Geometry","first-page":"43","article-title":"Minimally covering a horizontally convex orthogonal polygon","author":"Keil","year":"1986"},{"key":"10.1016\/0022-0000(90)90017-F_BIB18","first-page":"55","article-title":"Perfect graphs","volume":"2","author":"Lov\u00e1sz","year":"1983"},{"key":"10.1016\/0022-0000(90)90017-F_BIB19","first-page":"108","article-title":"\u00dcber den zweidimensionalen topologischen Satz von Helly","volume":"8","author":"Molnar","year":"1957","journal-title":"Mat. Lapok"},{"key":"10.1016\/0022-0000(90)90017-F_BIB20","article-title":"Perfect graphs and orthogonally convex covers","volume":"14","author":"Motwani","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0022-0000(90)90017-F_BIB21","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/0022-0000(90)90017-F_BIB22","unstructured":"A. RAGHUNATHAN, Algorithms for weakly triangulated graphs, J. Algorithms, in press."},{"key":"10.1016\/0022-0000(90)90017-F_BIB23","series-title":"Proceedings, 3rd Annual ACM Symposium on Computational Geometry","first-page":"268","article-title":"Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons","author":"Reckhow","year":"1987"},{"key":"10.1016\/0022-0000(90)90017-F_BIB24","article-title":"Covering Orthogonally Convex Polygons with Three Orientations of Dents","author":"Reckhow","year":"1987"},{"key":"10.1016\/0022-0000(90)90017-F_BIB25","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90017-F_BIB26","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1137\/0603034","article-title":"A class of perfect graphs associated with planar rectilinear regions","volume":"3","author":"Saks","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0022-0000(90)90017-F_BIB27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0603027","article-title":"A class of perfect graphs","volume":"3","author":"Shearer","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"No. 2","key":"10.1016\/0022-0000(90)90017-F_BIB28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","article-title":"Some NP-hard polygon decompositions problems","volume":"IT-29","author":"O'Rourke","year":"1983","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090017F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090017F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:55:29Z","timestamp":1550307329000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090017F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["002200009090017F"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90017-f","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}