{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:40:32Z","timestamp":1771026032930,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00307-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"223-230","source":"Crossref","is-referenced-by-count":17,"title":["Proper interval graphs and the guard problem"],"prefix":"10.1016","volume":"170","author":[{"given":"Chiuyuan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Chin-Chen","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00307-X_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(83)90078-9","article-title":"Finding hamiltonian circuits in proper interval graphs","volume":"17","author":"Bertossi","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(96)00307-X_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00307-X_BIB3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0012-365X(96)00307-X_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","article-title":"Simple linear time recognition of unit interval graphs","volume":"55","author":"Corneil","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(96)00307-X_BIB5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0020-0190(95)00133-W","article-title":"A linear-time algorithm for proper interval graph recognition","volume":"56","author":"de Figueiredo","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(96)00307-X_BIB6","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/jgt.3190150508","article-title":"Covering the edges with consecutive sets","volume":"15","author":"Ding","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00307-X_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(90)90026-B","article-title":"Recognizing visibility graphs of spiral polygons","volume":"11","author":"Everett","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(96)00307-X_BIB8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(96)00307-X_BIB9","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\/S0012-365X(96)00307-X_BIB10","article-title":"Watchmen routes in spiral polygons","author":"Nilsson","year":"1990"},{"key":"10.1016\/S0012-365X(96)00307-X_BIB11","series-title":"Proc. 2nd Canadian Conf. Computational Geometry","first-page":"269","article-title":"Optimum Watchmen routes in spiral polygons","author":"Nilsson","year":"1990"},{"key":"10.1016\/S0012-365X(96)00307-X_BIB12","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S0012-365X(96)00307-X_BIB13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0095-8956(71)90010-4","article-title":"On the compatibility between a graph and a simple order","volume":"11","author":"Roberts","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00307-X_BIB14","first-page":"1384","article-title":"Recent results in art galleries","volume":"80","author":"Shermer","year":"1992"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600307X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600307X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:26:58Z","timestamp":1553196418000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600307X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X9600307X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00307-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}