{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:18Z","timestamp":1725552198411},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_7","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T04:56:50Z","timestamp":1137733010000},"page":"73-82","source":"Crossref","is-referenced-by-count":3,"title":["Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness"],"prefix":"10.1007","author":[{"given":"Alice M.","family":"Dean","sequence":"first","affiliation":[]},{"given":"William","family":"Evans","sequence":"additional","affiliation":[]},{"given":"Ellen","family":"Gethner","sequence":"additional","affiliation":[]},{"given":"Joshua D.","family":"Laison","sequence":"additional","affiliation":[]},{"given":"Mohammad Ali","family":"Safari","sequence":"additional","affiliation":[]},{"given":"William T.","family":"Trotter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"7_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. Discrete Appl. Math.\u00a040(1), 5\u201317 (1992); Combinatorial methods in VLSI","journal-title":"Discrete Appl. Math."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-63938-1_47","volume-title":"Graph Drawing","author":"P. Bose","year":"1997","unstructured":"Bose, P., Dean, A., Hutchinson, J., Shermer, T.: On rectangle visibility graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 25\u201344. Springer, Heidelberg (1997)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Chen, G., Hutchinson, J.P., Keating, K., Shen, J.: Characterizations of 1,k-bar visibility trees (2005) (in preparation)","DOI":"10.37236\/1116"},{"key":"7_CR4","unstructured":"Dean, A., Evans, W., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T.: Bar k-visibilty graphs (2005) (submitted)"},{"key":"7_CR5","unstructured":"Dean, A.M., Gethner, E., Hutchinson, J.P.: A characterization of triangulated polygons that are unit bar-visibility graphs (2005) (in preparation)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-31843-9_13","volume-title":"Graph Drawing","author":"A.M. Dean","year":"2005","unstructured":"Dean, A.M., Gethner, E., Hutchinson, J.P.: Unit bar-visibility layouts of triangulated polygons: Extended abstract. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 111\u2013121. Springer, Heidelberg (2005)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0166-218X(96)00029-7","volume":"75","author":"A.M. Dean","year":"1997","unstructured":"Dean, A.M., Hutchinson, J.P.: Rectangle-visibility representations of bipartite graphs. Discrete Appl. Math.\u00a075(1), 9\u201325 (1997)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"7_CR8","first-page":"21","volume":"2","author":"A.M. Dean","year":"1998","unstructured":"Dean, A.M., Hutchinson, J.P.: Rectangle-visibility layouts of unions and products of trees. J. Graph Algorithms Appl.\u00a02(8), 21 (1998) (electronic)","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR9","first-page":"397","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing, p. 397. Prentice Hall Inc., Upper Saddle River, NJ (1999)"},{"issue":"10","key":"7_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"CAS-23","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., So, H.C.: An application of graph coloring to printed circuit testing. IEEE Trans. Circuits and Systems\u00a0CAS-23(10), 591\u2013599 (1976)","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"7_CR11","first-page":"241","volume":"25","author":"J.P. Hutchinson","year":"2002","unstructured":"Hutchinson, J.P.: Arc- and circle-visibility graphs. Australas. J. Combin.\u00a025, 241\u2013262 (2002)","journal-title":"Australas. J. Combin."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"J.P. Hutchinson","year":"1999","unstructured":"Hutchinson, J.P., Shermer, T., Vince, A.: On representations of some thickness-two graphs. Computational Geometry\u00a013, 161\u2013171 (1999)","journal-title":"Computational Geometry"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom.\u00a01(4), 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR14","unstructured":"Shermer, T.: On rectangle visibility graphs III. External visibility and complexity. In: Proc. 8th Canad. Conf. on Comp. Geom., pp. 234\u2013239 (1996)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-36494-3_4","volume-title":"STACS 2003","author":"I. Streinu","year":"2003","unstructured":"Streinu, I., Whitesides, S.: Rectangle visibility graphs: characterization, construction, and compaction. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 26\u201337. Springer, Heidelberg (2003)"},{"issue":"4","key":"7_CR16","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. Discrete Comput. Geom.\u00a01(4), 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR17","volume-title":"Introduction to Graph Theory, 2E","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2E. Prentice Hall Inc., Upper Saddle River, NJ (2001)"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/323233.323253","volume-title":"Proceedings of the First Symposium of Computational Geometry","author":"S.K. Wismath","year":"1985","unstructured":"Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Proceedings of the First Symposium of Computational Geometry, pp. 147\u2013152. ACM, New York (1985)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:04:17Z","timestamp":1605625457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11618058_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}