{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T22:06:50Z","timestamp":1769983610773,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,12,5]],"date-time":"2016-12-05T00:00:00Z","timestamp":1480896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,12,5]],"date-time":"2016-12-05T00:00:00Z","timestamp":1480896000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003512","name":"State Administration of Foreign Experts Affairs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003512","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 08-38434"],"award-info":[{"award-number":["DMS 08-38434"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00373-016-1745-4","type":"journal-article","created":{"date-parts":[[2016,12,5]],"date-time":"2016-12-05T05:18:33Z","timestamp":1480915113000},"page":"221-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Bar Visibility Numbers for Hypercubes and Outerplanar Digraphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Douglas B.","family":"West","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer I.","family":"Wise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,5]]},"reference":[{"key":"1745_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0166-218X(92)90018-6","volume":"40","author":"T Andreae","year":"1992","unstructured":"Andreae, T.: Some results on visibility graphs. Discret. Appl. Math. 40, 5\u201317 (1992)","journal-title":"Discret. Appl. Math."},{"key":"1745_CR2","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1137\/120864234","volume":"27","author":"M Axenovich","year":"2013","unstructured":"Axenovich, M., Beveridge, A., Hutchinson, J.P., West, D.B.: Visibility number of directed graphs. SIAM J. Discret. Math. 27, 1429\u20131449 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"1745_CR3","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1137\/S0895480198343455","volume":"18","author":"YW Chang","year":"2004","unstructured":"Chang, Y.W., Hutchinson, J.P., Jacobson, M.S., Lehel, J., West, D.B.: The bar visibility number of a graph. SIAM J. Discret. Math. 18, 462\u2013471 (2004)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"1745_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.dam.2004.12.004","volume":"148","author":"JP Hutchinson","year":"2005","unstructured":"Hutchinson, J.P.: A note on rectilinear and polar visibility graphs. Discret. Appl. Math. 148(3), 263\u2013272 (2005)","journal-title":"Discret. Appl. Math."},{"key":"1745_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/S0021-9800(67)80010-3","volume":"3","author":"M Kleinert","year":"1967","unstructured":"Kleinert, M.: Die Dicke des n-dimensionalen Wrfel-Graphen. (German). J. Combinatorial Theory. 3, 10\u201315 (1967)","journal-title":"J. Combinatorial Theory."},{"key":"1745_CR6","unstructured":"Luccio F., Mazzone S., Wong C. K.: Visibility graphs. Prog. Naz. Teoria degli Algoritmi, Report 9. University of Pisa (1983)"},{"key":"1745_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(87)90190-7","volume":"64","author":"F Luccio","year":"1987","unstructured":"Luccio, F., Mazzone, S., Wong, C.K.: A note on visibility graphs. Discret. Math. 64, 209\u2013219 (1987)","journal-title":"Discret. Math."},{"key":"1745_CR8","unstructured":"Melnikov L.S.: Problem at the 6th Hungarian Colloquium on Combinatorics (1981)"},{"key":"1745_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discret. Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Discret. Comput. Geom."},{"key":"1745_CR10","doi-asserted-by":"crossref","unstructured":"Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Proc. ACM Symposium on Computational Geometry, pp. 147\u2013152. ACM, Baltimore (1985)","DOI":"10.1145\/323233.323253"},{"key":"1745_CR11","unstructured":"Wismath S. K.: Bar-representable visibility graphs and a related network flow problem. PhD thesis, U. British Columbia (1989)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1745-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1745-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1745-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:54:19Z","timestamp":1589446459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1745-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1745"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1745-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,5]]},"assertion":[{"value":"19 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}