Pages that link to "Item:Q1384200"

The following pages link to A better heuristic for orthogonal graph drawings (Q1384200):

Displaying 34 items.

• (Q4858152) (← links)
• Square-Orthogonal Drawing with Few Bends per Edge (Q4925252) (← links)
• The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
• Crossing Layout in Non-planar Graph Drawings (Q5001663) (← links)
• An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings (Q5014120) (← links)
• On Turn-Regular Orthogonal Representations (Q5014121) (← links)
• The Turing Test for Graph Drawing Algorithms (Q5014138) (← links)
• On Turn-Regular Orthogonal Representations (Q5049999) (← links)
• Computing orthogonal drawings with the minimum number of bends (Q5096950) (← links)
• Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles (Q5144877) (← links)
• DYNAMIC POINT LABELING IS STRONGLY PSPACE-COMPLETE (Q5261020) (← links)
• Orthogonal Hypergraph Drawing for Improved Visibility (Q5301385) (← links)
• SOFSEM 2005: Theory and Practice of Computer Science (Q5711521) (← links)
• Accelerated Bend Minimization (Q5895514) (← links)
• Universal slope sets for upward planar drawings (Q5915938) (← links)
• Vertex-edge domination in unit disk graphs (Q5918769) (← links)
• Universal slope sets for upward planar drawings (Q5918782) (← links)
• Capacitated discrete unit disk cover (Q5918931) (← links)
• The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
• Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
• Planar Confluent Orthogonal Drawings of 4-Modal Digraphs (Q6075712) (← links)
• A topology-shape-metrics framework for ortho-radial graph drawing (Q6142347) (← links)
• (Q6150926) (← links)
• Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
• Proper colorability of segment intersection graphs (Q6168981) (← links)
• Sliding column model for t-unit bar visibility representations of graphs (Q6174768) (← links)
• Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
• Semi-total domination in unit disk graphs (Q6547828) (← links)
• Proper colorability of segment intersection graphs (Q6571282) (← links)
• On the parameterized complexity of bend-minimum orthogonal planarity (Q6618248) (← links)
• A Schnyder-type drawing algorithm for 5-connected triangulations (Q6618254) (← links)
• On the parameterized complexity of bend-minimum orthogonal planarity (Q6623586) (← links)
• Unit-length rectangular drawings of graphs (Q6636988) (← links)
• The algorithm and complexity of co-secure domination in geometric intersection graphs (Q6653927) (← links)