The Straight-Line RAC Drawing Problem is NP-Hard

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

[2]  Marc J. van Kreveld,et al.  The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs , 2010, GD.

[3]  Michael A. Bekos,et al.  Maximizing the Total Resolution of Graphs , 2010, Comput. J..

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

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

[6]  R. Fulek,et al.  Drawing Graphs with Orthogonal Crossings , 2010, 1001.3117.

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

[8]  Joachim Gudmundsson,et al.  Notes on Large Angle Crossing Graphs , 2009, Chic. J. Theor. Comput. Sci..

[9]  Walter Didimo,et al.  Drawing graphs with right angle crossings , 2009, Theor. Comput. Sci..

[10]  Peter Eades,et al.  Effects of Crossing Angles , 2008, 2008 IEEE Pacific Visualization Symposium.

[11]  Weidong Huang,et al.  Using eye tracking to investigate graph layout effects , 2007, 2007 6th International Asia-Pacific Symposium on Visualization.

[12]  Hsu-Chun Yen,et al.  A new force-directed graph drawing method based on edge-edge repulsion , 2005, Ninth International Conference on Information Visualisation (IV'05).

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

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

[15]  Helen C. Purchase,et al.  Effective information visualisation: a study of graph drawing aesthetics and algorithms , 2000, Interact. Comput..

[16]  Petra Mutzel,et al.  Planar Polyline Drawings with Good Angular Resolution , 1998, GD.

[17]  Michael Jünger,et al.  Pitfalls of Using PQ-Trees in Automatic Graph Drawing , 1997, GD.

[18]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.

[19]  Seth M. Malitz,et al.  On the angular resolution of planar graphs , 1992, STOC '92.

[20]  R. Tamassia,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[21]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[22]  J. van Leeuwen,et al.  Drawing Graphs , 2001, Lecture Notes in Computer Science.

[23]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[24]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[25]  Michael Kaufmann,et al.  Journal of Graph Algorithms and Applications on the Perspectives Opened by Right Angle Crossing Drawings , 2022 .

[26]  Gerard Tel,et al.  Journal of Graph Algorithms and Applications a Note on Rectilinearity and Angular Resolution , 2022 .