{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:39:47Z","timestamp":1766378387222},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_22","type":"book-chapter","created":{"date-parts":[[2015,2,22]],"date-time":"2015-02-22T23:05:18Z","timestamp":1424646318000},"page":"246-257","source":"Crossref","is-referenced-by-count":2,"title":["On Bar (1,j)-Visibility Graphs"],"prefix":"10.1007","author":[{"given":"Franz J.","family":"Brandenburg","sequence":"first","affiliation":[]},{"given":"Niklas","family":"Heinsohn","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Neuwirth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E. Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. Journal of Combinatorial Theory, Series A\u00a0114(3), 563\u2013571 (2007)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica\u00a017(1), 1\u20139 (1997)","journal-title":"Combinatorica"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/mana.3211170125","volume":"117","author":"R. Bodendiek","year":"1984","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: \u00dcber 1-optimale graphen. Mathematische Nachrichten\u00a0117(1), 323\u2013339 (1984)","journal-title":"Mathematische Nachrichten"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00330","volume":"18","author":"F.-J. Brandenburg","year":"2014","unstructured":"Brandenburg, F.-J.: 1-visibility representations of 1-planar graphs. J. Graph Algorithms Appl.\u00a018(3), 421\u2013438 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-36763-2_29","volume-title":"Graph Drawing","author":"F.-J. Brandenburg","year":"2013","unstructured":"Brandenburg, F.-J., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 327\u2013338. Springer, Heidelberg (2013)"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.7155\/jgaa.00136","volume":"11","author":"A.M. 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.\u00a011(1), 45\u201359 (2007)","journal-title":"J. Graph Algorithms Appl."},{"issue":"39","key":"22_CR7","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W. Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci.\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Evans, W.S., Kaufmann, M., Lenhart, W., Liotta, G., Mchedlidze, T., Wismath, S.K.: Bar 1-visibility graphs and their relation to other nearly planar graphs. CoRR, abs\/1312.5520 (2013)","DOI":"10.7155\/jgaa.00343"},{"issue":"7-8","key":"22_CR9","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","volume":"307","author":"I. Fabrici","year":"2007","unstructured":"Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Mathematics\u00a0307(7-8), 854\u2013865 (2007)","journal-title":"Discrete Mathematics"},{"key":"22_CR10","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: PacificVis, pp. 41\u201346 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"issue":"3","key":"22_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.C., Vince, A.: On representations of some thickness-two graphs. Comput. Geom.\u00a013(3), 161\u2013171 (1999)","journal-title":"Comput. Geom."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-00219-9_29","volume-title":"Graph Drawing","author":"V.P. Korzhik","year":"2009","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 302\u2013312. Springer, Heidelberg (2009)"},{"issue":"3","key":"22_CR14","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\u00a017(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"22_CR15","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 & Computational Geometry\u00a01, 343\u2013353 (1986)","journal-title":"Discrete & Computational Geometry"},{"key":"22_CR16","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","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, vol.\u00a08321, pp. 62\u201376. Springer, Heidelberg (2014)"},{"issue":"4","key":"22_CR17","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/090746835","volume":"24","author":"Y. Suzuki","year":"2010","unstructured":"Suzuki, Y.: Re-embeddings of maximum 1-planar graphs. SIAM Journal on Discrete Mathematics\u00a024(4), 1527\u20131540 (2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"22_CR18","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. Discrete & Computational Geometry\u00a01, 321\u2013341 (1986)","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T00:29:36Z","timestamp":1566347376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}