{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:29:33Z","timestamp":1760441373456,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_20","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"251-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Visibility Representations of Boxes in 2.5 Dimensions"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Arleo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"Binucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William S.","family":"Evans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"20_CR1","first-page":"1","volume":"2013","author":"ME Ahmed","year":"2014","unstructured":"Ahmed, M.E., Yusuf, A.B., Polin, M.Z.H.: Bar 1-visibility representation of optimal 1-planar graph. Elect. Inf. Comm. Technol. (EICT) 2013, 1\u20135 (2014)","journal-title":"Elect. Inf. Comm. Technol. (EICT)"},{"issue":"2","key":"20_CR2","first-page":"73","volume":"3","author":"T Akiyama","year":"1980","unstructured":"Akiyama, T., Nishizeki, T., Saito, N.: NP-completeness of the hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73\u201376 (1980)","journal-title":"J. Inf. Process."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Arleo, A., Binucci, C., Di Giacomo, E, Evans, W.S., Grilli, L., Liotta, G., Meijer, H., Montecchiani, F., Whitesides, S., Wismath, S.: Visibility representations of boxes in 2.5 dimensions. CoRR, abs\/1608.08899 (2016)","DOI":"10.1007\/978-3-319-50106-2_20"},{"key":"20_CR4","unstructured":"Biedl, T., Liotta, G., Montecchiani, F.: On visibility representations of non-planar graphs. In: Fekete, S., Lubiw, A., (eds.) SoCG 2016, vol. LIPICs, pp. 19:1\u201319:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-62495-3_35","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. (ed.) GD 1996. LNCS, vol. 1190, pp. 25\u201344. Springer, Heidelberg (1997). doi: 10.1007\/3-540-62495-3_35"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00006","volume":"2","author":"P Bose","year":"1998","unstructured":"Bose, P., Everett, H., Fekete, S.P., Houle, M.E., Lubiw, A., Meijer, H., Romanik, K., Rote, G., Shermer, T.C., Whitesides, S., Zelle, C.: A visibility representation for graphs in three dimensions. J. Graph Algorithms Appl. 2(3), 1\u201316 (1998)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00330","volume":"18","author":"F Brandenburg","year":"2014","unstructured":"Brandenburg, F.: 1-visibility representations of 1-planar graphs. J. Graph Algorithms Appl. 18(3), 421\u2013438 (2014)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.7155\/jgaa.00316","volume":"18","author":"T Bruckdorfer","year":"2014","unstructured":"Bruckdorfer, T., Kaufmann, M., Montecchiani, F.: 1-bend orthogonal partial edge drawing. J. Graph Algorithms Appl. 18(1), 111\u2013131 (2014)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.comgeo.2014.10.004","volume":"48","author":"P Carmi","year":"2015","unstructured":"Carmi, P., Friedman, E., Katz, M.J.: Spiderman graph: visibility in urban regions. Comput. Geometry 48(3), 251\u2013259 (2015)","journal-title":"Comput. Geometry"},{"issue":"1","key":"20_CR10","first-page":"1","volume":"15","author":"AM Dean","year":"2008","unstructured":"Dean, A.M., Ellis-Monaghan, J.A., Hamilton, S., Pangborn, G.: Unit rectangle visibility graphs. Electr. J. Comb. 15(1), 1\u201324 (2008)","journal-title":"Electr. J. Comb."},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.7155\/jgaa.00136","volume":"11","author":"AM Dean","year":"2007","unstructured":"Dean, A.M., Evans, W., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T.: Bar $$k$$-visibility graphs. J. Graph Algorithms Appl. 11(1), 45\u201359 (2007)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0166-218X(96)00029-7","volume":"75","author":"AM Dean","year":"1997","unstructured":"Dean, A.M., Hutchinson, J.P.: Rectangle-visibility representations of bipartite graphs. Discrete Appl. Math. 75(1), 9\u201325 (1997)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00011","volume":"2","author":"AM Dean","year":"1998","unstructured":"Dean, A.M., Hutchinson, J.P.: Rectangle-visibility layouts of unions and products of trees. J. Graph Algorithms Appl. 2(8), 1\u201321 (1998)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR14","first-page":"161","volume":"160","author":"AM Dean","year":"2003","unstructured":"Dean, A.M., Veytsel, N.: Unit bar-visibility graphs. Congr. Num. 160, 161\u2013175 (2003)","journal-title":"Congr. Num."},{"key":"20_CR15","first-page":"280","volume-title":"Graph Drawing 2016","author":"E Di Giacomo","year":"2016","unstructured":"Di Giacomo, E., Didimo, W., Evans, W.S., Liotta, G., Meijer, H., Montecchiani, F., Wismath, S.K.: Ortho-polygon visibility representations of embedded graphs. In: N\u00f6llenburg, M., Hu, Y. (eds.) GD 2016. LNCS, vol. 9801, pp. 280\u2013294. Springer, Heidelberg (2016)"},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(83)90128-0","volume":"46","author":"P Duchet","year":"1983","unstructured":"Duchet, P., Hamidoune, Y., Las, M., Vergnas, H.M.: Representing a planar graph by vertical lines joining different levels. Discrete Math. 46(3), 319\u2013321 (1983)","journal-title":"Discrete Math."},{"issue":"5","key":"20_CR17","doi-asserted-by":"publisher","first-page":"721","DOI":"10.7155\/jgaa.00343","volume":"18","author":"W Evans","year":"2014","unstructured":"Evans, W., Kaufmann, M., Lenhart, W., Mchedlidze, T., Wismath, S.: Bar 1-visibility graphs and their relation to other nearly planar graphs. J. Graph Algorithms Appl. 18(5), 721\u2013739 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0021799","volume-title":"Graph Drawing","author":"FJ 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. 1027, pp. 152\u2013161. Springer, Heidelberg (1996). doi: 10.1007\/BFb0021799"},{"issue":"1","key":"20_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195999000029","volume":"9","author":"SP Fekete","year":"1999","unstructured":"Fekete, S.P., Meijer, H.: Rectangle and box visibility graphs in 3D. Int. J. Comput. Geometry Appl. 9(1), 1\u201328 (1999)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00157","volume":"12","author":"S Felsner","year":"2008","unstructured":"Felsner, S., Massow, M.: Parameters of bar $$k$$-visibility graphs. J. Graph Algorithms Appl. 12(1), 5\u201327 (2008)","journal-title":"J. Graph Algorithms Appl."},{"issue":"10","key":"20_CR21","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"CAS\u201323","author":"MR 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 Syst. CAS\u201323(10), 591\u2013599 (1976)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.dam.2002.12.005","volume":"145","author":"A Gupta","year":"2005","unstructured":"Gupta, A., Nishimura, N., Proskurowski, A., Ragde, P.: Embeddings of $$k$$-connected graphs of pathwidth $$k$$. Discrete Appl. Math. 145(2), 242\u2013265 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"20_CR23","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"JP Hutchinson","year":"1999","unstructured":"Hutchinson, J.P., Shermer, T., Vince, A.: On representations of some thickness-two graphs. Comp. Geometry 13(3), 161\u2013171 (1999)","journal-title":"Comp. Geometry"},{"issue":"2","key":"20_CR24","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(97)00048-3","volume":"62","author":"G Kant","year":"1997","unstructured":"Kant, G., Liotta, G., Tamassia, R., Tollis, I.G.: Area requirement of visibility representations of trees. Inf. Process. Lett. 62(2), 81\u201388 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s004930100020","volume":"21","author":"JD Kleitman","year":"2001","unstructured":"Kleitman, J.D., Gy\u00e1rf\u00e1s, A., T\u00f3th, G.: Convex sets in the plane with three of every four meeting. Combinatorica 21(2), 221\u2013232 (2001)","journal-title":"Combinatorica"},{"issue":"3","key":"20_CR26","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ipl.2015.11.011","volume":"116","author":"G Liotta","year":"2016","unstructured":"Liotta, G., Montecchiani, F.: L-visibility drawings of IC-planar graphs. Inf. Process. Lett. 116(3), 217\u2013222 (2016)","journal-title":"Inf. Process. Lett."},{"key":"20_CR27","unstructured":"Otten, R.H.J.M., Van Wijk, J.G.: Graph representations in interactive layout design. In: IEEE ISCSS, pp. 91\u2013918. IEEE (1978)"},{"key":"20_CR28","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. 1, 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Shermer, T.C.: On rectangle visibility graphs III. external visibility and complexity. In: Canadian Conference on Computational Geometry, pp. 234\u2013239 (1996)","DOI":"10.1515\/9780773591134-041"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-00219-9_7","volume-title":"Graph Drawing","author":"J \u0160tola","year":"2009","unstructured":"\u0160tola, J.: Unimaximal sequences of pairs in rectangle visibility drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 61\u201366. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00219-9_7"},{"key":"20_CR31","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. 2607, pp. 26\u201337. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36494-3_4"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-04126-1_6","volume-title":"Applied Algorithms ICAA 2014","author":"S Sultana","year":"2014","unstructured":"Sultana, S., Rahman, M.S., Roy, A., Tairin, S.: Bar 1-visibility drawings of 1-planar graphs. In: Gupta, P., Zaroliagis, C. (eds.) ICAA 2014. LNCS, pp. 62\u201376. Springer International Publishing, New York (2014). doi: 10.1007\/978-3-319-04126-1_6"},{"issue":"1","key":"20_CR33","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. 1(1), 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"20_CR34","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1137\/0404014","volume":"4","author":"R Tamassia","year":"1991","unstructured":"Tamassia, R., Tollis, I.G.: Representations of graphs on a cylinder. SIAM J. Discrete Math. 4(1), 139\u2013149 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"20_CR35","unstructured":"Thomassen, C.: Plane representations of graphs. In: Progress in Graph Theory, pp. 43\u201369. AP (1984)"},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Proceedings of 1st Symposium on Computational Geometry, pp. 147\u2013152 (1985)","DOI":"10.1145\/323233.323253"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T06:20:18Z","timestamp":1692598818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}