Pages that link to "Item:Q1384191"

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

Displaying 34 items.

• Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
• Non-planar square-orthogonal drawing with few-bend edges (Q744098) (← links)
• Area-efficient static and incremental graph drawings (Q826069) (← 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)
• Orthogonally drawing cubic graphs in parallel (Q1290255) (← links)
• A better heuristic for orthogonal graph drawings (Q1384200) (← links)
• Turn-regularity and optimal area drawings of orthogonal representations (Q1567307) (← links)
• Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
• Modifying orthogonal drawings for label placement (Q1736777) (← links)
• Balanced vertex-orderings of graphs (Q1775059) (← links)
• Efficient orthogonal drawings of high degree graphs (Q1969947) (← 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)
• Optimally extending bistandard graphs on the orthogonal grid (extended abstract) (Q2725986) (← links)
• Algorithms and bounds for overloaded orthogonal drawings (Q2790163) (← links)
• Algorithms and Bounds for L-Drawings of Directed Graphs (Q3177336) (← links)
• Overloaded Orthogonal Drawings (Q3223958) (← links)
• (Q4422263) (← links)
• Drawing Clustered Graphs on an Orthogonal Grid (Q4504998) (← links)
• Techniques for the Refinement of Orthogonal Graph Drawings (Q4511258) (← links)
• Experimental studies on graph drawing algorithms (Q4789076) (← links)
• Square-Orthogonal Drawing with Few Bends per Edge (Q4925252) (← links)
• On Turn-Regular Orthogonal Representations (Q5049999) (← 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)
• Proper colorability of segment intersection graphs (Q6168981) (← links)
• Proper colorability of segment intersection graphs (Q6571282) (← links)