Pages that link to "Item:Q1384200"
From MaRDI portal
The following pages link to A better heuristic for orthogonal graph drawings (Q1384200):
Displaying 50 items.
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- Orthogonal graph drawing with inflexible edges (Q679739) (← links)
- Non-planar square-orthogonal drawing with few-bend edges (Q744098) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- On the two-dimensional orthogonal drawing of series-parallel graphs (Q1026151) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- The complexity of data aggregation in static and dynamic wireless sensor networks (Q2013589) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Quasi-upward planar drawings with minimum curve complexity (Q2151443) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- Liar's domination in unit disk graphs (Q2207495) (← links)
- Orthogeodesic point-set embedding of trees (Q2391540) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Schnyder decompositions for regular plane graphs and application to drawing (Q2429329) (← links)
- Rectangular spiral galaxies are still hard (Q2678258) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING (Q2708038) (← links)
- Orthogonal Graph Drawing with Inflexible Edges (Q2947010) (← links)
- Mario Kart Is Hard (Q2958086) (← links)
- 1-Bend Upward Planar Drawings of SP-Digraphs (Q2961509) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Graph Compact Orthogonal Layout Algorithm (Q3195336) (← links)
- Overloaded Orthogonal Drawings (Q3223958) (← links)
- (Q4789076) (← 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)
- Accelerated Bend Minimization (Q5895514) (← links)
- Universal slope sets for upward planar drawings (Q5915938) (← links)
- Vertex-edge domination in unit disk graphs (Q5918769) (← links)
