{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:35:30Z","timestamp":1757630130601,"version":"3.44.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6010,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/0925-7721(95)00033-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"161-172","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Visibility graphs of towers"],"prefix":"10.1016","volume":"7","author":[{"given":"Paul","family":"Colley","sequence":"first","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Jeremy","family":"Spinrad","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1992","series-title":"Visibility graphs of staircase polygons and the weak Bruhat order I: from visibility graphs to maximal chains","author":"Abello","key":"10.1016\/0925-7721(95)00033-X_BIB1"},{"year":"1992","series-title":"Visibility graphs of staircase polygons and the weak Bruhat order II: from maximal chains to polygons","author":"Abello","key":"10.1016\/0925-7721(95)00033-X_BIB2"},{"key":"10.1016\/0925-7721(95)00033-X_BIB3","first-page":"165","article-title":"Bipartite permutation graphs are bipartite tolerance graphs","volume":"58","author":"Brandst\u00e4dt","year":"1987","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0925-7721(95)00033-X_BIB4_1","series-title":"3rd Internat. Symp. Algorithms Comput. (ISAAC)","article-title":"Characterizing and recognizing the visibility graphs of a funnel-shaped polygon","author":"Choi","year":"1992"},{"key":"10.1016\/0925-7721(95)00033-X_BIB4_2","unstructured":"Also, Technical Report CS-TR-92-71, Computer Science Department, Korea Advanced Institute of Science and Technology, Seoul, Republic of Korea, Submitted for publication."},{"article-title":"Visibility graphs of uni-monotone polygons","year":"1991","author":"Colley","key":"10.1016\/0925-7721(95)00033-X_BIB5"},{"key":"10.1016\/0925-7721(95)00033-X_BIB6","series-title":"Proc. 4th Canad. Conf. Comput. Geom.","first-page":"29","article-title":"Recognizing visibility graphs of unimonotone polygons","author":"Colley","year":"1992"},{"key":"10.1016\/0925-7721(95)00033-X_BIB7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1142\/S0218195992000202","article-title":"Distance visibility graphs","volume":"2","author":"Coullard","year":"1992","journal-title":"Internat. J. Comput. Geom. Appl."},{"year":"1951","series-title":"What is Mathematics? An Elementary Approach to Ideas and Methods","author":"Courant","key":"10.1016\/0925-7721(95)00033-X_BIB8"},{"article-title":"Hierarchical decomposition of polygons with applications","year":"1985","author":"El-Gindy","key":"10.1016\/0925-7721(95)00033-X_BIB9"},{"article-title":"Visibility graph recognition","year":"1990","author":"Everett","key":"10.1016\/0925-7721(95)00033-X_BIB10"},{"key":"10.1016\/0925-7721(95)00033-X_BIB11","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"},{"year":"1991","series-title":"Recovery of convexity from external visibility graphs","author":"Everett","key":"10.1016\/0925-7721(95)00033-X_BIB12"},{"key":"10.1016\/0925-7721(95)00033-X_BIB13","first-page":"96","article-title":"On recognizing and characterizing visibility graphs of simple polygons","volume":"318","author":"Ghosh","year":"1988"},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/0925-7721(95)00033-X_BIB14"},{"year":"1992","series-title":"Complexity aspects of visibility graphs","author":"Lin","key":"10.1016\/0925-7721(95)00033-X_BIB15"},{"year":"1987","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","key":"10.1016\/0925-7721(95)00033-X_BIB16"},{"key":"10.1016\/0925-7721(95)00033-X_BIB17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/152992.152994","article-title":"Computational geometry column 18","volume":"24","author":"O'Rourke","year":"1993","journal-title":"SIGACT News"},{"year":"1985","series-title":"Computational Geometry: an Introduction","author":"Preparata","key":"10.1016\/0925-7721(95)00033-X_BIB18"},{"key":"10.1016\/0925-7721(95)00033-X_BIB19","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0925-7721(95)00033-X_BIB20","series-title":"Order 3","first-page":"359","article-title":"A linear time algorithm to find the jump number of two dimensional partial orders","author":"Steiner","year":"1987"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219500033X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219500033X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T16:39:53Z","timestamp":1757522393000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219500033X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["092577219500033X"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00033-x","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[1997,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Visibility graphs of towers","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0925-7721(95)00033-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}