{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:34Z","timestamp":1760441074827},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:38:35Z","timestamp":1330295915000},"page":"25-44","source":"Crossref","is-referenced-by-count":8,"title":["On rectangle visibility graphs"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Alice","family":"Dean","sequence":"additional","affiliation":[]},{"given":"Joan","family":"Hutchinson","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Shermer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"3_CR1","unstructured":"T. Biedl. personal communication, 1995."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"P. Bose, A. Dean, J. Hutchinson, and T. Shermer. On rectangle visibility graphs I. k-trees and caterpillar forests. manuscript, 1996.","DOI":"10.1007\/3-540-62495-3_35"},{"key":"3_CR3","unstructured":"A. M. Dean and J. P. Hutchinson. Combinatorial representations of visibility graphs. preprint, 1996."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"A. M. Dean and J. P. Hutchinson. Rectangle-visibility representations of bipartite graphs. Discrete Applied Mathematics, 1996, to appear.","DOI":"10.1016\/S0166-218X(96)00029-7"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(83)90128-0","volume":"46","author":"P. Duchet","year":"1983","unstructured":"P. Duchet, Y. Hamidoune, M. Las Vergnas, and H. Meyniel. Representing a planar graph by vertical lines joining different levels. Discrete Mathematics, 46:319\u2013321, 1983.","journal-title":"Discrete Mathematics"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"CAS-23","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson, and H. C. So. An application of graph coloring to printed circuit testing. IEEE Transactions on Circuits and Systems, CAS-23:591\u2013599, 1976.","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"3_CR7","first-page":"255","volume":"XL-XLI","author":"P. Horak","year":"1982","unstructured":"P. Horak and L. Niepel. A short proof of a linear arboricity theorem for cubic graphs. Acta Math. Univ. Comenian., XL-XLI:255\u2013277, 1982.","journal-title":"Acta Math. Univ. Comenian."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"J. P. Hutchinson, T. Shermer, and A. Vince. On representations of some thickness-two graphs (extended abstract). In F. Brandenburg, editor, Proc. of Workshop on Graph Drawing, volume 1027 of Lecture Notes in Computer Science. Springer-Verlag, 1995.","DOI":"10.1007\/BFb0021815"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(87)90190-7","volume":"64","author":"F. Luccio","year":"1987","unstructured":"F. Luccio, S. Mazzone, and C. K. Wong. A note on visibility graphs. Discrete Mathematics, 64:209\u2013219, 1987.","journal-title":"Discrete Mathematics"},{"key":"3_CR10","unstructured":"T. C. Shermer. On rectangle visibility graphs II. k-hilly and maximum-degree 4. manuscript, 1996."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"T. C. Shermer. On rectangle visibility graphs III. external visibility and complexity. manuscript, 1996.","DOI":"10.1515\/9780773591134-041"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"R. Tamassia and I.G. Tollis. A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry, 1:321\u2013341, 1986.","journal-title":"Discrete and Computational Geometry"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"S. K. Wismath. Characterizing bar line-of-sight graphs. In Proc. 1st Symp. Comp. Geom., pages 147\u2013152. ACM, 1985.","DOI":"10.1145\/323233.323253"},{"key":"3_CR14","unstructured":"S. K. Wismath. Bar-Representable Visibility Graphs and a Related Network Flow Problem. PhD thesis, Department of Computer Science, University of British Columbia, 1989."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:52:35Z","timestamp":1713635555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}