Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus

[1]  David A. Carrington,et al.  Empirical Evaluation of Aesthetics-based Graph Layout , 2002, Empirical Software Engineering.

[2]  Peter Eades,et al.  Edge crossings in drawings of bipartite graphs , 1994, Algorithmica.

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

[4]  Giuseppe Liotta,et al.  Fáry's Theorem for 1-Planar Graphs , 2012, COCOON.

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

[6]  Brendan D. McKay,et al.  On an edge crossing problem , 1986 .

[7]  Giuseppe Liotta,et al.  L-Visibility Drawings of IC-Planar Graphs , 2015, Graph Drawing.

[8]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[9]  Peter Eades,et al.  Drawing Graphs in Two Layers , 1994, Theor. Comput. Sci..

[10]  Walter Didimo.  Density of straight-line 1-planar graph drawings , 2013, Inf. Process. Lett..

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

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

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

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

[15]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[16]  Kozo Sugiyama.  Graph Drawing and Applications for Software and Knowledge Engineers , 2002, Series on Software Engineering and Knowledge Engineering.

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

[18]  G. Ringel.  Ein Sechsfarbenproblem auf der Kugel , 1965 .

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

[20]  R. Martí,et al.  A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs , 1996 .

[21]  Emilio Di Giacomo,et al.  Heuristics for the Maximum 2-Layer RAC Subgraph Problem , 2012, Comput. J..

[22]  Stephen G. Kobourov,et al.  Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs , 2013, Graph Drawing.

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

[24]  Colin Ware,et al.  Cognitive Measurements of Graph Aesthetics , 2002, Inf. Vis..

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

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

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

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

[29]  Petra Mutzel.  An Alternative Method to Crossing Minimization on Hierarchical Graphs , 2001, SIAM J. Optim..

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