{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T08:39:13Z","timestamp":1794559153895,"version":"4.9.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_9","type":"book-chapter","created":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T22:42:19Z","timestamp":1516401739000},"page":"102-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["3D Visibility Representations of 1-planar Graphs"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Montecchiani, F.: 3D visibility representations of 1-planar graphs. CoRR abs\/1708.06196 (2017). https:\/\/arxiv.org\/abs\/1708.06196","DOI":"10.1007\/978-3-319-73915-1_9"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-50106-2_20","volume-title":"Graph Drawing and Network Visualization","author":"A Arleo","year":"2016","unstructured":"Arleo, A., et al.: Visibility representations of boxes in 2.5 dimensions. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 251\u2013265. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_20"},{"key":"9_CR3","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: Aronov, B., Katz, M.J. (eds.) SoCG 2017. LIPIcs, vol. 77, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"9_CR4","unstructured":"Biedl, T.C., Liotta, G., Montecchiani, F.: On visibility representations of non-planar graphs. In: Fekete, S.P., Lubiw, A. (eds.) SoCG 2016. LIPIcs, vol. 51, pp. 19:1\u201319:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02941309","volume":"53","author":"R Bodendiek","year":"1983","unstructured":"Bodendiek, R., Schumacher, H.J., Wagner, K.: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel. Abh. Math. Sem. Univ. Hamburg 53, 41\u201352 (1983)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"issue":"3","key":"9_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":"9_CR7","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00330","volume":"18","author":"FJ Brandenburg","year":"2014","unstructured":"Brandenburg, F.J.: 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":"9_CR8","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.S., 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":"9_CR9","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. Discr. Appl. Math. 75(1), 9\u201325 (1997)","journal-title":"Discr. Appl. Math."},{"key":"9_CR10","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood (1999)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-50106-2_22","volume-title":"Graph Drawing and Network Visualization","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: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 280\u2013294. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_22"},{"issue":"5","key":"9_CR13","doi-asserted-by":"publisher","first-page":"721","DOI":"10.7155\/jgaa.00343","volume":"18","author":"WS Evans","year":"2014","unstructured":"Evans, W.S., Kaufmann, M., Lenhart, W., Mchedlidze, T., Wismath, S.K.: Bar 1-visibility graphs vs. other nearly planar graphs. J. Graph Algorithms Appl. 18(5), 721\u2013739 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR14","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). https:\/\/doi.org\/10.1007\/BFb0021799"},{"issue":"1","key":"9_CR15","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":"9_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"issue":"11","key":"9_CR17","first-page":"35","volume":"6","author":"SH Hong","year":"2017","unstructured":"Hong, S.H., Kaufmann, M., Kobourov, S.G., Pach, J.: Beyond-planar graphs: algorithmics and combinatorics (Dagstuhl Seminar 16452). Dagstuhl Rep. 6(11), 35\u201362 (2017)","journal-title":"Dagstuhl Rep."},{"issue":"3","key":"9_CR18","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.C., Vince, A.: On representations of some thickness two graphs. Comput. Geom. 13(3), 161\u2013171 (1999)","journal-title":"Comput. Geom."},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017). https:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theor. 72(1), 30\u201371 (2013)","journal-title":"J. Graph Theor."},{"key":"9_CR21","unstructured":"Liotta, G.: Graph drawing beyond planarity: some results and open problems. In: ICTCS 2014. CEUR Workshop Proceedings, vol. 1231, pp. 3\u20138. CEUR-WS.org (2014)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"9_CR23","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. Discr. Comput. Geom. 1, 343\u2013353 (1986)","journal-title":"Discr. Comput. Geom."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Shermer, T.C.: On rectangle visibility graphs. III. External visibility and complexity. In: Fiala, F., Kranakis, E., Sack, J. (eds.) CCCG 1996, pp. 234-239. Carleton University Press, Ottawa (1996)","DOI":"10.1515\/9780773591134-041"},{"key":"9_CR25","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). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_7"},{"key":"9_CR26","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 a visibility representation of planar graphs. Discr. Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Discr. Comput. Geom."},{"key":"9_CR27","unstructured":"Thomassen, C.: Plane representations of graphs. In: Progress in Graph Theory, pp. 43\u201369. AP (1984)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Wismath, S.K.: Characterizing bar line-of-sight graphs. In: O\u2019Rourke, J. (ed.) SoCG 1985, pp. 147\u2013152. ACM (1985)","DOI":"10.1145\/323233.323253"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T07:22:30Z","timestamp":1710228150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_9","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","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":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}