Pages that link to "Item:Q1384191"

The following pages link to Algorithms for area-efficient orthogonal drawing (Q1384191):

Displaying 19 items.

• Non-planar square-orthogonal drawing with few-bend edges (Q744098) (← links)
• Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
• Clean the graph before you draw it! (Q987793) (← links)
• Optimal \(st\)-orientations for plane triangulations (Q1029266) (← links)
• Advances in the theory and practice of graph drawing (Q1285778) (← links)
• Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
• Modifying orthogonal drawings for label placement (Q1736777) (← links)
• Balanced vertex-orderings of graphs (Q1775059) (← links)
• NP-completeness of st-orientations for plane graphs (Q2268858) (← links)
• Imbalance is fixed parameter tractable (Q2445234) (← links)
• Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
• THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING (Q2708038) (← links)
• Overloaded Orthogonal Drawings (Q3223958) (← links)
• (Q4789076) (← links)
• Square-Orthogonal Drawing with Few Bends per Edge (Q4925252) (← links)
• Efficient Algorithms for Ortho-Radial Graph Drawing. (Q5088985) (← links)
• Imbalance parameterized by twin cover revisited (Q5925526) (← links)
• The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
• A topology-shape-metrics framework for ortho-radial graph drawing (Q6142347) (← links)