Guest Editors' Foreword and Overview

[1]  Michael A. Bekos,et al.  On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs , 2014, Graph Drawing.

[2]  Walter Didimo,et al.  Recognizing and drawing IC-planar graphs , 2015, Theor. Comput. Sci..

[3]  Ioannis G. Tollis,et al.  Fan-planarity: Properties and complexity , 2015, Theor. Comput. Sci..

[4]  Weidong Huang,et al.  Larger crossing angles make graphs easier to read , 2014, J. Vis. Lang. Comput..

[5]  Giuseppe Liotta,et al.  An annotated bibliography on 1-planarity , 2017, Comput. Sci. Rev..

[6]  Giuseppe Liotta,et al.  Right angle crossing graphs and 1-planarity , 2013, Discret. Appl. Math..

[7]  Michael A. Bekos,et al.  3D Visibility Representations of 1-planar Graphs , 2017, GD.

[8]  Christian Bachmaier,et al.  Outer 1-Planar Graphs , 2016, Algorithmica.

[9]  Emilio Di Giacomo,et al.  2-Layer Right Angle Crossing Drawings , 2011, Algorithmica.

[10]  Michael A. Bekos,et al.  On the Relationship between k-Planar and k-Quasi Planar Graphs , 2017, WG.

[11]  Franz-Josef Brandenburg,et al.  On Aligned Bar 1-Visibility Graphs , 2016, WALCOM.

[12]  Walter Didimo,et al.  A characterization of complete bipartite RAC graphs , 2010, Inf. Process. Lett..

[13]  Alexander Grigoriev,et al.  Algorithms for Graphs Embeddable with Few Crossings per Edge , 2005, Algorithmica.

[14]  Michael A. Bekos,et al.  On Optimal 2- and 3-Planar Graphs , 2017, Symposium on Computational Geometry.

[15]  Michael A. Bekos,et al.  The Book Thickness of 1-Planar Graphs is Constant , 2015, Algorithmica.

[16]  János Pach,et al.  Graphs drawn with few crossings per edge , 1997, Comb..

[17]  Carsten Thomassen,et al.  Rectilinear drawings of graphs , 1988, J. Graph Theory.

[18]  Michael A. Bekos,et al.  The Straight-Line RAC Drawing Problem is NP-Hard , 2010, J. Graph Algorithms Appl..

[19]  Vladimir P. Korzhik,et al.  Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing , 2013, J. Graph Theory.

[20]  Otfried Cheong,et al.  On the Number of Edges of Fan-Crossing Free Graphs , 2013, Algorithmica.

[21]  Emilio Di Giacomo,et al.  Ortho-polygon Visibility Representations of Embedded Graphs , 2016, Algorithmica.

[22]  Emilio Di Giacomo,et al.  Drawing Outer 1-planar Graphs with Few Slopes , 2015, J. Graph Algorithms Appl..

[23]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[24]  Eyal Ackerman,et al.  On topological graphs with at most four crossings per edge , 2015, Comput. Geom..

[25]  Michael Kaufmann,et al.  The Density of Fan-Planar Graphs , 2014, Electron. J. Comb..

[26]  Yusuke Suzuki,et al.  Optimal 1-planar graphs which triangulate other surfaces , 2010, Discret. Math..

[27]  Csaba D. Tóth,et al.  On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles , 2010, GD.

[28]  János Pach,et al.  The Number of Edges in k-Quasi-planar Graphs , 2011, SIAM J. Discret. Math..

[29]  Sang Won Bae,et al.  Gap-planar graphs , 2018, Theor. Comput. Sci..

[30]  Csaba D. Tóth,et al.  Graphs that admit right angle crossing drawings , 2010, Comput. Geom..

[31]  Franz-Josef Brandenburg,et al.  Journal of Graph Algorithms and Applications 1-planarity of Graphs with a Rotation System 68 Auer Et Al. 1-planarity of Graphs with a Rotation System , 2022 .

[32]  Eyal Ackerman.  On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges , 2009, Discret. Comput. Geom..

[33]  Hiroshi Nagamochi,et al.  Testing Full Outer-2-planarity in Linear Time , 2015, WG.

[34]  Ioannis G. Tollis,et al.  Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus , 2017, J. Graph Algorithms Appl..

[35]  Franz-Josef Brandenburg.  1-Visibility Representations of 1-Planar Graphs , 2014, J. Graph Algorithms Appl..

[36]  Giuseppe Liotta,et al.  A Linear-Time Algorithm for Testing Outer-1-Planarity , 2013, Algorithmica.

[37]  M. Kaufmann.  Bar 1-Visibility Graphs vs. other Nearly Planar Graphs , 2014 .

[38]  Xin Zhang,et al.  The structure of plane graphs with independent crossings and its applications to coloring problems , 2013 .

[39]  Emilio Di Giacomo,et al.  Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings , 2010, Theory of Computing Systems.

[40]  Giuseppe Liotta,et al.  Graph drawing beyond planarity: some results and open problems , 2014, ICTCS.

[41]  Giuseppe Liotta,et al.  Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs , 2015, Discrete & Computational Geometry.

[42]  Walter Didimo,et al.  Drawing Graphs with Right Angle Crossings , 2009, WADS.

[43]  Christian Bachmaier,et al.  Recognizing Outer 1-Planar Graphs in Linear Time , 2013, GD.

[44]  Walter Didimo,et al.  The Crossing-Angle Resolution in Graph Drawing , 2013 .

[45]  Bartosz Walczak,et al.  New bounds on the maximum number of edges in k-quasi-planar graphs , 2015, Comput. Geom..

[46]  Xin Zhang.  Drawing complete multipartite graphs on the plane with restrictions on crossings , 2013, ArXiv.

[47]  Stephen G. Kobourov,et al.  Contact Representations of Graphs in 3D , 2015, WADS.

[48]  Michael A. Bekos,et al.  On RAC drawings of 1-planar graphs , 2017, Theor. Comput. Sci..