Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings (Q3223969): Difference between revisions

@@ Property / cites work @@
+THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING
+Normal rank
@@ Property / cites work @@
+Turn-regularity and optimal area drawings of orthogonal representations
+Normal rank
@@ Property / cites work @@
+On Rectilinear Drawing of Graphs
@@ Property / cites work: On Rectilinear Drawing of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Degenerate Graphs
@@ Property / cites work: <i>k</i>-Degenerate Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of orthogonal compaction
@@ Property / cites work: On the complexity of orthogonal compaction / rank @@
+Normal rank
@@ Property / cites work @@
+On Embedding a Graph in the Grid with the Minimum Number of Bends
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank