{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:49:04Z","timestamp":1672429744402},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0925-7721(95)00017-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"99-122","source":"Crossref","is-referenced-by-count":3,"title":["Determining bar-representability for ordered weighted graphs"],"prefix":"10.1016","volume":"6","author":[{"given":"David G.","family":"Kirkpatrick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen K.","family":"Wismath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00017-8_BIB1","series-title":"The Design and Analysis of Algorithms","author":"Aho","year":"1974"},{"issue":"1","key":"10.1016\/0925-7721(95)00017-8_BIB2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0166-218X(92)90018-6","article-title":"Some results on visibility graphs","volume":"40","author":"Andreas","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0925-7721(95)00017-8_BIB3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(83)90128-0","article-title":"Representing a planar graph by vertical lines joining different levels","volume":"46","author":"Duchet","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0925-7721(95)00017-8_BIB4","article-title":"Visibility graph recognition","author":"Everett","year":"1990"},{"key":"10.1016\/0925-7721(95)00017-8_BIB5","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\/0925-7721(95)00017-8_BIB6","article-title":"Sequential separability of directional convex objects with restricted motion","author":"Foldes","year":"1989","journal-title":"GERAD technical report, G-89-21"},{"key":"10.1016\/0925-7721(95)00017-8_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0925-7721(95)00017-8_BIB8","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","article-title":"An application of graph coloring to printed circuit testing","volume":"23","author":"Garey","year":"1976","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/0925-7721(95)00017-8_BIB9","article-title":"On recognizing and characterizing visibility graphs of simple polygons","author":"Ghosh","year":"1986","journal-title":"The Johns Hopkins University\/EECS Technical Report 86\/14"},{"key":"10.1016\/0925-7721(95)00017-8_BIB10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF02187912","article-title":"Establishing order in planar subdivisions","volume":"3","author":"Kirkpatrick","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00017-8_BIB11","series-title":"Determining bar-representability for unordered graphs","author":"Kirkpatrick","year":"1991"},{"key":"10.1016\/0925-7721(95)00017-8_BIB12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(87)90190-7","article-title":"A note on visibility graphs","volume":"64","author":"Luccio","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0925-7721(95)00017-8_BIB13","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/0925-7721(95)00017-8_BIB14","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(95)00017-8_BIB15","series-title":"Order 4","first-page":"319","article-title":"Representing orders on the plane by translating convex figures","author":"Rival","year":"1988"},{"key":"10.1016\/0925-7721(95)00017-8_BIB16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","article-title":"Rectilinear planar layouts and bipolar orientations of planar graphs","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00017-8_BIB17","unstructured":"M. Schlag, F. Luccio, P. Maestrini, D.T. Lee and C.K. Wong, A visibility problem in VLSI layout compaction, Advances in Computing Research 2, 259\u2013282."},{"key":"10.1016\/0925-7721(95)00017-8_BIB18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00017-8_BIB19","series-title":"Proc. 1st ACM Symp. Comput. Geom.","first-page":"147","article-title":"Characterizing bar line-of-sight graphs","author":"Wismath","year":"1985"},{"key":"10.1016\/0925-7721(95)00017-8_BIB20","article-title":"Bar-representable visibility graphs and a related network flow problem","author":"Wismath","year":"1989"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000178?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000178?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:24:46Z","timestamp":1555197886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0925772195000178"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00017-8","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}