{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:15Z","timestamp":1760441055012},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_367","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:54:46Z","timestamp":1330257286000},"page":"159-166","source":"Crossref","is-referenced-by-count":5,"title":["Rectangle-visibility representations of bipartite graphs"],"prefix":"10.1007","author":[{"given":"Alice M.","family":"Dean","sequence":"first","affiliation":[]},{"given":"Joan P.","family":"Hutchinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0166-218X(92)90018-6","volume":"40","author":"T. Andreae","year":"1992","unstructured":"T. Andreae, Some results on visibility graphs, Disc. Appl. Math. 40 (1992), 5\u201318.","journal-title":"Disc. Appl. Math."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0305004100037385","volume":"60","author":"L. W. Beineke","year":"1964","unstructured":"L. W. Beineke, F. Harary, and J. W. Moon, On the thickness of the complete bipartite graph, Proc. Cambridge Philo. Soc. 60 (1964), 1\u20135.","journal-title":"Proc. Cambridge Philo. Soc."},{"key":"17_CR3","unstructured":"P. Bose, A. Josefczyk, J. Miller, and J. O'Rourke, K\n42\nis a box visibility graph, Tech. Report #034, Smith College (1994)."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"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 Trans. Circuits and Systems CAS-23 (1976), 591\u2013599.","journal-title":"IEEE Trans. Circuits and Systems CAS-"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach. 21 (1974), 549\u2013568.","journal-title":"J. Assoc. Comput. Mach."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/0025570X.1993.11996124","volume":"66","author":"J. P. Hutchinson","year":"1993","unstructured":"J. P. Hutchinson, Coloring ordinary maps, maps of empires, and maps of the Moon, Mathematics Magazine 66 (1993), 211\u2013226.","journal-title":"Mathematics Magazine"},{"key":"17_CR7","unstructured":"J. P. Hutchinson, T. Shermer, and A. Vince, Representations of thickness two graphs, preprint."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick and S. K. Wismath, Weighted visibility graphs of bars and related flow problems, Lecture Notes in Computer Science (Proc. 1st Workshop Algorithms Data Struct.), vol. 382, Springer-Verlag, 1989, pp. 325\u2013334.","DOI":"10.1007\/3-540-51542-9_28"},{"key":"17_CR9","doi-asserted-by":"crossref","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, Disc. Math. 64 (1987), 209\u2013219.","journal-title":"Disc. Math."},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1017\/S030500410006028X","volume":"93","author":"A. Mansfield","year":"1983","unstructured":"A. Mansfield, Determining the thickness of graphs is NP-hard, Math. Proc. Camb. Phil. Soc. 93 (1983), 9\u201323.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"17_CR11","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O'Rourke","year":"1987","unstructured":"J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, N.Y., 1987."},{"key":"17_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, Disc. and Comp. Geom. 1 (1986), 321\u2013341.","journal-title":"Disc. and Comp. Geom."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"S. K. Wismath, Characterizing bar line-of-sight graphs, Proc. 1st Symp. Comp. Geom., ACM (1985), 147\u2013152.","DOI":"10.1145\/323233.323253"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_367.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:21:27Z","timestamp":1619558487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_367","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}