{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:25Z","timestamp":1725512005200},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70904-6_32","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T15:44:43Z","timestamp":1179416683000},"page":"330-342","source":"Crossref","is-referenced-by-count":1,"title":["Thickness of Bar 1-Visibility Graphs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mareike","family":"Massow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","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.M., Hutchinson, J.P., Shermer, T.C.: On rectangle visibility graphs. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 25\u201344. Springer, Heidelberg (1997)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0021799","volume-title":"Graph Drawing","author":"F.J. Cobos","year":"1996","unstructured":"Cobos, F.J., Dana, J.C., Hurtado, F., M\u00e1rquez, A., Mateos, F.: On a visibility representation of graphs. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 152\u2013161. Springer, Heidelberg (1996)"},{"key":"32_CR3","unstructured":"Dean, A.M., Evans, W., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T.: Bar k-visibility graphs. Manuscript (2005)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11618058_7","volume-title":"Graph Drawing","author":"A.M. Dean","year":"2006","unstructured":"Dean, A.M., Evans, W., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T.: Bar k-visibility graphs: Bounds on the number of edges, chromatic number, and thickness. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 73\u201382. Springer, Heidelberg (2006)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 111\u2013121. Springer, Heidelberg (2005)"},{"issue":"3","key":"32_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00023","volume":"4","author":"M.B. Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs (Special issue for Graph Drawing \u201998). J. Graph Algorithms & Applications\u00a04(3), 5\u201317 (2000)","journal-title":"J. Graph Algorithms & Applications"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-36151-0_15","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2002","unstructured":"Eppstein, D.: Separating thickness from geometric thickness. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 150\u2013161. Springer, Heidelberg (2002)"},{"key":"32_CR8","unstructured":"Hartke, S.G., Vandenbussche, J., Wenger, P.: Further results on bar k-visibility graphs. Manuscript (November 2005)"},{"key":"32_CR9","first-page":"241","volume":"25","author":"J.P. Hutchinson","year":"2002","unstructured":"Hutchinson, J.P.: Arc- and circle-visibility graphs. Australas. Journal of Combin.\u00a025, 241\u2013262 (2002)","journal-title":"Australas. Journal of Combin."},{"issue":"3","key":"32_CR10","doi-asserted-by":"crossref","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. Comput. Geom. Theory Appl.\u00a013(3), 161\u2013171 (1999)","journal-title":"Comput. Geom. Theory Appl."},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1017\/S030500410006028X","volume":"9","author":"A. Mansfield","year":"1983","unstructured":"Mansfield, A.: Determining the thickness of graphs is NP-hard. Math. Proc. Camb. Phil. Soc.\u00a09, 9\u201323 (1983)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P. Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: A survey. Graphs and Combinatorics\u00a014, 59\u201373 (1998), \n                    \n                      citeseer.ist.psu.edu\/mutzel98thickness.html","journal-title":"Graphs and Combinatorics"},{"key":"32_CR13","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 Computational Geometry\u00a01, 321\u2013341 (1986)","journal-title":"Discrete Computational Geometry"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/323233.323253","volume-title":"Proceedings of SCG \u201985","author":"S.K. Wismath","year":"1985","unstructured":"Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Proceedings of SCG \u201985, Baltimore, Maryland, United States, pp. 147\u2013152. ACM Press, New York (1985), doi:10.1145\/323233.323253"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:24:58Z","timestamp":1558272298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709039","9783540709046"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}