{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:51:02Z","timestamp":1794336662774,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540607236","type":"print"},{"value":"9783540493518","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0021799","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:56:38Z","timestamp":1131846998000},"page":"152-161","source":"Crossref","is-referenced-by-count":7,"title":["On a visibility representation of graphs"],"prefix":"10.1007","author":[{"given":"F. J.","family":"Cobos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. C.","family":"Dana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Hurtado","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"M\u00e1rquez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Mateos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"H. Alt, M. Godau and S. Whitesides. Universal 3-Dimensional Visibility Representations for Graphs. Abstract presented at Graph Drawing'95, Passau (Germany). 1995.","DOI":"10.1007\/BFb0021785"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(93)90354-V","volume":"114","author":"S. Bellantoni","year":"1993","unstructured":"S. Bellantoni, I. Ben-Arroyo Hartman, T. Przytycka and S. Whitesides. Grid intersection graphs and boxicity. North-Holland. Discrete Mathematics, 114:41\u201349, 1993.","journal-title":"North-Holland. Discrete Mathematics"},{"key":"16_CR3","unstructured":"P. Bose, H. Everett, S. Fekete, A. Lubiw, H. Meijer, K. Romanik, T. Shermer and S. Whitesides. On a Visibility Representation for Graphs in Three Dimensions. In David Avis and Prosenjit Bose, editors, Snapshots in Computational and Discrete Geometry, volume III, McGill University, July 1994. Technical Report SOCS-94.50."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0097-3165(80)90021-7","volume":"29","author":"F.R.K. Chung","year":"1980","unstructured":"F.R.K. Chung. On unimodal subsequences. J. Combinatorial Theory, Series A, v. 29:267\u2013279, 1980.","journal-title":"J. Combinatorial Theory, Series A"},{"key":"16_CR5","first-page":"463","volume":"2","author":"P. Erd\u00f6s","year":"1935","unstructured":"P. Erd\u00f6s and A. Szekeres. A combinatorial problem in geometry. Compositio Mathematica, v. 2:463\u2013470, 1935.","journal-title":"Compositio Mathematica"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"S.P. Fekete, M.E. Houle and S. Whitesides. New Results on a Visibility Representation of Graphs in 3D. Abstract presented at Graph Drawing'95, Passau (Germany). 1995.","DOI":"10.1007\/BFb0021807"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"CAS-23","author":"M. Garey","year":"1976","unstructured":"M. Garey, D. Jhonson and H. So. An application of graph coloring to printed circuit testing. IEEE Trans. Circuits and Systems., CAS-23:591\u2013598, 1976.","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"16_CR8","unstructured":"M.Y. Hsueh and D.O. Pederson. Computer-aided layout of LSI circuit bulding bloks. Proc. IEEE Int. Symp. on Circuits and Systems., pages 474\u2013477, 1979."},{"key":"16_CR9","unstructured":"J. Kratochvil and T. Przytycka. Grid intersection graphs and boxicity on surfaces. Abstract presented at Graph Drawing'95, Passau (Germany). 1995."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"K. Kuratowski. Sur le probl\u00e8me des courbes gauches en topologie. Fund. Math., 15:271\u2013283, 1930.","journal-title":"Fund. Math."},{"key":"16_CR11","first-page":"125","volume-title":"VLSI: Algorithms and Architectures","author":"E. Lodi","year":"1985","unstructured":"E. Lodi and L. Pagli. A VLSI algorithm for a visibility problem. In P. Bertolazzi and F. Luccio, editors, VLSI: Algorithms and Architectures, pages 125\u2013134. Nort-Holland, Amsterdam, 1985."},{"issue":"5","key":"16_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"S.L. Mitchell","year":"1979","unstructured":"S.L. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Information Processing Letters, 9(5):229\u2013232, 1979.","journal-title":"Information Processing Letters"},{"key":"16_CR13","first-page":"259","volume-title":"Advances in Computing Research, volume 2","author":"M. Schlag","year":"1985","unstructured":"M. Schlag, F. Luccio, P. Maestrini, D.T. Lee and C.K. Wong. A visibility problem in VLSI layout compaction. In F. P. Preparata, editor, Advances in Computing Research, volume 2, pages 259\u2013282. JAI Press Inc, Greenwich. CT., 1985."},{"key":"16_CR14","doi-asserted-by":"publisher","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":"16_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/31.1739","volume":"35","author":"S. Wimer","year":"1988","unstructured":"S. Wimer, I. Koren and I. Cederbaum. Floorplans, planar graphs and layouts. IEEE Trans. Circuits ans Systems, 35:267\u2013278, 1988.","journal-title":"IEEE Trans. Circuits ans Systems"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"S.K. Wismath. Characterizing bar line-of-sight graphs. Proc. ACM Symp. on Computational Geometry. Baltimore. MD. 1985.","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\/BFb0021799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T12:19:04Z","timestamp":1626697144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0021799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607236","9783540493518"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0021799","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0021783","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}