1. 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–5 (2014)
2. Akiyama, T., Nishizeki, T., Saito, N.: NP-completeness of the hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73–76 (1980)
3. 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)
4. 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–19:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)
5. Lecture Notes in Computer Science;P Bose,1997