Fan-Planar Graphs: Combinatorial Properties and Complexity Results - Graph Drawing - page 196

12. Dehkordi, H.R., Eades, P.: Every outer-1-plane graph has a right angle crossing drawing.
International J. on Computational Geometry and Appl. 22(6), 543-558 (2012)
13. Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-layer right angle crossing drawings.
Algorithmica 68(4), 954-997 (2014)
14. Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing
resolution of non-planar graph drawings. Theory of Computing Syst. 49(3), 565-575 (2011)
15. Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: h -quasi planar drawingsof
bounded treewidth graphs in linear area. In: Golumbic, M.C., Stern, M., Levy, A., Mor-
genstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 91-102. Springer, Heidelberg (2012)
16. Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: Area requirement of graph draw-
ings with few crossings per edge. Computational Geometry 46(8), 909-916 (2013)
17. Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: Visualizing
non-planar diagrams in a planar way. J. of Graph Algorithms and Appl. 9(1), 31-52 (2005)
18. Didimo, W.: Density of straight-line 1-planar graph drawings. Information Processing Let-
ters 113(7), 236-240 (2013)
19. Didimo, W., Eades, P., Liotta, G.: Drawinggraphs with right angle crossings. Theor. Comput.
Sci. 412(39), 5156-5166 (2011)
20. Didimo, W., Liotta, G.: The crossing angle resolution in graph drawing.In:Pach, J. (ed.)
Thirty Essays on Geometric Graph Theory. Springer (2012)
21. Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on largeangle crossinggraphs.
ChicagoJ.onTheoreticalComputer Science 2011 (2011)
22. Eades, P., Liotta, G.: Right angle crossinggraphs and 1-planarity. Discrete Applied Mathe-
matics 161(7-8), 961-969 (2013)
23. Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. Algorithmica 47(4),
439-452 (2007)
24. Fox, J., Pach, J., Suk, A.: The number of edges in k -quasi-planar graphs. SIAM J. on Discrete
Mathematics 27(1), 550-561 (2013)
25. Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossingsper
edge. Algorithmica 49(1), 1-11 (2007)
26. Hong, S.H., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear-time al-
gorithm for testing outer-1-planarity. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS,
vol. 8242, pp. 71-82. Springer, Heidelberg (2013)
27. Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: Fary's theorem for 1-planar graphs. In: Gud-
mundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 335-346.
Springer, Heidelberg (2012)
28. Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs/1403.6184 (2014),
http://arxiv.org/abs/1403.6184
29. Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity
testing. J. of Graph Theory 72(1), 30-71 (2013)
30. Pach, J., T oth, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427-439
(1997)
31. Schaefer, M.: The graph crossing number and its variants: A survey. Electronic J. of Combi-
natorics 20(2) (2013)
32. Suzuki, Y.: Re-embeddingsofmaximum1-planargraphs. SIAM J. on Discrete Mathemat-
ics 24(4), 1527-1540 (2010)
33. Valtr, P.: On geometric graphs with no k pairwise parallel edges. Discrete & Computational
Geometry 19(3), 461-469 (1998)
34. Garey, M., Johnson, D.: Crossing Number is NP-Complete. SIAM Journal on Algebraic
Discrete Methods 4(3), 312-316 (1983), doi:10.1137/0604033