{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:17:27Z","timestamp":1725769047729},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319041254"},{"type":"electronic","value":"9783319041261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04126-1_6","type":"book-chapter","created":{"date-parts":[[2014,1,7]],"date-time":"2014-01-07T22:16:13Z","timestamp":1389132973000},"page":"62-76","source":"Crossref","is-referenced-by-count":6,"title":["Bar 1-Visibility Drawings of 1-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Shaheena","family":"Sultana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suraiya","family":"Tairin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-18381-2_6","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"E.N. Argyriou","year":"2011","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is NP-hard. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 74\u201385. Springer, Heidelberg (2011)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-16926-7_14","volume-title":"Graph Theoretic Concepts in Computer Science","author":"K. Arikushi","year":"2010","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Mori\u0107, F., T\u00f3th, C.D.: Graphs that admits right angle crossing drawing. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"issue":"1","key":"6_CR3","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.: Bar k-visibility graphs. Journal of Graph Algorithms and Applications\u00a011(1), 45\u201359 (2007)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1142\/S021819591250015X","volume":"22","author":"H. Dehkordi","year":"2012","unstructured":"Dehkordi, H., Eades, P.: On algorithmic right angle crossing graph drawing. Int. J. Comput. Geometry\u00a022(6), 543\u2013557 (2012)","journal-title":"Int. J. Comput. Geometry"},{"key":"6_CR5","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall Inc. (1999)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","volume":"41","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Constrained visibility representation of graphs. Inform. Process. Letters\u00a041, 1\u20137 (1992)","journal-title":"Inform. Process. Letters"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-03367-4_19","volume-title":"Algorithms and Data Structures","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"issue":"16","key":"6_CR8","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.ipl.2010.05.023","volume":"110","author":"W. Didimo","year":"2010","unstructured":"Didimo, W., Eades, P., Liotta, G.: A characterization of complete bipartite RAC graphs. Information Processing Letters\u00a0110(16), 687\u2013691 (2010)","journal-title":"Information Processing Letters"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","first-page":"148","volume-title":"GD 2011","author":"P. Eades","year":"2011","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 148\u2013153. Springer, Heidelberg (2011)"},{"issue":"7-8","key":"6_CR10","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":"6_CR11","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)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture notes series on computing. World Scientific (2004)","DOI":"10.1142\/5648"},{"key":"6_CR13","unstructured":"Otten, J., Van Wijk, J.G.: Graph representation in interactive layout design. In: The Proceedings of IEEE International Symposium on Circuits and Systems, pp. 914\u2013918 (1978)"},{"issue":"3","key":"6_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"},{"issue":"1","key":"6_CR15","first-page":"5","volume":"2","author":"P. Selvaraju","year":"2009","unstructured":"Selvaraju, P., Pricilla, B.: On cordial labeling: The grid, diagonal grid, structured web graphs. International Journal of Algorithms, Computing and Mathematics\u00a02(1), 5\u201314 (2009)","journal-title":"International Journal of Algorithms, Computing and Mathematics"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.disc.2009.07.016","volume":"310","author":"Y. Suzuki","year":"2010","unstructured":"Suzuki, Y.: Optimal 1-planar graphs which triangulate other surfaces. Discrete Mathematics\u00a0310(1), 6\u201311 (2010)","journal-title":"Discrete Mathematics"},{"key":"6_CR17","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 and Computational Geometry\u00a01, 321\u2013341 (1986)","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Applied Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04126-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,11]],"date-time":"2018-10-11T02:24:55Z","timestamp":1539224695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04126-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319041254","9783319041261"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04126-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}